Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621263384900

Running Version 0
[2021-05-17 14:56:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:56:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:56:27] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-17 14:56:27] [INFO ] Transformed 254 places.
[2021-05-17 14:56:27] [INFO ] Transformed 203 transitions.
[2021-05-17 14:56:27] [INFO ] Parsed PT model containing 254 places and 203 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:56:27] [INFO ] Initial state test concluded for 2 properties.
FORMULA RefineWMG-PT-050050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 60 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:28] [INFO ] Computed 102 place invariants in 13 ms
[2021-05-17 14:56:28] [INFO ] Dead Transitions using invariants and state equation in 458 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:28] [INFO ] Computed 102 place invariants in 4 ms
[2021-05-17 14:56:28] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:28] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:56:29] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:29] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:56:29] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
[2021-05-17 14:56:29] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 14:56:29] [INFO ] Flatten gal took : 70 ms
FORMULA RefineWMG-PT-050050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:56:29] [INFO ] Flatten gal took : 20 ms
[2021-05-17 14:56:29] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=289 ) properties (out of 29) seen :21
Running SMT prover for 8 properties.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:30] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:56:30] [INFO ] [Real]Absence check using 102 positive place invariants in 10 ms returned sat
[2021-05-17 14:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:30] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-17 14:56:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:30] [INFO ] [Nat]Absence check using 102 positive place invariants in 39 ms returned sat
[2021-05-17 14:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:30] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-17 14:56:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 14:56:31] [INFO ] Added : 88 causal constraints over 18 iterations in 298 ms. Result :sat
[2021-05-17 14:56:31] [INFO ] [Real]Absence check using 102 positive place invariants in 47 ms returned sat
[2021-05-17 14:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:31] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2021-05-17 14:56:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 14:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:31] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-17 14:56:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 14:56:32] [INFO ] Added : 75 causal constraints over 15 iterations in 339 ms. Result :sat
[2021-05-17 14:56:32] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2021-05-17 14:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:32] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-17 14:56:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2021-05-17 14:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:32] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-17 14:56:32] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 14:56:32] [INFO ] Added : 44 causal constraints over 9 iterations in 133 ms. Result :sat
[2021-05-17 14:56:32] [INFO ] [Real]Absence check using 102 positive place invariants in 19 ms returned sat
[2021-05-17 14:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:32] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-17 14:56:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 17 ms returned sat
[2021-05-17 14:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:33] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-17 14:56:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 14:56:33] [INFO ] Added : 104 causal constraints over 21 iterations in 304 ms. Result :sat
[2021-05-17 14:56:33] [INFO ] [Real]Absence check using 102 positive place invariants in 13 ms returned sat
[2021-05-17 14:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-17 14:56:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 14:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:33] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-17 14:56:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:56:33] [INFO ] Added : 37 causal constraints over 8 iterations in 187 ms. Result :sat
[2021-05-17 14:56:33] [INFO ] [Real]Absence check using 102 positive place invariants in 17 ms returned sat
[2021-05-17 14:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:34] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-17 14:56:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 11 ms returned sat
[2021-05-17 14:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-17 14:56:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 14:56:34] [INFO ] Added : 36 causal constraints over 8 iterations in 125 ms. Result :sat
[2021-05-17 14:56:34] [INFO ] [Real]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 14:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:34] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-17 14:56:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2021-05-17 14:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-17 14:56:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:56:34] [INFO ] Added : 79 causal constraints over 16 iterations in 211 ms. Result :sat
[2021-05-17 14:56:34] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-17 14:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:34] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-17 14:56:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:56:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 14:56:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:56:35] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-17 14:56:35] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:56:35] [INFO ] Added : 27 causal constraints over 6 iterations in 144 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U p1))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 23 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:35] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:35] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:35] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:35] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:35] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:35] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:35] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:36] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 481 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050050-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s232 1), p0:(OR (GEQ s140 1) (GEQ s248 1)), p2:(GEQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-050050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-00 finished in 1270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p0)&&F(G(p1)))) U p2))], workingDir=/home/mcc/execution]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 142 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 16 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 191 place count 64 transition count 62
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 233 place count 64 transition count 20
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 275 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 275 place count 22 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 281 place count 19 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 283 place count 18 transition count 16
Applied a total of 283 rules in 108 ms. Remains 18 /254 variables (removed 236) and now considering 16/203 (removed 187) transitions.
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:56:36] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:56:36] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:56:36] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:56:36] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:56:36] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:56:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2021-05-17 14:56:37] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:56:37] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:56:37] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/254 places, 16/203 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s11 1), p0:(GEQ s5 1), p1:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s17 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], 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-050050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-01 finished in 912 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:37] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 14:56:37] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:37] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:37] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:38] [INFO ] Computed 102 place invariants in 39 ms
[2021-05-17 14:56:43] [INFO ] Implicit Places using invariants and state equation in 5739 ms returned []
Implicit Place search using SMT with State Equation took 5974 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:43] [INFO ] Computed 102 place invariants in 3 ms
[2021-05-17 14:56:43] [INFO ] Dead Transitions using invariants and state equation in 272 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-050050-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s61 1) (GEQ s62 1) (GEQ s64 1)), p0:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-050050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-02 finished in 6680 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:44] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:44] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:44] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 14:56:44] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:44] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:44] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:44] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:56:44] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s182 1), p1:(AND (GEQ s141 1) (GEQ s142 1) (GEQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1190 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 4 ms.
FORMULA RefineWMG-PT-050050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-04 finished in 2091 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 198 place count 58 transition count 58
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 44 rules applied. Total rules applied 242 place count 58 transition count 14
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 286 place count 14 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 286 place count 14 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 292 place count 11 transition count 11
Applied a total of 292 rules in 19 ms. Remains 11 /254 variables (removed 243) and now considering 11/203 (removed 192) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:56:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:56:46] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:56:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:56:46] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:56:46] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-17 14:56:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-17 14:56:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:56:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:56:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/254 places, 11/203 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s4 5), p0:(OR (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-05 finished in 227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1)&&(p2||G((!p1&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:46] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:46] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:46] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:46] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:46] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 14:56:46] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:46] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 14:56:47] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s82 1), p1:(LT s240 1), p2:(GEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-06 finished in 973 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((G(p1)||p0)) U X(p2))))], workingDir=/home/mcc/execution]
Support contains 9 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:47] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:47] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:47] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:47] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:47] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:48] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:48] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:53] [INFO ] Dead Transitions using invariants and state equation in 5789 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s211 1) (LT s212 1) (LT s214 1)), p2:(AND (GEQ s161 1) (GEQ s162 1) (GEQ s164 1)), p1:(AND (GEQ s156 1) (GEQ s157 1) (GEQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 106 reset in 1309 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA RefineWMG-PT-050050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-07 finished in 8011 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:55] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:56:55] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:56:55] [INFO ] Computed 102 place invariants in 8 ms
[2021-05-17 14:57:01] [INFO ] Implicit Places using invariants in 5587 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:57:01] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:57:01] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 5807 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:57:01] [INFO ] Computed 102 place invariants in 4 ms
[2021-05-17 14:57:01] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-050050-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s247 1), p0:(GEQ s208 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-09 finished in 6283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&F((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 238 place count 60 transition count 16
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 281 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 281 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 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 289 place count 13 transition count 12
Applied a total of 289 rules in 6 ms. Remains 13 /254 variables (removed 241) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:57:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:57:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:57:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:57:01] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:57:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:57:02] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2021-05-17 14:57:02] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:57:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:57:02] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s6 1), p0:(GEQ s11 1), p2:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 735 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-050050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-10 finished in 860 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:57:02] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:57:02] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:57:02] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:57:02] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:57:02] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:57:02] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:57:02] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:57:03] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s43 1), p1:(GEQ s228 1), p2:(GEQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2036 reset in 825 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 13 ms.
FORMULA RefineWMG-PT-050050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-12 finished in 1476 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 144 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 192 place count 62 transition count 60
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 234 place count 62 transition count 18
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 276 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 276 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 282 place count 17 transition count 15
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 284 place count 16 transition count 14
Applied a total of 284 rules in 17 ms. Remains 16 /254 variables (removed 238) and now considering 14/203 (removed 189) transitions.
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:57:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:57:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:57:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:57:04] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:57:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:57:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2021-05-17 14:57:04] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:57:04] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:57:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/254 places, 14/203 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-050050-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s6 1), p2:(AND (OR (LT s12 1) (LT s13 1) (LT s15 1)) (LT s8 1)), p1:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-13 finished in 314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1)||G(!p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 198 place count 58 transition count 58
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 44 rules applied. Total rules applied 242 place count 58 transition count 14
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 286 place count 14 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 286 place count 14 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 292 place count 11 transition count 11
Applied a total of 292 rules in 18 ms. Remains 11 /254 variables (removed 243) and now considering 11/203 (removed 192) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:57:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:57:04] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:57:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:57:04] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:57:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:57:04] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2021-05-17 14:57:04] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:57:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:57:04] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/254 places, 11/203 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : RefineWMG-PT-050050-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s4 5), p0:(GEQ s10 1), p2:(LT s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22349 reset in 174 ms.
Product exploration explored 100000 steps with 22233 reset in 184 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0) p2)]
Product exploration explored 100000 steps with 22394 reset in 132 ms.
Product exploration explored 100000 steps with 22381 reset in 184 ms.
[2021-05-17 14:57:05] [INFO ] Flatten gal took : 6 ms
[2021-05-17 14:57:05] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:57:05] [INFO ] Time to serialize gal into /tmp/LTL15786547200614419406.gal : 1 ms
[2021-05-17 14:57:05] [INFO ] Time to serialize properties into /tmp/LTL3714447961215412643.ltl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15786547200614419406.gal, -t, CGAL, -LTL, /tmp/LTL3714447961215412643.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15786547200614419406.gal -t CGAL -LTL /tmp/LTL3714447961215412643.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(p225>=1)")||(G("(p1>=5)")))||(G("(p79>=1)")))))
Formula 0 simplified : !F("(p225>=1)" | G"(p1>=5)" | G"(p79>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.146102,19576,1,0,284,17777,45,163,508,20303,1192
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-050050-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-050050-14 finished in 1608 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621263426423

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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