About the Execution of ITS-Tools for RefineWMG-PT-010011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
419.848 | 20693.00 | 38306.00 | 133.00 | FFFFFTTTFFFFFFFF | normal |
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-162089416100637.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-010011, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100637
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K 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.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.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 1.9K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 10K 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 24K 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-010011-00
FORMULA_NAME RefineWMG-PT-010011-01
FORMULA_NAME RefineWMG-PT-010011-02
FORMULA_NAME RefineWMG-PT-010011-03
FORMULA_NAME RefineWMG-PT-010011-04
FORMULA_NAME RefineWMG-PT-010011-05
FORMULA_NAME RefineWMG-PT-010011-06
FORMULA_NAME RefineWMG-PT-010011-07
FORMULA_NAME RefineWMG-PT-010011-08
FORMULA_NAME RefineWMG-PT-010011-09
FORMULA_NAME RefineWMG-PT-010011-10
FORMULA_NAME RefineWMG-PT-010011-11
FORMULA_NAME RefineWMG-PT-010011-12
FORMULA_NAME RefineWMG-PT-010011-13
FORMULA_NAME RefineWMG-PT-010011-14
FORMULA_NAME RefineWMG-PT-010011-15
=== Now, execution of the tool begins
BK_START 1621261791838
Running Version 0
[2021-05-17 14:29:54] [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:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:29:54] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-17 14:29:54] [INFO ] Transformed 54 places.
[2021-05-17 14:29:54] [INFO ] Transformed 43 transitions.
[2021-05-17 14:29:54] [INFO ] Parsed PT model containing 54 places and 43 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:29:54] [INFO ] Initial state test concluded for 1 properties.
FORMULA RefineWMG-PT-010011-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 58 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:55] [INFO ] Computed 22 place invariants in 11 ms
[2021-05-17 14:29:55] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:55] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 14:29:55] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:55] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:55] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:55] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
[2021-05-17 14:29:55] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 14:29:55] [INFO ] Flatten gal took : 41 ms
FORMULA RefineWMG-PT-010011-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:29:55] [INFO ] Flatten gal took : 33 ms
[2021-05-17 14:29:55] [INFO ] Input system was already deterministic with 43 transitions.
Finished random walk after 4312 steps, including 0 resets, run visited all 20 properties in 28 ms. (steps per millisecond=154 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p0)&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:55] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:55] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:55] [INFO ] Computed 22 place invariants in 8 ms
[2021-05-17 14:29:55] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:56] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:56] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s51 1) (GEQ s52 1)), p0:(LT s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 65 reset in 465 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-010011-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-00 finished in 1171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(((p1||X(G(p2))) U (p0&&(p1||X(G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 17 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:57] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:57] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:57] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:57] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 14:29:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:57] [INFO ] Computed 22 place invariants in 23 ms
[2021-05-17 14:29:59] [INFO ] Dead Transitions using invariants and state equation in 1815 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true]
Running random walk in product with property : RefineWMG-PT-010011-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s26 1) (GEQ s27 1) (GEQ s29 1)), p2:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 365 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-01 finished in 2311 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 3 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 18 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 9
Applied a total of 52 rules in 28 ms. Remains 10 /54 variables (removed 44) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:29:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:29:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:29:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:29:59] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:29:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:29:59] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2021-05-17 14:29:59] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:29:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:29:59] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-03 finished in 770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:00] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:00] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:00] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:00] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:00] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:00] [INFO ] Computed 22 place invariants in 12 ms
[2021-05-17 14:30:00] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-010011-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s20 1), p0:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 371 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-010011-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-04 finished in 869 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 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:00] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:00] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:00] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:01] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:01] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:01] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:01] [INFO ] Computed 22 place invariants in 13 ms
[2021-05-17 14:30:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s30 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 274 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 34 transition count 24
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 19 rules in 6 ms. Remains 34 /54 variables (removed 20) and now considering 24/43 (removed 19) transitions.
// Phase 1: matrix 24 rows 34 cols
[2021-05-17 14:30:02] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:30:02] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
[2021-05-17 14:30:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 24 rows 34 cols
[2021-05-17 14:30:02] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 14:30:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/54 places, 24/43 transitions.
Product exploration explored 100000 steps with 50000 reset in 409 ms.
Product exploration explored 100000 steps with 50000 reset in 546 ms.
[2021-05-17 14:30:03] [INFO ] Flatten gal took : 19 ms
[2021-05-17 14:30:03] [INFO ] Flatten gal took : 5 ms
[2021-05-17 14:30:03] [INFO ] Time to serialize gal into /tmp/LTL3212407369806899752.gal : 12 ms
[2021-05-17 14:30:03] [INFO ] Time to serialize properties into /tmp/LTL15891973643559738042.ltl : 1 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/LTL3212407369806899752.gal, -t, CGAL, -LTL, /tmp/LTL15891973643559738042.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/LTL3212407369806899752.gal -t CGAL -LTL /tmp/LTL15891973643559738042.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p27<1)"))))
Formula 0 simplified : !XF"(p27<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
53 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.550092,30892,1,0,6,80417,20,0,1646,99438,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-010011-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-010011-05 finished in 3502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:04] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:04] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:04] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:04] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:04] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:04] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:04] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-010011-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s2 2)), p1:(OR (AND (GEQ s36 1) (GEQ s37 1) (GEQ s39 1)) (AND (GEQ s0 1) (GEQ s51 1) (GEQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 24 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 38 transition count 28
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 16 rules in 4 ms. Remains 38 /54 variables (removed 16) and now considering 28/43 (removed 15) transitions.
// Phase 1: matrix 28 rows 38 cols
[2021-05-17 14:30:05] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 14:30:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
[2021-05-17 14:30:06] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 28 rows 38 cols
[2021-05-17 14:30:06] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 14:30:06] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/54 places, 28/43 transitions.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
[2021-05-17 14:30:06] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:30:06] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:30:06] [INFO ] Time to serialize gal into /tmp/LTL14871699910414945490.gal : 1 ms
[2021-05-17 14:30:06] [INFO ] Time to serialize properties into /tmp/LTL16002876992393901032.ltl : 1 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/LTL14871699910414945490.gal, -t, CGAL, -LTL, /tmp/LTL16002876992393901032.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/LTL14871699910414945490.gal -t CGAL -LTL /tmp/LTL16002876992393901032.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((((p33>=1)&&(p34>=1))&&(p36>=1))||(((p>=1)&&(p48>=1))&&(p49>=1)))")))||("((pprime>=2)&&(psecond>=2))")))))
Formula 0 simplified : !XF("((pprime>=2)&&(psecond>=2))" | GF"((((p33>=1)&&(p34>=1))&&(p36>=1))||(((p>=1)&&(p48>=1))&&(p49>=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
67 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.697628,31364,1,0,6,80417,21,0,1666,99438,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-010011-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-010011-07 finished in 3004 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 39 place count 16 transition count 16
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 16 transition count 9
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 53 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 7 transition count 7
Applied a total of 57 rules in 7 ms. Remains 7 /54 variables (removed 47) and now considering 7/43 (removed 36) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:30:07] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:30:07] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:30:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2021-05-17 14:30:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:30:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 7/43 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-09 finished in 589 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G((F(!p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:08] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:08] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:08] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), true, p2, (OR (NOT p1) p2)]
Running random walk in product with property : RefineWMG-PT-010011-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s30 1) (GEQ s45 1)), p1:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 1)), p2:(LT s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-10 finished in 477 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:08] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:10] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:10] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:30:10] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-11 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:(GEQ s35 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-010011-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-11 finished in 2080 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 18 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 9
Applied a total of 52 rules in 4 ms. Remains 10 /54 variables (removed 44) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:30:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:30:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:30:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:10] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-17 14:30:10] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:30:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:10] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, 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, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-12 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:10] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:10] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:30:10] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:30:10] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:30:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-13 automaton TGBA [mat=[[{ cond=(NOT p1), 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s32 1) (LT s25 1)), p0:(GEQ s45 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]]
Product exploration explored 100000 steps with 134 reset in 330 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA RefineWMG-PT-010011-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-13 finished in 792 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 7 transition count 6
Applied a total of 55 rules in 13 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:30:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:30:11] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:30:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:30:11] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:30:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:30:11] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 14:30:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:30:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:30:11] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 6/43 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0]
Running random walk in product with property : RefineWMG-PT-010011-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-14 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G((F(G(p1))&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 23 edges and 54 vertex of which 14 / 54 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 40 transition count 30
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 34 place count 22 transition count 21
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 19 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 40 place count 19 transition count 16
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 44 place count 17 transition count 16
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 46 place count 16 transition count 15
Applied a total of 46 rules in 12 ms. Remains 16 /54 variables (removed 38) and now considering 15/43 (removed 28) transitions.
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 14:30:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 14:30:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:11] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 14:30:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-17 14:30:11] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 14:30:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/54 places, 15/43 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-010011-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s5 1), p0:(GEQ s14 1), p2:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 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 160 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-15 finished in 336 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621261812531
--------------------
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-010011"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-010011, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416100637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;