Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875500557.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 ERK-PT-000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875500557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 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 7.4K 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 ERK-PT-000001-00
FORMULA_NAME ERK-PT-000001-01
FORMULA_NAME ERK-PT-000001-02
FORMULA_NAME ERK-PT-000001-03
FORMULA_NAME ERK-PT-000001-04
FORMULA_NAME ERK-PT-000001-05
FORMULA_NAME ERK-PT-000001-06
FORMULA_NAME ERK-PT-000001-07
FORMULA_NAME ERK-PT-000001-08
FORMULA_NAME ERK-PT-000001-09
FORMULA_NAME ERK-PT-000001-10
FORMULA_NAME ERK-PT-000001-11
FORMULA_NAME ERK-PT-000001-12
FORMULA_NAME ERK-PT-000001-13
FORMULA_NAME ERK-PT-000001-14
FORMULA_NAME ERK-PT-000001-15

=== Now, execution of the tool begins

BK_START 1620627183164

Running Version 0
[2021-05-10 06:13:04] [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-10 06:13:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 06:13:05] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 06:13:05] [INFO ] Transformed 11 places.
[2021-05-10 06:13:05] [INFO ] Transformed 11 transitions.
[2021-05-10 06:13:05] [INFO ] Found NUPN structural information;
[2021-05-10 06:13:05] [INFO ] Parsed PT model containing 11 places and 11 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 7 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:05] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-10 06:13:05] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:05] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
[2021-05-10 06:13:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 06:13:05] [INFO ] Flatten gal took : 16 ms
FORMULA ERK-PT-000001-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 06:13:05] [INFO ] Flatten gal took : 3 ms
[2021-05-10 06:13:05] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:05] [INFO ] Computed 5 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:05] [INFO ] Implicit Places using invariants in 19 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:05] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:13:05] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-000001-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s3 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ERK-PT-000001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-01 finished in 321 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 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:06] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:06] [INFO ] Implicit Places using invariants in 15 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:06] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-10 06:13:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-000001-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s3 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 2 steps with 0 reset in 0 ms.
FORMULA ERK-PT-000001-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-02 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(X(X((p1||F(G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:06] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:06] [INFO ] Implicit Places using invariants in 32 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:13:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:13:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-000001-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s5 1), p1:(AND (EQ s5 1) (EQ s3 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5374 reset in 271 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ERK-PT-000001-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-03 finished in 425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((F(p1)||(F(p2) U (p0 U X(p3))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 7 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:06] [INFO ] Implicit Places using invariants in 13 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 13 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:13:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), false]
Running random walk in product with property : ERK-PT-000001-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s3 1), p2:(EQ s1 1), p3:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28737 reset in 161 ms.
Stack based approach found an accepted trace after 11 steps with 4 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ERK-PT-000001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-04 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:07] [INFO ] Implicit Places using invariants in 18 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 18 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:07] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ERK-PT-000001-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s4 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17283 reset in 135 ms.
Stack based approach found an accepted trace after 13 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ERK-PT-000001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-05 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 13 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 06:13:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:07] [INFO ] Implicit Places using invariants in 11 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-10 06:13:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 06:13:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-10 06:13:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 06:13:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-000001-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s1 1), p1:(AND (EQ s5 1) (EQ s6 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][true, true]]
Product exploration explored 100000 steps with 33487 reset in 95 ms.
Stack based approach found an accepted trace after 78 steps with 30 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ERK-PT-000001-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-06 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:07] [INFO ] Implicit Places using invariants in 13 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ERK-PT-000001-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s3 0) (EQ s7 1) (EQ s8 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9923 reset in 75 ms.
Stack based approach found an accepted trace after 32 steps with 4 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ERK-PT-000001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-07 finished in 284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:07] [INFO ] Implicit Places using invariants in 15 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, p0, p0]
Running random walk in product with property : ERK-PT-000001-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s7 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 ERK-PT-000001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-08 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)&&X((p2||X((p3 U p4)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:08] [INFO ] Implicit Places using invariants in 19 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 19 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p4)), (NOT p1), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4)))]
Running random walk in product with property : ERK-PT-000001-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p1 (NOT p2) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p4) (NOT p3)) (AND p0 (NOT p4) (NOT p3))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p4) p3) (AND p0 (NOT p4) p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s4 1), p0:(AND (EQ s1 1) (EQ s2 1)), p2:(EQ s1 0), p4:(AND (EQ s3 0) (EQ s1 0)), p3:(EQ s3 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9873 reset in 137 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ERK-PT-000001-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-09 finished in 445 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Implicit Places using invariants in 12 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 06:13:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 06:13:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ERK-PT-000001-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (EQ s0 1) (EQ s1 1)), p1:(AND (EQ s8 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 5 steps with 1 reset in 0 ms.
FORMULA ERK-PT-000001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-10 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((p0 U X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Implicit Places using invariants in 25 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:13:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:13:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 576 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ERK-PT-000001-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s8 1)), p1:(AND (EQ s1 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ERK-PT-000001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-11 finished in 650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0)||X(X(G(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:09] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Implicit Places using invariants in 10 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:13:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ERK-PT-000001-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s7 1)), p0:(AND (NEQ s1 0) (NEQ s2 0)), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13929 reset in 172 ms.
Stack based approach found an accepted trace after 12 steps with 1 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ERK-PT-000001-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-12 finished in 395 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
[2021-05-10 06:13:09] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 06:13:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-10 06:13:09] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 06:13:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-10 06:13:09] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-10 06:13:09] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 06:13:09] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 06:13:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ERK-PT-000001-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s1 1) (EQ s6 1) (EQ s7 1)), p0:(AND (EQ s0 1) (EQ s1 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 18 steps with 1 reset in 0 ms.
FORMULA ERK-PT-000001-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-13 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:13:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:13:09] [INFO ] Implicit Places using invariants in 14 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:13:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:13:09] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-000001-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), 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: 3}]], initial=1, aps=[p0:(EQ s3 1), p1:(AND (NEQ s1 0) (OR (EQ s1 0) (EQ s2 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33318 reset in 50 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ERK-PT-000001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-14 finished in 180 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 10 transition count 9
Applied a total of 4 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-10 06:13:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:13:10] [INFO ] Implicit Places using invariants in 15 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-10 06:13:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 06:13:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:13:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 9/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-10 06:13:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 06:13:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 06:13:10] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 9/11 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ERK-PT-000001-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s6 1)), p0:(OR (EQ s2 1) (AND (EQ s7 1) (EQ s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA ERK-PT-000001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000001-15 finished in 122 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620627191037

--------------------
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="ERK-PT-000001"
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 ERK-PT-000001, 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 r083-tall-162048875500557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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