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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 218K 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-100100-00
FORMULA_NAME RefineWMG-PT-100100-01
FORMULA_NAME RefineWMG-PT-100100-02
FORMULA_NAME RefineWMG-PT-100100-03
FORMULA_NAME RefineWMG-PT-100100-04
FORMULA_NAME RefineWMG-PT-100100-05
FORMULA_NAME RefineWMG-PT-100100-06
FORMULA_NAME RefineWMG-PT-100100-07
FORMULA_NAME RefineWMG-PT-100100-08
FORMULA_NAME RefineWMG-PT-100100-09
FORMULA_NAME RefineWMG-PT-100100-10
FORMULA_NAME RefineWMG-PT-100100-11
FORMULA_NAME RefineWMG-PT-100100-12
FORMULA_NAME RefineWMG-PT-100100-13
FORMULA_NAME RefineWMG-PT-100100-14
FORMULA_NAME RefineWMG-PT-100100-15

=== Now, execution of the tool begins

BK_START 1621265188321

Running Version 0
[2021-05-17 15:26:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 15:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:26:30] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-17 15:26:30] [INFO ] Transformed 504 places.
[2021-05-17 15:26:30] [INFO ] Transformed 403 transitions.
[2021-05-17 15:26:30] [INFO ] Parsed PT model containing 504 places and 403 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:26:30] [INFO ] Initial state test concluded for 2 properties.
Support contains 52 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 46 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:30] [INFO ] Computed 202 place invariants in 21 ms
[2021-05-17 15:26:30] [INFO ] Dead Transitions using invariants and state equation in 385 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:30] [INFO ] Computed 202 place invariants in 6 ms
[2021-05-17 15:26:30] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:30] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:31] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:31] [INFO ] Computed 202 place invariants in 7 ms
[2021-05-17 15:26:31] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
[2021-05-17 15:26:31] [INFO ] Initial state reduction rules for LTL removed 7 formulas.
[2021-05-17 15:26:31] [INFO ] Flatten gal took : 61 ms
FORMULA RefineWMG-PT-100100-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:26:31] [INFO ] Flatten gal took : 28 ms
[2021-05-17 15:26:31] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 100044 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=304 ) properties (out of 16) seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:32] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:26:32] [INFO ] [Real]Absence check using 202 positive place invariants in 24 ms returned sat
[2021-05-17 15:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:32] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-17 15:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:32] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2021-05-17 15:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:32] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-17 15:26:32] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 15:26:33] [INFO ] Added : 63 causal constraints over 13 iterations in 367 ms. Result :sat
[2021-05-17 15:26:33] [INFO ] [Real]Absence check using 202 positive place invariants in 32 ms returned sat
[2021-05-17 15:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:33] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-17 15:26:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:33] [INFO ] [Nat]Absence check using 202 positive place invariants in 24 ms returned sat
[2021-05-17 15:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:33] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-17 15:26:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 15:26:33] [INFO ] Added : 86 causal constraints over 18 iterations in 335 ms. Result :sat
[2021-05-17 15:26:33] [INFO ] [Real]Absence check using 202 positive place invariants in 23 ms returned sat
[2021-05-17 15:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:34] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-17 15:26:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2021-05-17 15:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:34] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-17 15:26:34] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:26:34] [INFO ] Added : 73 causal constraints over 15 iterations in 374 ms. Result :sat
[2021-05-17 15:26:34] [INFO ] [Real]Absence check using 202 positive place invariants in 28 ms returned sat
[2021-05-17 15:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:34] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-17 15:26:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2021-05-17 15:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:34] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-17 15:26:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 15:26:35] [INFO ] Added : 151 causal constraints over 31 iterations in 756 ms. Result :sat
[2021-05-17 15:26:35] [INFO ] [Real]Absence check using 202 positive place invariants in 28 ms returned sat
[2021-05-17 15:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:35] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-17 15:26:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:36] [INFO ] [Nat]Absence check using 202 positive place invariants in 35 ms returned sat
[2021-05-17 15:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:36] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-17 15:26:36] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 15:26:36] [INFO ] Added : 158 causal constraints over 32 iterations in 684 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||(p1 U X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 16 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:37] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:26:37] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:37] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:26:37] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:37] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:26:37] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:37] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:26:37] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100100-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s177 1), p1:(AND (GEQ s346 1) (GEQ s347 1) (GEQ s349 1) (GEQ s177 1)), p2:(GEQ s350 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17 reset in 1983 ms.
Stack based approach found an accepted trace after 1684 steps with 0 reset with depth 1685 and stack size 1685 in 29 ms.
FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-01 finished in 3328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 17 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:40] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:26:40] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:40] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:40] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:40] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:41] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:41] [INFO ] Computed 202 place invariants in 7 ms
[2021-05-17 15:26:41] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-100100-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s337 1), p0:(LT s288 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1335 ms.
Product exploration explored 100000 steps with 0 reset in 1531 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 0 reset in 1573 ms.
Product exploration explored 100000 steps with 0 reset in 1582 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 2 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 6 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 198 place count 308 transition count 208
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 198 rules in 71 ms. Remains 308 /504 variables (removed 196) and now considering 208/403 (removed 195) transitions.
// Phase 1: matrix 208 rows 308 cols
[2021-05-17 15:26:48] [INFO ] Computed 104 place invariants in 1 ms
[2021-05-17 15:26:48] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
[2021-05-17 15:26:48] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 208 rows 308 cols
[2021-05-17 15:26:48] [INFO ] Computed 104 place invariants in 1 ms
[2021-05-17 15:26:48] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 1 iterations. Remains : 308/504 places, 208/403 transitions.
Entered a terminal (fully accepting) state of product in 15175 steps with 0 reset in 84 ms.
FORMULA RefineWMG-PT-100100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-02 finished in 8198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 588 place count 13 transition count 11
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 592 place count 11 transition count 11
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 594 place count 10 transition count 10
Applied a total of 594 rules in 20 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:48] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:48] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:26:48] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 15:26:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:48] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-05 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:48] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:48] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:48] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:49] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:49] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:49] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:49] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:49] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s478 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-06 finished in 1020 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 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 588 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 590 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 592 place count 10 transition count 9
Applied a total of 592 rules in 17 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:26:49] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:26:49] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:26:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:49] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:26:49] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 15:26:49] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 15:26:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:26:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:49] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-09 finished in 117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((p0 U (p1||G(p0))))||((p2 U (p1||G(p2))) U ((p3&&(p2 U (p1||G(p2))))||G(p4))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:49] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:50] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:50] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:26:50] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:50] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:50] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:50] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:50] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p4) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p4))]
Running random walk in product with property : RefineWMG-PT-100100-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p4 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p4 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p4 p3 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p4 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p4 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p4 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p4), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s268 1) (OR (LT s131 1) (LT s132 1) (LT s134 1))), p0:(LT s268 1), p4:(OR (LT s131 1) (LT s132 1) (LT s134 1) (AND (LT s268 1) (OR (LT s131 1) (LT s132 1) (LT s134 1)))), p3:(LT s358 1), p2:(OR (LT s131 1) (LT s132 1) (LT s134 1))], nbAcceptance=2, 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 1297 reset in 1568 ms.
Stack based approach found an accepted trace after 30672 steps with 543 reset with depth 13092 and stack size 4452 in 600 ms.
FORMULA RefineWMG-PT-100100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-10 finished in 3344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:53] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:53] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:53] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:53] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:53] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:53] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:53] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:26:54] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-13 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14833 steps with 0 reset in 203 ms.
FORMULA RefineWMG-PT-100100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-13 finished in 1241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 588 place count 13 transition count 11
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 592 place count 11 transition count 11
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 594 place count 10 transition count 10
Applied a total of 594 rules in 13 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:54] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:54] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:54] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 15:26:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:26:54] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s5 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-14 finished in 161 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621265214806

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-100100"
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-100100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416200693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 ;