Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875500517.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DrinkVendingMachine-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875500517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 362K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 68K May 5 16:51 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-PT-02-00
FORMULA_NAME DrinkVendingMachine-PT-02-01
FORMULA_NAME DrinkVendingMachine-PT-02-02
FORMULA_NAME DrinkVendingMachine-PT-02-03
FORMULA_NAME DrinkVendingMachine-PT-02-04
FORMULA_NAME DrinkVendingMachine-PT-02-05
FORMULA_NAME DrinkVendingMachine-PT-02-06
FORMULA_NAME DrinkVendingMachine-PT-02-07
FORMULA_NAME DrinkVendingMachine-PT-02-08
FORMULA_NAME DrinkVendingMachine-PT-02-09
FORMULA_NAME DrinkVendingMachine-PT-02-10
FORMULA_NAME DrinkVendingMachine-PT-02-11
FORMULA_NAME DrinkVendingMachine-PT-02-12
FORMULA_NAME DrinkVendingMachine-PT-02-13
FORMULA_NAME DrinkVendingMachine-PT-02-14
FORMULA_NAME DrinkVendingMachine-PT-02-15

=== Now, execution of the tool begins

BK_START 1620623049369

Running Version 0
[2021-05-10 05:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 05:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 05:04:45] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-10 05:04:45] [INFO ] Transformed 24 places.
[2021-05-10 05:04:45] [INFO ] Transformed 72 transitions.
[2021-05-10 05:04:45] [INFO ] Parsed PT model containing 24 places and 72 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 05:04:45] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-10 05:04:45] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 17 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 24 cols
[2021-05-10 05:04:46] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-10 05:04:46] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 21, 22, 24, 25, 31]
Found 24 dead transitions using SMT.
Drop transitions removed 24 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 24 transitions :[31, 25, 24, 22, 21, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
// Phase 1: matrix 28 rows 24 cols
[2021-05-10 05:04:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-10 05:04:46] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 28 rows 24 cols
[2021-05-10 05:04:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-10 05:04:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 24 cols
[2021-05-10 05:04:46] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-10 05:04:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 24/24 places, 28/52 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 26/28 (removed 2) transitions.
// Phase 1: matrix 26 rows 24 cols
[2021-05-10 05:04:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-10 05:04:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/24 places, 26/52 transitions.
[2021-05-10 05:04:46] [INFO ] Found a total of 4 fixed domain variables (out of 24 variables) in GAL type petri
[2021-05-10 05:04:46] [INFO ] Found a total of 4 constant array cells/variables (out of 24 variables) in type petri
[2021-05-10 05:04:46] [INFO ] ready_7,wait_7,wait_8,ready_8,
[2021-05-10 05:04:46] [INFO ] Removed 4 constant variables :ready_7=0, wait_7=1, wait_8=1, ready_8=0
[2021-05-10 05:04:46] [INFO ] Simplified 61 expressions due to constant valuations.
[2021-05-10 05:04:46] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-10 05:04:46] [INFO ] Flatten gal took : 33 ms
[2021-05-10 05:04:46] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 05:04:46] [INFO ] Flatten gal took : 8 ms
[2021-05-10 05:04:46] [INFO ] Input system was already deterministic with 26 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=207 ) properties (out of 24) seen :19
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:47] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned unsat
[2021-05-10 05:04:47] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned unsat
[2021-05-10 05:04:47] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned unsat
[2021-05-10 05:04:47] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned unsat
[2021-05-10 05:04:47] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
[2021-05-10 05:04:47] [INFO ] Initial state test concluded for 2 properties.
FORMULA DrinkVendingMachine-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p2)||p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:47] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-10 05:04:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : DrinkVendingMachine-PT-02-00 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (GEQ s17 1) (GEQ s19 1)), p0:(AND (LT s16 1) (LT s18 1)), p1:(OR (AND (GEQ s1 1) (GEQ s7 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DrinkVendingMachine-PT-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-00 finished in 318 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:47] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-10 05:04:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s7 1) (LT s8 1)) (OR (LT s2 1) (LT s6 1) (LT s9 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s9 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s8 1)) (OR (LT s3 1) (LT s6 1) (LT s8 1)) (OR (LT s3 1) (LT s7 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 30161 reset in 323 ms.
Stack based approach found an accepted trace after 181 steps with 57 reset with depth 6 and stack size 6 in 1 ms.
FORMULA DrinkVendingMachine-PT-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-02 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 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 12 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 12 transition count 16
Applied a total of 18 rules in 9 ms. Remains 12 /20 variables (removed 8) and now considering 16/26 (removed 10) transitions.
// Phase 1: matrix 16 rows 12 cols
[2021-05-10 05:04:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 05:04:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2021-05-10 05:04:47] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 05:04:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-10 05:04:47] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2021-05-10 05:04:47] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 05:04:47] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/20 places, 16/26 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s2 1) (LT s4 2)) (OR (LT s0 1) (LT s2 1) (LT s4 1) (LT s5 1)) (OR (LT s1 1) (LT s2 1) (LT s5 2)) (OR (LT s1 1) (LT s3 1) (LT s4 2)) (OR (LT s0 1) (LT s3 1) (LT s4 1) (LT s5 1)) (OR (LT s0 1) (LT s2 1) (LT s4 2)) (OR (LT s0 1) (LT s2 1) (LT s5 2)) (OR (LT s1 1) (LT s2 1) (LT s4 1) (LT s5 1)) (OR (LT s0 1) (LT s3 1) (LT s4 2)) (OR (LT s1 1) (LT s3 1) (LT s4 1) (LT s5 1)) (OR (LT s0 1) (LT s3 1) (LT s5 2)) (OR (LT s1 1) (LT s3 1) (LT s5 2)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 44580 reset in 198 ms.
Stack based approach found an accepted trace after 69 steps with 32 reset with depth 2 and stack size 2 in 0 ms.
FORMULA DrinkVendingMachine-PT-02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-03 finished in 326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((F(p1)||p0)&&(X(G(!p3))||p2)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:48] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:48] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:48] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:48] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3))]
Running random walk in product with property : DrinkVendingMachine-PT-02-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s14 1) (GEQ s15 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1)), p1:(OR (GEQ s14 1) (GEQ s15 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1)), p2:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s9 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s9 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s9 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s8 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s8 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s9 1))), p3:(AND (OR (LT s2 1) (LT s7 1) (LT s8 1)) (OR (LT s2 1) (LT s6 1) (LT s9 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s9 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s8 1)) (OR (LT s3 1) (LT s6 1) (LT s8 1)) (OR (LT s3 1) (LT s7 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 35222 reset in 271 ms.
Stack based approach found an accepted trace after 16 steps with 5 reset with depth 5 and stack size 5 in 0 ms.
FORMULA DrinkVendingMachine-PT-02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-04 finished in 567 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 8 transition count 20
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 28 place count 8 transition count 10
Applied a total of 28 rules in 3 ms. Remains 8 /20 variables (removed 12) and now considering 10/26 (removed 16) transitions.
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 05:04:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 05:04:48] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 05:04:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 05:04:48] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-10 05:04:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 05:04:48] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-10 05:04:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/20 places, 10/26 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s2 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-05 finished in 96 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0)) U G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:48] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:48] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:48] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:48] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-PT-02-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s18 1), p1:(AND (LT s18 1) (LT s16 1)), p0:(OR (LT s1 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10566 reset in 192 ms.
Stack based approach found an accepted trace after 291 steps with 31 reset with depth 10 and stack size 10 in 1 ms.
FORMULA DrinkVendingMachine-PT-02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-09 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))||(p1&&F(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:49] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:49] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:49] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:49] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s6 1)), p0:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7040 reset in 193 ms.
Stack based approach found an accepted trace after 70 steps with 5 reset with depth 22 and stack size 22 in 0 ms.
FORMULA DrinkVendingMachine-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-10 finished in 368 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0)||(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:49] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:49] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:49] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:49] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 194 ms :[p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-PT-02-12 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s6 1)), p2:(AND (LT s13 1) (OR (LT s1 1) (LT s6 1))), p1:(OR (LT s1 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 35496 reset in 158 ms.
Stack based approach found an accepted trace after 52 steps with 16 reset with depth 20 and stack size 20 in 0 ms.
FORMULA DrinkVendingMachine-PT-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-12 finished in 420 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:50] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 05:04:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2021-05-10 05:04:50] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 05:04:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s8 2) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 2)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-13 finished in 121 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620623142481

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-PT-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875500517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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