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-165281572400507.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-010010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 02:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 02:30 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.8K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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-010010-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-010010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653084519452

Running Version 202205111006
[2022-05-20 22:08:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:08:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:08:40] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2022-05-20 22:08:40] [INFO ] Transformed 54 places.
[2022-05-20 22:08:40] [INFO ] Transformed 43 transitions.
[2022-05-20 22:08:40] [INFO ] Parsed PT model containing 54 places and 43 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA RefineWMG-PT-010010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 11 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:08:41] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 22:08:41] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:41] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:41] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:41] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Support contains 25 out of 54 places after structural reductions.
[2022-05-20 22:08:41] [INFO ] Flatten gal took : 19 ms
[2022-05-20 22:08:41] [INFO ] Flatten gal took : 9 ms
[2022-05-20 22:08:41] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:41] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2022-05-20 22:08:41] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 22:08:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2022-05-20 22:08:41] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 22:08:41] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 22:08:42] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 183 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Parikh walk visited 3 properties in 18 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(X(F(p1)))&&p2)))'
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 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:08:42] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:08:42] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:42] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 22:08:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:42] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 22:08:42] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:42] [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 828 ms :[(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p0 p1) (AND p2 (NOT p0) (NOT p1)) (AND p2 (NOT p0) p1) (AND p2 p0 (NOT p1))), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s39 s30), p0:(GT 2 s50), p1:(LEQ s51 s39)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 395 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 23 in 8 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-02 finished in 1598 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0)&&X(G(p1))) U 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 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:08:43] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:44] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:44] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:44] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s20), p1:(LEQ s25 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-03 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X((F(G((F(p0)||p1)))||X(p1)))))))'
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 28 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 5 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 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 34 place count 18 transition count 16
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 18 transition count 12
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 44 place count 13 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 48 place count 11 transition count 9
Applied a total of 48 rules in 25 ms. Remains 11 /54 variables (removed 43) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 11 cols
[2022-05-20 22:08:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 9 rows 11 cols
[2022-05-20 22:08:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2022-05-20 22:08:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 22:08:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2022-05-20 22:08:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/54 places, 9/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s10), p0:(GT s7 s5)], 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 1286 steps with 0 reset in 6 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-04 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U !p0)&&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 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 45 place count 16 transition count 7
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 53 place count 8 transition count 7
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 8 transition count 6
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 7 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:08:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:08:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-20 22:08:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 29 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 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s5), p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-06 finished in 286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!F(p0)||G(p1))) U X((X(p2)&&p3))))'
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:08:44] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:44] [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:08:44] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:45] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:45] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:45] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:45] [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 1016 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (AND (NOT p1) p0), (OR (NOT p2) (NOT p3) (AND p0 (NOT p1))), (NOT p2), true, (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p0), (OR (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p0), (OR (NOT p2) (NOT p1)), p0, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 10}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={0} source=0 dest: 15}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0} source=0 dest: 16}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=0 dest: 17}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 18}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 17}, { cond=(AND p0 p1), acceptance={} source=1 dest: 18}], [{ cond=(AND (NOT p0) p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 10}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=2 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=2 dest: 15}, { cond=(AND p0 p1 p3), acceptance={0} source=2 dest: 16}], [{ cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=3 dest: 15}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=3 dest: 16}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 12}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 10}, { cond=(AND p0 p3), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 12}, { cond=(AND p1 p3), acceptance={} source=8 dest: 14}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=9 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=9 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=9 dest: 13}, { cond=(AND p0 p1 p3), acceptance={} source=9 dest: 14}], [{ cond=p0, acceptance={0} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p0) p3), acceptance={0} source=10 dest: 15}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=11 dest: 11}, { cond=(AND p1 p3), acceptance={0} source=11 dest: 16}], [{ cond=(NOT p2), acceptance={} source=12 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=14 dest: 16}], [{ cond=p0, acceptance={0} source=15 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=15 dest: 10}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=15 dest: 15}, { cond=(AND (NOT p0) p2), acceptance={0} source=15 dest: 17}], [{ cond=(NOT p1), acceptance={0} source=16 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=16 dest: 11}, { cond=(AND p1 p3 (NOT p2)), acceptance={0} source=16 dest: 16}, { cond=(AND p1 p2), acceptance={0} source=16 dest: 18}], [{ cond=p0, acceptance={} source=17 dest: 4}, { cond=(NOT p0), acceptance={} source=17 dest: 17}], [{ cond=(NOT p1), acceptance={} source=18 dest: 4}, { cond=p1, acceptance={} source=18 dest: 18}]], initial=5, aps=[p0:(OR (LEQ s40 s28) (LEQ s45 s4)), p1:(LEQ s45 s4), p3:(LEQ s46 s45), p2:(LEQ s40 s28)], 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-09 finished in 1346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(p0))||G(p1)))&&G(G(X(F(p2))))))'
Support contains 4 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 25 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 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 30 place count 22 transition count 19
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 22 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 18 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 18 transition count 14
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 40 place count 17 transition count 14
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 42 place count 16 transition count 13
Applied a total of 42 rules in 8 ms. Remains 16 /54 variables (removed 38) and now considering 13/43 (removed 30) transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:08:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:08:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:08:46] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-20 22:08:46] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:08:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:08:46] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-20 22:08:46] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:08:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:08:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/54 places, 13/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/54 places, 13/43 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s8), p2:(GT s6 s15), p0:(LEQ 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-10 finished in 475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(p0)))))'
Support contains 2 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:08:46] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:46] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:46] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:08:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:46] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT s3 s33)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 1607 reset in 320 ms.
Stack based approach found an accepted trace after 36 steps with 3 reset with depth 12 and stack size 12 in 1 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-12 finished in 752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0)||p1) U G(!X(X((F(p2)||p2))))))'
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 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:08:47] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:47] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:47] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:47] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:47] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:47] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:47] [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 127 ms :[(AND p0 p2), p2, true, p2]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(LEQ 3 s12), p2:(LEQ 2 s24), p1:(LEQ 2 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 248 ms.
Stack based approach found an accepted trace after 468 steps with 0 reset with depth 469 and stack size 456 in 3 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-13 finished in 666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||p1))||F(G(X(X(!p1))))))'
Support contains 2 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:08:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:48] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 13 ms
[2022-05-20 22:08:48] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:48] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:48] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 909 ms :[false, false, (AND (NOT p0) p1), p1]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s29), p0:(LEQ 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Stack based approach found an accepted trace after 301 steps with 0 reset with depth 302 and stack size 294 in 1 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-14 finished in 1565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G((G(p1)||(G(p2)&&p3))))))'
Support contains 6 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:08:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:49] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:49] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p3 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=2 dest: 5}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 7}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s14 s10), p3:(LEQ s44 s2), p2:(GT 1 s11), p1:(GT s2 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 569 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLCardinality-15 finished in 547 ms.
All properties solved by simple procedures.
Total runtime 9585 ms.

BK_STOP 1653084530354

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-010010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-010010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572400507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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