Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678624079568

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-24
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-12 12:28:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-12 12:28:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:28:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 12:28:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 12:28:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1163 ms
[2023-03-12 12:28:04] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 288 PT places and 3.3235344E7 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 12:28:04] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 8 ms.
[2023-03-12 12:28:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10006 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 26) seen :25
Finished Best-First random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
[2023-03-12 12:28:04] [INFO ] Flatten gal took : 30 ms
[2023-03-12 12:28:04] [INFO ] Flatten gal took : 6 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:96) in guard (LEQ $x 23)introduces in Quality(96) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:96) in guard (AND (GT $x 23) (LEQ $x 47))introduces in Quality(96) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:96) in guard (AND (GT $x 47) (LEQ $x 71))introduces in Quality(96) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:96) in guard (AND (GT $x 71) (LEQ $x 95))introduces in Quality(96) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 96 reducing to 4 values.
For transition elaborate0:(LEQ $x 23) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 23) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 47) (LEQ $x 71)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 71) (LEQ $x 95)) -> (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 24
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 24
[2023-03-12 12:28:04] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 27 ms.
[2023-03-12 12:28:04] [INFO ] Unfolded 14 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 11 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 12:28:04] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 12:28:05] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
[2023-03-12 12:28:05] [INFO ] Invariant cache hit.
[2023-03-12 12:28:05] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 12:28:05] [INFO ] Invariant cache hit.
[2023-03-12 12:28:05] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-12 12:28:05] [INFO ] Invariant cache hit.
[2023-03-12 12:28:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-12 12:28:05] [INFO ] Flatten gal took : 4 ms
[2023-03-12 12:28:05] [INFO ] Flatten gal took : 3 ms
[2023-03-12 12:28:05] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Finished Best-First random walk after 2269 steps, including 0 resets, run visited all 4 properties in 25 ms. (steps per millisecond=90 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:28:05] [INFO ] Invariant cache hit.
[2023-03-12 12:28:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-12 12:28:05] [INFO ] Invariant cache hit.
[2023-03-12 12:28:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 12:28:05] [INFO ] Invariant cache hit.
[2023-03-12 12:28:06] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-12 12:28:06] [INFO ] Invariant cache hit.
[2023-03-12 12:28:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 40422 reset in 360 ms.
Stack based approach found an accepted trace after 71 steps with 29 reset with depth 4 and stack size 4 in 8 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-00 finished in 864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X(F(!p2)))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:28:06] [INFO ] Invariant cache hit.
[2023-03-12 12:28:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-12 12:28:06] [INFO ] Invariant cache hit.
[2023-03-12 12:28:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 12:28:06] [INFO ] Invariant cache hit.
[2023-03-12 12:28:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-12 12:28:06] [INFO ] Invariant cache hit.
[2023-03-12 12:28:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), true, (NOT p1), p2]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s8 s9 s10 s11)), p1:(LEQ 2 (ADD s8 s9 s10 s11)), p2:(LEQ 1 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-01 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((p1||X(p2)))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:28:07] [INFO ] Invariant cache hit.
[2023-03-12 12:28:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-12 12:28:07] [INFO ] Invariant cache hit.
[2023-03-12 12:28:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 12:28:07] [INFO ] Invariant cache hit.
[2023-03-12 12:28:07] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-12 12:28:07] [INFO ] Invariant cache hit.
[2023-03-12 12:28:07] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(GT 2 s0), p1:(GT (ADD s8 s9 s10 s11) s1), p0:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 239 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 p2 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 23 factoid took 1740 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10020 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 12:28:10] [INFO ] Invariant cache hit.
[2023-03-12 12:28:10] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 12:28:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 12:28:10] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p2 p0 (NOT p1)))), (F (AND p2 p0 p1)), (F (AND (NOT p2) (NOT p0))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 25 factoid took 2269 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 398 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:28:13] [INFO ] Invariant cache hit.
[2023-03-12 12:28:13] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-12 12:28:13] [INFO ] Invariant cache hit.
[2023-03-12 12:28:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 12:28:13] [INFO ] Invariant cache hit.
[2023-03-12 12:28:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-12 12:28:13] [INFO ] Invariant cache hit.
[2023-03-12 12:28:13] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 15 factoid took 1423 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 8190 steps, including 2 resets, run visited all 10 properties in 12 ms. (steps per millisecond=682 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND p2 p0 p1)), (F (AND p0 p1))]
Knowledge based reduction with 15 factoid took 1679 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 170 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 12:28:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 12:28:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-12 12:28:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:28:19] [INFO ] Invariant cache hit.
[2023-03-12 12:28:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin18329173708045234241
[2023-03-12 12:28:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18329173708045234241
Running compilation step : cd /tmp/ltsmin18329173708045234241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 345 ms.
Running link step : cd /tmp/ltsmin18329173708045234241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin18329173708045234241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14523486295519702900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 12:28:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 12:28:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-12 12:28:34] [INFO ] Invariant cache hit.
[2023-03-12 12:28:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 12:28:34] [INFO ] Invariant cache hit.
[2023-03-12 12:28:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-12 12:28:34] [INFO ] Invariant cache hit.
[2023-03-12 12:28:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin9839014555842790584
[2023-03-12 12:28:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9839014555842790584
Running compilation step : cd /tmp/ltsmin9839014555842790584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin9839014555842790584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9839014555842790584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6401547496392157227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-12 12:28:49] [INFO ] Flatten gal took : 2 ms
[2023-03-12 12:28:49] [INFO ] Flatten gal took : 2 ms
[2023-03-12 12:28:49] [INFO ] Time to serialize gal into /tmp/LTL13327184874935513346.gal : 1 ms
[2023-03-12 12:28:49] [INFO ] Time to serialize properties into /tmp/LTL8420788578365802981.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13327184874935513346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16516115621802398994.hoa' '-atoms' '/tmp/LTL8420788578365802981.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8420788578365802981.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16516115621802398994.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-12 12:29:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 12:29:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 12:29:04] [INFO ] Time to serialize gal into /tmp/LTL3538674874349516983.gal : 1 ms
[2023-03-12 12:29:04] [INFO ] Time to serialize properties into /tmp/LTL65954725384490314.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3538674874349516983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL65954725384490314.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !(((G("(((ready_0+ready_1)+(ready_2+ready_3))<=((wait_0+wait_1)+(wait_2+wait_3)))"))||(G(("(((ready_0+ready_1)+(ready_2+ready_3))>theO...196
Formula 0 simplified : F!"(((ready_0+ready_1)+(ready_2+ready_3))<=((wait_0+wait_1)+(wait_2+wait_3)))" & F(!"(((ready_0+ready_1)+(ready_2+ready_3))>theOptio...186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-12 12:29:19] [INFO ] Flatten gal took : 4 ms
[2023-03-12 12:29:19] [INFO ] Applying decomposition
[2023-03-12 12:29:19] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3540178980308832574.txt' '-o' '/tmp/graph3540178980308832574.bin' '-w' '/tmp/graph3540178980308832574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3540178980308832574.bin' '-l' '-1' '-v' '-w' '/tmp/graph3540178980308832574.weights' '-q' '0' '-e' '0.001'
[2023-03-12 12:29:19] [INFO ] Decomposing Gal with order
[2023-03-12 12:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 12:29:19] [INFO ] Flatten gal took : 19 ms
[2023-03-12 12:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-12 12:29:19] [INFO ] Time to serialize gal into /tmp/LTL5512306839921667432.gal : 2 ms
[2023-03-12 12:29:19] [INFO ] Time to serialize properties into /tmp/LTL18029805098490316723.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5512306839921667432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18029805098490316723.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((gu2.ready_0+gu2.ready_1)+(gu2.ready_2+gu2.ready_3))<=((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3)))"))||(G(("(((gu2.read...252
Formula 0 simplified : F!"(((gu2.ready_0+gu2.ready_1)+(gu2.ready_2+gu2.ready_3))<=((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3)))" & F(!"(((gu2.ready_0+...242
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6164655379879754069
[2023-03-12 12:29:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6164655379879754069
Running compilation step : cd /tmp/ltsmin6164655379879754069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin6164655379879754069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6164655379879754069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[](((LTLAPp1==true)||X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-02 finished in 102717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U G(p1))||X(X(F(p2)))))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:29:49] [INFO ] Invariant cache hit.
[2023-03-12 12:29:49] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-03-12 12:29:49] [INFO ] Invariant cache hit.
[2023-03-12 12:29:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 12:29:49] [INFO ] Invariant cache hit.
[2023-03-12 12:29:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-12 12:29:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:29:50] [INFO ] Invariant cache hit.
[2023-03-12 12:29:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s8 s9 s10 s11)), p2:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-12 12:29:51] [INFO ] Invariant cache hit.
[2023-03-12 12:29:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 12:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:29:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 12:29:51] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 12:29:51] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:29:51] [INFO ] Invariant cache hit.
[2023-03-12 12:29:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-12 12:29:51] [INFO ] Invariant cache hit.
[2023-03-12 12:29:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 12:29:51] [INFO ] Invariant cache hit.
[2023-03-12 12:29:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-12 12:29:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:29:51] [INFO ] Invariant cache hit.
[2023-03-12 12:29:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-12 12:29:52] [INFO ] Invariant cache hit.
[2023-03-12 12:29:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 12:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:29:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 12:29:52] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 12:29:52] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 113 ms.
Product exploration explored 100000 steps with 6 reset in 138 ms.
Built C files in :
/tmp/ltsmin12973038155497013707
[2023-03-12 12:29:52] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2023-03-12 12:29:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:29:52] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2023-03-12 12:29:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:29:52] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2023-03-12 12:29:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:29:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12973038155497013707
Running compilation step : cd /tmp/ltsmin12973038155497013707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin12973038155497013707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12973038155497013707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1605436276970937047.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-12 12:30:07] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 12:30:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 12:30:07] [INFO ] Invariant cache hit.
[2023-03-12 12:30:07] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-12 12:30:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:07] [INFO ] Invariant cache hit.
[2023-03-12 12:30:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 10/12 places, 9/10 transitions.
Built C files in :
/tmp/ltsmin14332476213375517994
[2023-03-12 12:30:08] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2023-03-12 12:30:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:30:08] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2023-03-12 12:30:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:30:08] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2023-03-12 12:30:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:30:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14332476213375517994
Running compilation step : cd /tmp/ltsmin14332476213375517994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin14332476213375517994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14332476213375517994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2795456918753386502.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-12 12:30:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 12:30:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 12:30:23] [INFO ] Time to serialize gal into /tmp/LTL13645426910740777040.gal : 1 ms
[2023-03-12 12:30:23] [INFO ] Time to serialize properties into /tmp/LTL4103074673190397276.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13645426910740777040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6676070252970367126.hoa' '-atoms' '/tmp/LTL4103074673190397276.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4103074673190397276.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6676070252970367126.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.31585,19500,1,0,8,3377,34,1,1739,3176,31
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-03 finished in 33604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 12:30:23] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 12:30:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-12 12:30:23] [INFO ] Invariant cache hit.
[2023-03-12 12:30:23] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 12:30:23] [INFO ] Invariant cache hit.
[2023-03-12 12:30:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-12 12:30:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:23] [INFO ] Invariant cache hit.
[2023-03-12 12:30:23] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7) s1), p0:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3 reset in 135 ms.
Stack based approach found an accepted trace after 74 steps with 1 reset with depth 49 and stack size 49 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-04 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-12 12:30:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 12:30:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 12:30:23] [INFO ] Invariant cache hit.
[2023-03-12 12:30:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-12 12:30:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:23] [INFO ] Invariant cache hit.
[2023-03-12 12:30:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-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:(OR (GT 2 (ADD s6 s7 s8 s9)) (GT 1 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 1813 reset in 223 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 14 and stack size 14 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-06 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((!p0||X(p1))))||G((!p1&&X(p0))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 12:30:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 12:30:24] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), false, false, (AND (NOT p1) p0), false, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0), acceptance={} source=3 dest: 8}], [{ cond=p1, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(GT s1 s0), p0:(LEQ 2 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-08 finished in 519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [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.
[2023-03-12 12:30:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:24] [INFO ] Invariant cache hit.
[2023-03-12 12:30:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s0 s3) (LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-09 finished in 300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(G(p1))||G(p2)))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s0 (ADD s8 s9 s10 s11)), p2:(GT 1 (ADD s8 s9 s10 s11)), p1:(AND (GT 2 (ADD s4 s5 s6 s7)) (GT (ADD s8 s9 s10 s11) s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-10 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G((p1&&X((p1 U (p2||G(p1))))))))))'
Support contains 2 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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [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.
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT 2 s3), p0:(AND (LEQ 1 s3) (LEQ s0 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-11 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (F(p2) U p3)))'
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-12 12:30:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 12:30:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-12 12:30:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:25] [INFO ] Invariant cache hit.
[2023-03-12 12:30:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(GT 3 (ADD s2 s3 s4 s5)), p2:(LEQ (ADD s6 s7 s8 s9) s1), p0:(AND (LEQ (ADD s6 s7 s8 s9) (ADD s2 s3 s4 s5)) (LEQ 3 (ADD s2 s3 s4 s5))), p1:(LEQ 3 (ADD s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 365 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-12 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 5 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-12 12:30:26] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:30:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 12:30:26] [INFO ] Invariant cache hit.
[2023-03-12 12:30:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-12 12:30:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:26] [INFO ] Invariant cache hit.
[2023-03-12 12:30:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 8/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-13 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:(GT 2 (ADD s0 s1 s2 s3))], 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 0 reset in 86 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-13 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-12 12:30:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 12:30:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 12:30:26] [INFO ] Invariant cache hit.
[2023-03-12 12:30:26] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-12 12:30:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:30:26] [INFO ] Invariant cache hit.
[2023-03-12 12:30:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s6 s7 s8 s9) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-14 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 4 transition count 6
Applied a total of 12 rules in 5 ms. Remains 4 /12 variables (removed 8) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-12 12:30:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 12:30:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-12 12:30:27] [INFO ] Invariant cache hit.
[2023-03-12 12:30:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 12:30:27] [INFO ] Invariant cache hit.
[2023-03-12 12:30:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-12 12:30:27] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 12:30:27] [INFO ] Invariant cache hit.
[2023-03-12 12:30:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s1 s3) (GT 1 s3)), p1:(GT s1 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-15 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((p1||X(p2)))))'
Found a Lengthening insensitive property : DrinkVendingMachine-COL-24-LTLCardinality-02
Stuttering acceptance computed with spot in 407 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-12 12:30:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 12:30:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-12 12:30:28] [INFO ] Invariant cache hit.
[2023-03-12 12:30:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 12:30:28] [INFO ] Invariant cache hit.
[2023-03-12 12:30:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-12 12:30:28] [INFO ] Invariant cache hit.
[2023-03-12 12:30:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 134 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(GT 2 s0), p1:(GT (ADD s6 s7 s8 s9) s1), p0:(LEQ (ADD s6 s7 s8 s9) (ADD s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 234 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 p2 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 23 factoid took 1608 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 12:30:30] [INFO ] Invariant cache hit.
[2023-03-12 12:30:30] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 12:30:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:30:30] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p2 p0 (NOT p1)))), (F (AND p2 p0 p1)), (F (AND (NOT p2) (NOT p0))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 25 factoid took 2327 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-12 12:30:33] [INFO ] Invariant cache hit.
[2023-03-12 12:30:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-12 12:30:33] [INFO ] Invariant cache hit.
[2023-03-12 12:30:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 12:30:33] [INFO ] Invariant cache hit.
[2023-03-12 12:30:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-12 12:30:33] [INFO ] Invariant cache hit.
[2023-03-12 12:30:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 15 factoid took 1141 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 1368 steps, including 0 resets, run visited all 10 properties in 3 ms. (steps per millisecond=456 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND p2 p0 p1)), (F (AND p0 p1))]
Knowledge based reduction with 15 factoid took 1430 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-12 12:30:38] [INFO ] Invariant cache hit.
[2023-03-12 12:30:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-12 12:30:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 12:30:38] [INFO ] Invariant cache hit.
[2023-03-12 12:30:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 10/10 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin14063515110893650521
[2023-03-12 12:30:38] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14063515110893650521
Running compilation step : cd /tmp/ltsmin14063515110893650521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin14063515110893650521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14063515110893650521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5569187360484363248.hoa' '--buchi-type=spotba'
LTSmin run took 5505 ms.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-02 finished in 16466 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-12 12:30:44] [INFO ] Flatten gal took : 2 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 161320 ms.

BK_STOP 1678624245222

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-COL-24"
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-5348"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-COL-24, 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 r133-smll-167819411400595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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