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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 56K 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-025026-00
FORMULA_NAME RefineWMG-PT-025026-01
FORMULA_NAME RefineWMG-PT-025026-02
FORMULA_NAME RefineWMG-PT-025026-03
FORMULA_NAME RefineWMG-PT-025026-04
FORMULA_NAME RefineWMG-PT-025026-05
FORMULA_NAME RefineWMG-PT-025026-06
FORMULA_NAME RefineWMG-PT-025026-07
FORMULA_NAME RefineWMG-PT-025026-08
FORMULA_NAME RefineWMG-PT-025026-09
FORMULA_NAME RefineWMG-PT-025026-10
FORMULA_NAME RefineWMG-PT-025026-11
FORMULA_NAME RefineWMG-PT-025026-12
FORMULA_NAME RefineWMG-PT-025026-13
FORMULA_NAME RefineWMG-PT-025026-14
FORMULA_NAME RefineWMG-PT-025026-15

=== Now, execution of the tool begins

BK_START 1621262846193

Running Version 0
[2021-05-17 14:47: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:47:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:47:27] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-17 14:47:27] [INFO ] Transformed 129 places.
[2021-05-17 14:47:27] [INFO ] Transformed 103 transitions.
[2021-05-17 14:47:27] [INFO ] Parsed PT model containing 129 places and 103 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:47:27] [INFO ] Initial state test concluded for 4 properties.
FORMULA RefineWMG-PT-025026-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 13 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:27] [INFO ] Computed 52 place invariants in 7 ms
[2021-05-17 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:28] [INFO ] Computed 52 place invariants in 9 ms
[2021-05-17 14:47:28] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:28] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-17 14:47:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:28] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
[2021-05-17 14:47:28] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 14:47:28] [INFO ] Flatten gal took : 37 ms
FORMULA RefineWMG-PT-025026-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:47:28] [INFO ] Flatten gal took : 12 ms
[2021-05-17 14:47:28] [INFO ] Input system was already deterministic with 103 transitions.
Finished random walk after 60945 steps, including 1 resets, run visited all 21 properties in 103 ms. (steps per millisecond=591 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 7 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 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 96 place count 33 transition count 32
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 117 place count 33 transition count 11
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 138 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 66 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:47:28] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:47:28] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-17 14:47:28] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-025026-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-01 finished in 367 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 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 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 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 96 place count 33 transition count 32
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 116 place count 33 transition count 12
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 136 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 14 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:29] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:29] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:47:29] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:29] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:47:29] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 14:47:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:47:29] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (LT s5 1) (LT s8 1)), p1:(LT s8 1), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-03 finished in 286 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0) U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:29] [INFO ] Computed 52 place invariants in 5 ms
[2021-05-17 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:29] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:29] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:29] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:29] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:29] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)), p0:(OR (GEQ s23 1) (AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-04 finished in 543 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:29] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:30] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:30] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:30] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:30] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:30] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:30] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:47:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 3), p1:(LT s118 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7 reset in 604 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA RefineWMG-PT-025026-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-05 finished in 992 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(((F(p1) U X(p2))&&p0)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 14:47:30] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:31] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:31] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:31] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:31] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-17 14:47:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:31] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-025026-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1)), p1:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)), p2:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1) (GEQ s48 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 84 reset in 545 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-025026-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-06 finished in 1207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G((G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions, 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 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 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 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 110 place count 37 transition count 17
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 128 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 128 place count 19 transition count 15
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 132 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 134 place count 16 transition count 14
Applied a total of 134 rules in 9 ms. Remains 16 /129 variables (removed 113) and now considering 14/103 (removed 89) transitions.
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:47:32] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:47:32] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:47:32] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:47:32] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:47:32] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-17 14:47:32] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-17 14:47:32] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-17 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/129 places, 14/103 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p1), (NOT p2), (NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025026-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=0 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 8}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=7 dest: 7}, { cond=(AND p2 p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 1)), p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(GEQ s13 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-07 finished in 554 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 14:47:32] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:32] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:32] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:32] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:32] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:32] [INFO ] Computed 52 place invariants in 8 ms
[2021-05-17 14:47:33] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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: 0
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 49 place count 81 transition count 56
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 49 rules in 9 ms. Remains 81 /129 variables (removed 48) and now considering 56/103 (removed 47) transitions.
// Phase 1: matrix 56 rows 81 cols
[2021-05-17 14:47:34] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 14:47:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
[2021-05-17 14:47:34] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 56 rows 81 cols
[2021-05-17 14:47:34] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 14:47:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/129 places, 56/103 transitions.
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Product exploration explored 100000 steps with 50000 reset in 459 ms.
[2021-05-17 14:47:36] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:47:36] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:47:36] [INFO ] Time to serialize gal into /tmp/LTL9648194473794263042.gal : 2 ms
[2021-05-17 14:47:36] [INFO ] Time to serialize properties into /tmp/LTL1014739213659295539.ltl : 0 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/LTL9648194473794263042.gal, -t, CGAL, -LTL, /tmp/LTL1014739213659295539.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/LTL9648194473794263042.gal -t CGAL -LTL /tmp/LTL1014739213659295539.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p19>=1)"))))
Formula 0 simplified : !XF"(p19>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
879 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,8.82228,183636,1,0,6,867222,20,0,5401,1.15942e+06,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-025026-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-025026-09 finished in 12503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, 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 0 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 119 place count 31 transition count 8
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 141 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 141 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 7 transition count 6
Applied a total of 145 rules in 16 ms. Remains 7 /129 variables (removed 122) and now considering 6/103 (removed 97) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:47:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:47:45] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 14:47:45] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:47:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:47:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-17 14:47:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:47:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:47:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/129 places, 6/103 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-10 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-12 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&(X(F(p1)) U G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:45] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:45] [INFO ] Computed 52 place invariants in 10 ms
[2021-05-17 14:47:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:46] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1)), p1:(LT s108 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-13 finished in 565 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 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 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 93 place count 35 transition count 33
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 112 place count 35 transition count 14
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 131 place count 16 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 16 transition count 12
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 135 place count 14 transition count 12
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 137 place count 13 transition count 11
Applied a total of 137 rules in 11 ms. Remains 13 /129 variables (removed 116) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:47:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:47:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:47:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-17 14:47:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:47:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s5 1), p0:(OR (GEQ s5 1) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)))], 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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-14 finished in 265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 67 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
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 91 place count 39 transition count 37
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 107 place count 39 transition count 21
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 123 place count 23 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 123 place count 23 transition count 18
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 129 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 19 transition count 17
Applied a total of 131 rules in 8 ms. Remains 19 /129 variables (removed 110) and now considering 17/103 (removed 86) transitions.
// Phase 1: matrix 17 rows 19 cols
[2021-05-17 14:47:46] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-17 14:47:46] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 14:47:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-17 14:47:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-17 14:47:46] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-17 14:47:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/129 places, 17/103 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025026-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s5 1) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1))), p1:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s18 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 521 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-025026-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-15 finished in 202 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621262867049

--------------------
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-025026"
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-025026, 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-162089416200669"
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 [ "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 ;