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 |
453.352 | 12700.00 | 25960.00 | 156.90 | FFFFFTFFTTFFFFFF | 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-162089416100636.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100636
=====================================================================
--------------------
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 1621261784924
Running Version 0
[2021-05-17 14:29:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:29:48] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2021-05-17 14:29:48] [INFO ] Transformed 54 places.
[2021-05-17 14:29:48] [INFO ] Transformed 43 transitions.
[2021-05-17 14:29:48] [INFO ] Parsed PT model containing 54 places and 43 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:29:48] [INFO ] Initial state test concluded for 1 properties.
FORMULA RefineWMG-PT-010011-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 21 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:48] [INFO ] Computed 22 place invariants in 8 ms
[2021-05-17 14:29:48] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:48] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:48] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:48] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:48] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:48] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
[2021-05-17 14:29:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:29:48] [INFO ] Flatten gal took : 45 ms
FORMULA RefineWMG-PT-010011-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:29:48] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:29:48] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 100006 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=446 ) properties (out of 24) seen :19
Running SMT prover for 5 properties.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:49] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-17 14:29:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:29:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 14:29:49] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 14:29:49] [INFO ] Added : 22 causal constraints over 5 iterations in 61 ms. Result :sat
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 14:29:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:29:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-17 14:29:49] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 56 ms.
[2021-05-17 14:29:49] [INFO ] Added : 19 causal constraints over 4 iterations in 96 ms. Result :sat
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 14:29:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:29:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-17 14:29:49] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 14:29:49] [INFO ] Added : 22 causal constraints over 5 iterations in 39 ms. Result :sat
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2021-05-17 14:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 14:29:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:29:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2021-05-17 14:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:50] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-17 14:29:50] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 14:29:50] [INFO ] Added : 21 causal constraints over 5 iterations in 29 ms. Result :sat
[2021-05-17 14:29:50] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2021-05-17 14:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:50] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-17 14:29:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:29:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2021-05-17 14:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:29:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 14:29:50] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 14:29:50] [INFO ] Added : 14 causal constraints over 3 iterations in 28 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(F((p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 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:50] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 14:29:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:50] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:50] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:50] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 14:29:50] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:50] [INFO ] Computed 22 place invariants in 11 ms
[2021-05-17 14:29:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-010011-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s0 s10), p1:(GT s38 s47), p2:(GT s16 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9053 reset in 362 ms.
Stack based approach found an accepted trace after 97 steps with 21 reset with depth 56 and stack size 56 in 1 ms.
FORMULA RefineWMG-PT-010011-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-00 finished in 1090 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(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 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:51] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:51] [INFO ] Computed 22 place invariants in 35 ms
[2021-05-17 14:29:51] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:51] [INFO ] Computed 22 place invariants in 8 ms
[2021-05-17 14:29:51] [INFO ] Implicit Places using invariants and state equation in 43 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:29:51] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LEQ 1 s5) (LEQ 2 s22)), p1:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 172 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 522 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:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-02 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:(LEQ 2 s42)], 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 190 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-02 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 0 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.
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:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 10 ms :[true]
Running random walk in product with property : RefineWMG-PT-010011-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-03 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(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:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s41), p1:(GT s15 s21)], 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 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-04 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p1)&&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.
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:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 7 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:52] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:52] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 2 s35) (GT s29 s22)), p1:(GT s29 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-06 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||X((!p1&&X(G(p2)))))))], 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 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:29:53] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:53] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:29:53] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:53] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p2) p1), true, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-010011-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(OR (NOT p1) p2), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(GT 3 s46), p0:(LEQ 3 s44), p2:(GT s21 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 132 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-07 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], 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:29:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:29:53] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:53] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 14:29:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:53] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s15 s8)], 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 142 ms.
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 2 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 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 4 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: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 36 transition count 26
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 18 rules in 13 ms. Remains 36 /54 variables (removed 18) and now considering 26/43 (removed 17) transitions.
// Phase 1: matrix 26 rows 36 cols
[2021-05-17 14:29:54] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 14:29:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
[2021-05-17 14:29:54] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 26 rows 36 cols
[2021-05-17 14:29:54] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 14:29:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 36/54 places, 26/43 transitions.
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 352 ms.
[2021-05-17 14:29:55] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:29:55] [INFO ] Flatten gal took : 5 ms
[2021-05-17 14:29:55] [INFO ] Time to serialize gal into /tmp/LTL9229005736658280427.gal : 2 ms
[2021-05-17 14:29:55] [INFO ] Time to serialize properties into /tmp/LTL5534112741338336885.ltl : 9 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/LTL9229005736658280427.gal, -t, CGAL, -LTL, /tmp/LTL5534112741338336885.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/LTL9229005736658280427.gal -t CGAL -LTL /tmp/LTL5534112741338336885.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p12<=p5)"))))
Formula 0 simplified : !XF"(p12<=p5)"
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
58 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.609946,30876,1,0,6,80417,20,0,1651,99438,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-010011-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-010011-09 finished in 2945 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||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 24 edges and 54 vertex of which 14 / 54 are part of one of the 7 SCC in 1 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 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 37 place count 20 transition count 20
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 20 transition count 15
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 15 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 47 place count 15 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 13 transition count 13
Applied a total of 51 rules in 8 ms. Remains 13 /54 variables (removed 41) and now considering 13/43 (removed 30) transitions.
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:29:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:29:56] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:29:56] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:29:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-17 14:29:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:29:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/54 places, 13/43 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s5), p0:(LEQ s12 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 248 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-010011-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-10 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p0 U p1)))&&X(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 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: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 48 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:29:56] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:29:56] [INFO ] Implicit Places using invariants in 26 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 39 ms returned []
Implicit Place search using SMT with State Equation took 68 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 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : RefineWMG-PT-010011-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s51), p1:(LEQ s40 s16), p2:(LEQ s50 s2)], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1170 steps with 0 reset in 6 ms.
FORMULA RefineWMG-PT-010011-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-11 finished in 375 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 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 8 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:29:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:29:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:29:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 14:29:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:29:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:29:56] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 7/43 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s6)], 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 15 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-13 finished in 108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||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 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 16 transition count 12
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 49 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 9 transition count 9
Applied a total of 53 rules in 4 ms. Remains 9 /54 variables (removed 45) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 9 cols
[2021-05-17 14:29:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-17 14:29:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:29:57] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-17 14:29:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:29:57] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:29:57] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-17 14:29:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 2 s8) (GT s5 s1)), p0:(GT s5 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-14 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(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 1 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 1 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 18 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 13 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 46 place count 13 transition count 11
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 48 place count 12 transition count 11
Applied a total of 48 rules in 3 ms. Remains 12 /54 variables (removed 42) and now considering 11/43 (removed 32) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:29:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:29:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:29:57] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:29:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:29:57] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:29:57] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:29:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/54 places, 11/43 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-15 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:(OR (GT s11 s7) (GT 1 s5))], 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 1347 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 165 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621261797624
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-010011, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416100636"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;