Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400516.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 RefineWMG-PT-010011, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 6.3K Apr 30 02:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 02:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 24K May 10 09:34 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 RefineWMG-PT-010011-LTLFireability-00
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-01
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-02
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-03
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-04
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-05
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-06
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-07
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-08
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-09
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-10
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-11
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-12
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-13
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-14
FORMULA_NAME RefineWMG-PT-010011-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084611550

Running Version 202205111006
[2022-05-20 22:10:13] [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]
[2022-05-20 22:10:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:10:13] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2022-05-20 22:10:13] [INFO ] Transformed 54 places.
[2022-05-20 22:10:13] [INFO ] Transformed 43 transitions.
[2022-05-20 22:10:13] [INFO ] Parsed PT model containing 54 places and 43 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-010011-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 12 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:13] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-20 22:10:13] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:13] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:10:13] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:13] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:13] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 22:10:13] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Support contains 23 out of 54 places after structural reductions.
[2022-05-20 22:10:13] [INFO ] Flatten gal took : 18 ms
[2022-05-20 22:10:13] [INFO ] Flatten gal took : 9 ms
[2022-05-20 22:10:13] [INFO ] Input system was already deterministic with 43 transitions.
Support contains 22 out of 54 places (down from 23) after GAL structural reductions.
Finished random walk after 3220 steps, including 0 resets, run visited all 20 properties in 39 ms. (steps per millisecond=82 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p1)))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:14] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:14] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 22:10:14] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:14] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:10:14] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:14] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 3) (GEQ s13 1)), p1:(LT s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1294 reset in 311 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-02 finished in 725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:14] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:10:15] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:15] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:15] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:15] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:15] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:15] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:16] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 5)], 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 173 reset in 367 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-03 finished in 2666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(((F(p0) U p0)||X(p1)))))))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 13 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 18 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 11 transition count 10
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 9
Applied a total of 52 rules in 82 ms. Remains 10 /54 variables (removed 44) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:10:17] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:10:17] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:10:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-20 22:10:17] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:10:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/54 places, 9/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-05 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:(GEQ s8 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-05 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U G(X(p1))))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:17] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:17] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:18] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 22:10:18] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p0), true, (AND p1 p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s22 1) (GEQ s23 1)), p0:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 417 steps with 31 reset in 2 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-06 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(p0))))))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 39 place count 16 transition count 16
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 16 transition count 9
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 53 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 8 transition count 8
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 7 transition count 7
Applied a total of 57 rules in 4 ms. Remains 7 /54 variables (removed 47) and now considering 7/43 (removed 36) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:10:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:10:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:10:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:10:18] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:10:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:10:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-20 22:10:18] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:10:18] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-20 22:10:18] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/54 places, 7/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 7/43 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-07 finished in 190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (X((p1 U p2))||p0)))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:18] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:18] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:18] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:18] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:18] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:18] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:18] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s38 1), p2:(LT s48 1), p1:(GEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 11 reset in 1 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-08 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G((F(p1)||p0)))&&F(p2))))))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 23 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 29 place count 24 transition count 21
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 24 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 22 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 33 place count 22 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 20 transition count 17
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 19 transition count 16
Applied a total of 39 rules in 13 ms. Remains 19 /54 variables (removed 35) and now considering 16/43 (removed 27) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:10:18] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:10:19] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-20 22:10:19] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-20 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/54 places, 16/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/54 places, 16/43 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LT s17 1), p0:(OR (LT s12 1) (LT s13 1) (LT s15 1)), p1:(OR (LT s6 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-10 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G((X(p0)&&(p1 U X(G(X(p2))))))))))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 22 edges and 54 vertex of which 14 / 54 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 40 transition count 30
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 31 place count 24 transition count 22
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 24 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 35 place count 22 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 20 transition count 18
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 19 transition count 17
Applied a total of 41 rules in 12 ms. Remains 19 /54 variables (removed 35) and now considering 17/43 (removed 26) transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:10:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-20 22:10:19] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:10:19] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/54 places, 17/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/54 places, 17/43 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=p0, acceptance={1} source=1 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 4}, { cond=p1, acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s18 1)), p2:(GEQ s11 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-11 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||!((p1 U p2) U p3)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:19] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:19] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:19] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:19] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:10:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:10:19] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:10:20] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s17 1), p3:(OR (GEQ s38 1) (GEQ s4 5)), p2:(GEQ s27 1), p1:(GEQ s4 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND p1 (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 15 factoid took 329 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-010011-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-010011-LTLFireability-12 finished in 1235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G(F(p0)))))))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 30 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 40 place count 14 transition count 14
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 49 place count 14 transition count 5
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 58 place count 5 transition count 5
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 4 transition count 4
Applied a total of 60 rules in 4 ms. Remains 4 /54 variables (removed 50) and now considering 4/43 (removed 39) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:10:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 22:10:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:10:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:10:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-20 22:10:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:10:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/54 places, 4/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/54 places, 4/43 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-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:(LT s2 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-13 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U !p0)||F(p0)))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 18 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 11 transition count 10
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 9
Applied a total of 52 rules in 11 ms. Remains 10 /54 variables (removed 44) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:10:21] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 22:10:21] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:10:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:10:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/54 places, 9/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-14 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 8 transition count 7
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 7 transition count 6
Applied a total of 55 rules in 3 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:10:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:10:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:10:21] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:10:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 22:10:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:10:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:10:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/54 places, 6/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 6/43 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLFireability-15 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:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLFireability-15 finished in 247 ms.
All properties solved by simple procedures.
Total runtime 8639 ms.

BK_STOP 1653084621749

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-010011"
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 RefineWMG-PT-010011, 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 r186-tajo-165281572400516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 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 ;