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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 5.5K Apr 30 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 02:34 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 23K 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 56K 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-025026-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653085712899

Running Version 202205111006
[2022-05-20 22:28:34] [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:28:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:28:34] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-20 22:28:34] [INFO ] Transformed 129 places.
[2022-05-20 22:28:34] [INFO ] Transformed 103 transitions.
[2022-05-20 22:28:34] [INFO ] Parsed PT model containing 129 places and 103 transitions in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-025026-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 14 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:34] [INFO ] Computed 52 place invariants in 7 ms
[2022-05-20 22:28:34] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:34] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:34] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:34] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:28:34] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:34] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:28:34] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Support contains 35 out of 129 places after structural reductions.
[2022-05-20 22:28:35] [INFO ] Flatten gal took : 27 ms
[2022-05-20 22:28:35] [INFO ] Flatten gal took : 12 ms
[2022-05-20 22:28:35] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:35] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:35] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 22:28:35] [INFO ] [Nat]Absence check using 52 positive place invariants in 9 ms returned sat
[2022-05-20 22:28:35] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-20 22:28:35] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-20 22:28:35] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 1375 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=55 )
Parikh walk visited 10 properties in 123 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' '!(((G(p0) U p1)&&G(X(p2))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:36] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:36] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:36] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:36] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:36] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:36] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:36] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:36] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 339 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s97 s17), p0:(LEQ s24 s20), p2:(LEQ 2 s92)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4281 steps with 0 reset in 73 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-01 finished in 783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U p1)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 74 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 2 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 97 place count 31 transition count 30
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 116 place count 31 transition count 11
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 136 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 137 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 9 transition count 8
Applied a total of 141 rules in 21 ms. Remains 9 /129 variables (removed 120) and now considering 8/103 (removed 95) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-20 22:28:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/129 places, 8/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/129 places, 8/103 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LEQ 1 s5) (LEQ 2 s7))], 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-025026-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-02 finished in 194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 119 place count 31 transition count 11
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 140 place count 11 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 10 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 141 place count 10 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 9 transition count 9
Applied a total of 143 rules in 18 ms. Remains 9 /129 variables (removed 120) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-20 22:28:37] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-20 22:28:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/129 places, 9/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s5)], 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 1 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-04 finished in 200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(p0) U X(p1))))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:37] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:37] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:37] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:37] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:28:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:37] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (LEQ 3 s114) (LEQ s24 s89)) (LEQ s68 s23) (LEQ s88 s127)), p1:(LEQ 3 s114)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-05 finished in 505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p1||G(p2)))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 18 rules applied. Total rules applied 117 place count 31 transition count 13
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 20 rules applied. Total rules applied 137 place count 13 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 11 transition count 11
Applied a total of 139 rules in 9 ms. Remains 11 /129 variables (removed 118) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:28:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:28:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:28:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:28:38] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:28:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 22:28:38] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-20 22:28:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:28:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/129 places, 11/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s10), p1:(LEQ 3 s5), p2:(LEQ 2 s8)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-06 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!X(G(X(X(p0)))) U p1))&&G(F(!p0))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 111 place count 37 transition count 16
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 130 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 130 place count 18 transition count 14
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 134 place count 16 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 136 place count 15 transition count 13
Applied a total of 136 rules in 6 ms. Remains 15 /129 variables (removed 114) and now considering 13/103 (removed 90) transitions.
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:28:38] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:28:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:28:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:28:38] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:28:38] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:28:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 22:28:38] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:28:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:28:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/129 places, 13/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/129 places, 13/103 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0), p0]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ s14 s10), p1:(LEQ s5 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-07 finished in 391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:38] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:28:38] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:38] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:38] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:38] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:28:38] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:38] [INFO ] Computed 52 place invariants in 7 ms
[2022-05-20 22:28:39] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s66 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-08 finished in 621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&p1))||X(p1)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:39] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:28:39] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:39] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:28:39] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:39] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:39] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:39] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s45 s102), p0:(LEQ 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Product exploration explored 100000 steps with 50000 reset in 382 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025026-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025026-LTLCardinality-10 finished in 1610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(F(G((G(p0)&&X(p1)))))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 114 place count 35 transition count 15
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 133 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 133 place count 16 transition count 13
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 137 place count 14 transition count 13
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 139 place count 13 transition count 12
Applied a total of 139 rules in 5 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:28:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:28:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:28:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:28:40] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:28:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:28:40] [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:28:40] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:28:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:28:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 12/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s8), p1:(GT s6 s11)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-11 finished in 212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((X(!(p0 U !p0))||p1)&&p0))||p2)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:41] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:41] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:41] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:28:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:41] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:41] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:41] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:41] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(LEQ 1 s106), p0:(GT s62 s77)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025026-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025026-LTLCardinality-12 finished in 1290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U !p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 98 place count 33 transition count 33
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 119 place count 33 transition count 12
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 140 place count 12 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 140 place count 12 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 144 place count 10 transition count 10
Applied a total of 144 rules in 11 ms. Remains 10 /129 variables (removed 119) and now considering 10/103 (removed 93) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:28:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:28:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:28:42] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:28:42] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:28:42] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:28:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-20 22:28:42] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:28:42] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:28:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 10/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 10/103 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s9 s5)], 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-025026-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-13 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p0))||p1))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:42] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:28:42] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:42] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:42] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:28:42] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(GT 3 s94), p1:(LEQ s9 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025026-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025026-LTLCardinality-15 finished in 1193 ms.
All properties solved by simple procedures.
Total runtime 9662 ms.

BK_STOP 1653085723828

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

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