Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 5.5K Apr 30 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 56K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653085738157

Running Version 202205111006
[2022-05-20 22:28:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:28:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:28:59] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-20 22:28:59] [INFO ] Transformed 129 places.
[2022-05-20 22:28:59] [INFO ] Transformed 103 transitions.
[2022-05-20 22:28:59] [INFO ] Parsed PT model containing 129 places and 103 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RefineWMG-PT-025026-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:28:59] [INFO ] Computed 52 place invariants in 9 ms
[2022-05-20 22:29:00] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:00] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:29:00] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:00] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:29:00] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:00] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:29:00] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Support contains 52 out of 129 places after structural reductions.
[2022-05-20 22:29:00] [INFO ] Flatten gal took : 30 ms
[2022-05-20 22:29:00] [INFO ] Flatten gal took : 16 ms
[2022-05-20 22:29:00] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 51 out of 129 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10020 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=91 ) properties (out of 28) seen :13
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:00] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:29:01] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-20 22:29:01] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2022-05-20 22:29:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 26 ms returned sat
[2022-05-20 22:29:01] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2022-05-20 22:29:01] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-05-20 22:29:01] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 1434 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=36 )
Parikh walk visited 14 properties in 159 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((X(p1) U p2))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 68 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 4 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 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 94 place count 37 transition count 36
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 111 place count 37 transition count 19
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 128 place count 20 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 128 place count 20 transition count 16
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 134 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 16 transition count 15
Applied a total of 136 rules in 25 ms. Remains 16 /129 variables (removed 113) and now considering 15/103 (removed 88) transitions.
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:29:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:29:02] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:29:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-20 22:29:02] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:29:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/129 places, 15/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/129 places, 15/103 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(GEQ s9 1), p0:(OR (LT s12 1) (LT s13 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-00 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:29:02] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:02] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:02] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:03] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:03] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:03] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:03] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:03] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s53 1), p0:(LT s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2612 reset in 454 ms.
Product exploration explored 100000 steps with 2711 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:04] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:04] [INFO ] [Real]Absence check using 52 positive place invariants in 9 ms returned sat
[2022-05-20 22:29:04] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:29:04] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-20 22:29:04] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:29:04] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-20 22:29:04] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 9 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:05] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:05] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:05] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:05] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:05] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:05] [INFO ] Implicit Places using invariants and state equation in 97 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
[2022-05-20 22:29:05] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:05] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:06] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:06] [INFO ] [Real]Absence check using 52 positive place invariants in 8 ms returned sat
[2022-05-20 22:29:06] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:29:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-20 22:29:06] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:29:06] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-20 22:29:06] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 131 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 335 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2734 reset in 434 ms.
Product exploration explored 100000 steps with 2677 reset in 488 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 56
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 48 rules in 29 ms. Remains 81 /129 variables (removed 48) and now considering 56/103 (removed 47) transitions.
// Phase 1: matrix 56 rows 81 cols
[2022-05-20 22:29:08] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-20 22:29:08] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2022-05-20 22:29:08] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 56 rows 81 cols
[2022-05-20 22:29:08] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-20 22:29:08] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/129 places, 56/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/129 places, 56/103 transitions.
Stuttering criterion allowed to conclude after 5156 steps with 922 reset in 40 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-01 finished in 5755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U !F(p0))) U p1))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 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 8 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:29:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:29:08] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:29:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 22:29:08] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:29:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 132 ms :[p0, (NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s9 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-03 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:29:08] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:08] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:08] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:08] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:08] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:09] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:09] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:09] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s126 1) (GEQ s127 1)), p1:(AND (GEQ s51 1) (GEQ s52 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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-025026-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-04 finished in 520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(!(p0 U p1)))&&!p1)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:29:09] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:09] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:09] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:09] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:29:09] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:09] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:29:09] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s58 1), p0:(OR (GEQ s47 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 496 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-05 finished in 869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||G(G(p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:29:10] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:10] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:10] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:10] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:10] [INFO ] Computed 52 place invariants in 4 ms
[2022-05-20 22:29:10] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:10] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:10] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s52 1), p0:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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-025026-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-06 finished in 523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p0))&&G(p1)))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 68 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 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 94 place count 37 transition count 36
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 111 place count 37 transition count 19
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 128 place count 20 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 128 place count 20 transition count 16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 16 transition count 15
Applied a total of 136 rules in 6 ms. Remains 16 /129 variables (removed 113) and now considering 15/103 (removed 88) transitions.
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:29:10] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:29:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:29:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 22:29:10] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:29:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:29:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/129 places, 15/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/129 places, 15/103 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(OR (GEQ s11 1) (GEQ s15 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-08 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((F(p0)&&p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:11] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:11] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:11] [INFO ] Implicit Places using invariants and state equation in 92 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
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:11] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s16 1) (LT s17 1) (LT s19 1)), p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 331 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-09 finished in 785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1))&&(X(F(p2)) U !p0)))'
Support contains 9 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:11] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:11] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:12] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:29:12] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), true, (NOT p0), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s76 1) (LT s77 1) (LT s79 1)), p1:(AND (GEQ s71 1) (GEQ s72 1) (GEQ s74 1) (GEQ s66 1) (GEQ s67 1) (GEQ s69 1)), p2:(AND (GEQ s71 1) (GEQ s72 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 701 steps with 0 reset in 7 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-11 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1) U G((X(p2)||F(p3)||p4)))))'
Support contains 9 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 16 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:12] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:29:12] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:12] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:12] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:12] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:12] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:29:12] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:29:12] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p4))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p4) (NOT p3) p1) (AND (NOT p4) (NOT p3) p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p4) (NOT p3) p1 (NOT p2)) (AND (NOT p4) (NOT p3) p0 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={} source=4 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(NOT p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0), acceptance={} source=8 dest: 3}, { cond=(OR (AND (NOT p4) (NOT p3) p1) (AND (NOT p4) (NOT p3) p0)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s43 1), p0:(AND (GEQ s91 1) (GEQ s92 1) (GEQ s94 1)), p4:(AND (GEQ s51 1) (GEQ s52 1) (GEQ s54 1)), p3:(GEQ s112 1), p2:(GEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 512 ms.
Stack based approach found an accepted trace after 15339 steps with 1 reset with depth 4946 and stack size 4853 in 78 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-12 finished in 1625 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 117 place count 33 transition count 11
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 138 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 8 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:13] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:29:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:29:14] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:29:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 22:29:14] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:29:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-13 automaton TGBA Formula[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:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-13 finished in 236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X(G(p0)))&&(G(p1)||G(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 in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 93 place count 35 transition count 33
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 112 place count 35 transition count 14
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 131 place count 16 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 16 transition count 12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 14 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 13 transition count 11
Applied a total of 137 rules in 12 ms. Remains 13 /129 variables (removed 116) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:29:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:29:14] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:29:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:29:14] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:29:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:29:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-20 22:29:14] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:29:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:29:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 11/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-14 finished in 188 ms.
All properties solved by simple procedures.
Total runtime 14869 ms.

BK_STOP 1653085754455

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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