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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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 2.9K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621262713614

Running Version 0
[2021-05-17 14:45:15] [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:45:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:45:15] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-17 14:45:15] [INFO ] Transformed 129 places.
[2021-05-17 14:45:15] [INFO ] Transformed 103 transitions.
[2021-05-17 14:45:15] [INFO ] Parsed PT model containing 129 places and 103 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:45:15] [INFO ] Initial state test concluded for 5 properties.
FORMULA RefineWMG-PT-025025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 17 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:15] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-17 14:45:15] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:15] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-17 14:45:15] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:15] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-17 14:45:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:15] [INFO ] Computed 52 place invariants in 4 ms
[2021-05-17 14:45:15] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
[2021-05-17 14:45:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:45:16] [INFO ] Flatten gal took : 29 ms
FORMULA RefineWMG-PT-025025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:45:16] [INFO ] Flatten gal took : 13 ms
[2021-05-17 14:45:16] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 100004 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=793 ) properties (out of 16) seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:16] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:45:16] [INFO ] [Real]Absence check using 52 positive place invariants in 9 ms returned sat
[2021-05-17 14:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:16] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 14:45:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:45:16] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:16] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 14:45:16] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 14:45:16] [INFO ] Added : 45 causal constraints over 9 iterations in 87 ms. Result :sat
[2021-05-17 14:45:16] [INFO ] [Real]Absence check using 52 positive place invariants in 7 ms returned sat
[2021-05-17 14:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-17 14:45:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:45:16] [INFO ] [Nat]Absence check using 52 positive place invariants in 12 ms returned sat
[2021-05-17 14:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-17 14:45:16] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 14:45:16] [INFO ] Added : 51 causal constraints over 11 iterations in 90 ms. Result :sat
[2021-05-17 14:45:16] [INFO ] [Real]Absence check using 52 positive place invariants in 7 ms returned sat
[2021-05-17 14:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-17 14:45:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:45:16] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2021-05-17 14:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-17 14:45:16] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 14:45:16] [INFO ] Added : 52 causal constraints over 11 iterations in 76 ms. Result :sat
[2021-05-17 14:45:17] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 14:45:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:45:17] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:17] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 14:45:17] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 14:45:17] [INFO ] Added : 46 causal constraints over 10 iterations in 69 ms. Result :sat
[2021-05-17 14:45:17] [INFO ] [Real]Absence check using 52 positive place invariants in 5 ms returned sat
[2021-05-17 14:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 14:45:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:45:17] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-17 14:45:17] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 14:45:17] [INFO ] Added : 55 causal constraints over 11 iterations in 80 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 8 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 116 place count 33 transition count 12
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 136 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 37 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:45:17] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:45:17] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:45:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-17 14:45:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:45:17] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s9 s6) (GT 3 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025025-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-00 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 112 place count 33 transition count 16
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 130 place count 17 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 132 place count 15 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 13 transition count 12
Applied a total of 136 rules in 8 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:45:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:45:17] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 9 ms
[2021-05-17 14:45:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 14:45:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:17] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:45:17] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(LEQ s11 s0), p2:(GT 1 s8), p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-01 finished in 272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((F(p0) U G(p1)) U (!p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:18] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:18] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:18] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-17 14:45:18] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:18] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:18] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:18] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:45:18] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2) p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s28 s121), p1:(GT s128 s31), p0:(LEQ 3 s59)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 486 ms.
Product exploration explored 100000 steps with 7 reset in 942 ms.
Knowledge obtained : [p2, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2) p1), (NOT p0)]
Product exploration explored 100000 steps with 12 reset in 465 ms.
Product exploration explored 100000 steps with 8 reset in 493 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2) p1), (NOT p0)]
Support contains 5 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 58
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 46 rules in 22 ms. Remains 83 /129 variables (removed 46) and now considering 58/103 (removed 45) transitions.
// Phase 1: matrix 58 rows 83 cols
[2021-05-17 14:45:21] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 14:45:21] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
[2021-05-17 14:45:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 58 rows 83 cols
[2021-05-17 14:45:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/129 places, 58/103 transitions.
Stuttering criterion allowed to conclude after 1080 steps with 0 reset in 17 ms.
FORMULA RefineWMG-PT-025025-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-03 finished in 4105 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 18 rules applied. Total rules applied 113 place count 35 transition count 16
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 131 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 131 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 13 transition count 12
Applied a total of 139 rules in 23 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-17 14:45:22] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s12 s5) (GT 1 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-04 finished in 169 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:22] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:22] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:22] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:22] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s80)], 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 187 reset in 496 ms.
Stack based approach found an accepted trace after 208 steps with 0 reset with depth 209 and stack size 209 in 2 ms.
FORMULA RefineWMG-PT-025025-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-05 finished in 919 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:23] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:23] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:23] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:23] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:23] [INFO ] Computed 52 place invariants in 5 ms
[2021-05-17 14:45:23] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:23] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s5 s63)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 512 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA RefineWMG-PT-025025-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-06 finished in 942 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:24] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:24] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:24] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:24] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:24] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:24] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:24] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 2 s31)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 394 ms.
Product exploration explored 100000 steps with 20000 reset in 479 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 357 ms.
Product exploration explored 100000 steps with 20000 reset in 291 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 74 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 79 transition count 54
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 49 rules in 9 ms. Remains 79 /129 variables (removed 50) and now considering 54/103 (removed 49) transitions.
// Phase 1: matrix 54 rows 79 cols
[2021-05-17 14:45:26] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 14:45:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
[2021-05-17 14:45:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 79 cols
[2021-05-17 14:45:26] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 14:45:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/129 places, 54/103 transitions.
Product exploration explored 100000 steps with 20000 reset in 477 ms.
Product exploration explored 100000 steps with 20000 reset in 463 ms.
[2021-05-17 14:45:27] [INFO ] Flatten gal took : 58 ms
[2021-05-17 14:45:27] [INFO ] Flatten gal took : 14 ms
[2021-05-17 14:45:27] [INFO ] Time to serialize gal into /tmp/LTL2291543223198944452.gal : 6 ms
[2021-05-17 14:45:27] [INFO ] Time to serialize properties into /tmp/LTL10032152232641357564.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/LTL2291543223198944452.gal, -t, CGAL, -LTL, /tmp/LTL10032152232641357564.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/LTL2291543223198944452.gal -t CGAL -LTL /tmp/LTL10032152232641357564.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(p28>=2)")))))))
Formula 0 simplified : !XXXXF"(p28>=2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
739 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,7.41861,165048,1,0,9,763099,20,0,5309,1.02146e+06,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-025025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-025025-09 finished in 11573 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 75 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 100 place count 29 transition count 29
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 121 place count 29 transition count 8
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 6 transition count 6
Applied a total of 146 rules in 19 ms. Remains 6 /129 variables (removed 123) and now considering 6/103 (removed 97) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:45:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:45:35] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:45:35] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:45:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:45:35] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 14:45:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:45:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/129 places, 6/103 transitions.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-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:(GT 1 s5)], 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 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-12 finished in 168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 17 rules applied. Total rules applied 113 place count 33 transition count 15
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 131 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 132 place count 15 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 12 transition count 11
Applied a total of 138 rules in 6 ms. Remains 12 /129 variables (removed 117) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:45:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:45:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:45:35] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:45:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:45:35] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-17 14:45:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:45:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:45:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(LEQ s10 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 422 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-025025-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-14 finished in 187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G((!p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:36] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:36] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:36] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:36] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:36] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:36] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:36] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:36] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 6}]], initial=0, aps=[p0:(GT s128 s46), p1:(LEQ 1 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 168 reset in 514 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RefineWMG-PT-025025-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-15 finished in 1206 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621262737567

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

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

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