Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918800636.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 20K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 30 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K Apr 30 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 87K May 10 09:33 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 CSRepetitions-PT-04-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652670343543

Running Version 202205111006
[2022-05-16 03:05:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 03:05:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:05:44] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-16 03:05:44] [INFO ] Transformed 117 places.
[2022-05-16 03:05:44] [INFO ] Transformed 176 transitions.
[2022-05-16 03:05:44] [INFO ] Parsed PT model containing 117 places and 176 transitions in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:45] [INFO ] Computed 20 place invariants in 15 ms
[2022-05-16 03:05:45] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:45] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 03:05:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:45] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:45] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-16 03:05:45] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Support contains 117 out of 117 places after structural reductions.
[2022-05-16 03:05:45] [INFO ] Flatten gal took : 38 ms
[2022-05-16 03:05:45] [INFO ] Flatten gal took : 22 ms
[2022-05-16 03:05:45] [INFO ] Input system was already deterministic with 176 transitions.
Finished random walk after 3065 steps, including 69 resets, run visited all 18 properties in 62 ms. (steps per millisecond=49 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G(!p2)))'
Support contains 97 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:46] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:46] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:46] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-16 03:05:46] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:46] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 297 ms :[p2, (NOT p0), (NOT p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s95 1) (GEQ s115 1)) (AND (GEQ s34 1) (GEQ s115 1)) (AND (GEQ s5 1) (GEQ s115 1)) (AND (GEQ s54 1) (GEQ s115 1)) (AND (GEQ s11 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1880 reset in 731 ms.
Stack based approach found an accepted trace after 3344 steps with 61 reset with depth 47 and stack size 47 in 22 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-00 finished in 1346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(G(p1)&&p0)))))'
Support contains 100 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:47] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:47] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:47] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:47] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-02 automaton TGBA Formula[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=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (AND (GEQ s74 1) (GEQ s97 1)) (AND (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s80 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-02 finished in 568 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(X(G(X(p1))))))'
Support contains 96 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:48] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:48] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:48] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 03:05:48] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 133 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 : CSRepetitions-PT-04-LTLFireability-03 automaton TGBA Formula[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:(OR (GEQ s64 1) (GEQ s99 1) (GEQ s98 1) (GEQ s3 1) (GEQ s39 1) (GEQ s8 1) (GEQ s15 1) (GEQ s114 1) (GEQ s113 1) (GEQ s53 1) (GEQ s52 1) (GEQ s116 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLFireability-03 finished in 922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(p0)||G(F(p1)))))))'
Support contains 96 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:48] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:48] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-16 03:05:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:49] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:49] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s32 1) (GEQ s100 1) (GEQ s68 1) (GEQ s106 1) (GEQ s107 1) (GEQ s75 1) (GEQ s74 1) (GEQ s14 1) (GEQ s46 1) (GEQ s109 1) (GEQ s80 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2095 steps with 188 reset in 18 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-04 finished in 410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 20 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:49] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:49] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-16 03:05:49] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (AND (GEQ s74 1) (GEQ s97 1)) (AND (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s80 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-05 finished in 385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0)) U X(p0))))'
Support contains 16 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:49] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-06 automaton TGBA Formula[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:(OR (GEQ s0 1) (GEQ s32 1) (GEQ s100 1) (GEQ s68 1) (GEQ s106 1) (GEQ s107 1) (GEQ s75 1) (GEQ s74 1) (GEQ s14 1) (GEQ s46 1) (GEQ s109 1) (GEQ s80 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-06 finished in 352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 17 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:50] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:50] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-16 03:05:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-16 03:05:50] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s95 1) (GEQ s115 1)) (AND (GEQ s34 1) (GEQ s115 1)) (AND (GEQ s5 1) (GEQ s115 1)) (AND (GEQ s54 1) (GEQ s115 1)) (AND (GEQ s11 1) (GEQ s1...], 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 1279 steps with 102 reset in 4 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-07 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:50] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:50] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-08 automaton TGBA Formula[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:(OR (LT s82 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 749 steps with 14 reset in 8 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-08 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U F(p1))&&X(F(X(p0))))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:50] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:50] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s58 1), p0:(AND (GEQ s34 1) (GEQ s115 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 168 steps with 3 reset in 2 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-09 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&((F(!p0) U F(X(X(p0))))||G(p2))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:51] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:51] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:51] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT 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=0 dest: 3}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s31 1), p0:(GEQ s32 1), p2:(AND (GEQ s5 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-10 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:51] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:51] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:51] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 03:05:51] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 72 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-11 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 89 transition count 162
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 94 place count 37 transition count 110
Iterating global reduction 0 with 52 rules applied. Total rules applied 146 place count 37 transition count 110
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 157 place count 26 transition count 55
Iterating global reduction 0 with 11 rules applied. Total rules applied 168 place count 26 transition count 55
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 179 place count 26 transition count 44
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 187 place count 22 transition count 40
Applied a total of 187 rules in 20 ms. Remains 22 /117 variables (removed 95) and now considering 40/176 (removed 136) transitions.
[2022-05-16 03:05:51] [INFO ] Flow matrix only has 31 transitions (discarded 9 similar events)
// Phase 1: matrix 31 rows 22 cols
[2022-05-16 03:05:51] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 03:05:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-16 03:05:51] [INFO ] Flow matrix only has 31 transitions (discarded 9 similar events)
// Phase 1: matrix 31 rows 22 cols
[2022-05-16 03:05:51] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 03:05:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 03:05:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-16 03:05:52] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-16 03:05:52] [INFO ] Flow matrix only has 31 transitions (discarded 9 similar events)
// Phase 1: matrix 31 rows 22 cols
[2022-05-16 03:05:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 03:05:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/117 places, 40/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/117 places, 40/176 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-12 automaton TGBA Formula[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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s21 1)), p1:(AND (GEQ s12 1) (GEQ s21 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 22 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-12 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(G((X(p0)||G(p1)))))))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 89 transition count 162
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 94 place count 37 transition count 110
Iterating global reduction 0 with 52 rules applied. Total rules applied 146 place count 37 transition count 110
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 156 place count 27 transition count 60
Iterating global reduction 0 with 10 rules applied. Total rules applied 166 place count 27 transition count 60
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 176 place count 27 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 23 transition count 46
Applied a total of 184 rules in 12 ms. Remains 23 /117 variables (removed 94) and now considering 46/176 (removed 130) transitions.
[2022-05-16 03:05:52] [INFO ] Flow matrix only has 34 transitions (discarded 12 similar events)
// Phase 1: matrix 34 rows 23 cols
[2022-05-16 03:05:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 03:05:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-16 03:05:52] [INFO ] Flow matrix only has 34 transitions (discarded 12 similar events)
// Phase 1: matrix 34 rows 23 cols
[2022-05-16 03:05:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 03:05:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 03:05:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-16 03:05:52] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 03:05:52] [INFO ] Flow matrix only has 34 transitions (discarded 12 similar events)
// Phase 1: matrix 34 rows 23 cols
[2022-05-16 03:05:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 03:05:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/117 places, 46/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/117 places, 46/176 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s22 1)), p0:(OR (LT s4 1) (LT s22 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4250 reset in 325 ms.
Stack based approach found an accepted trace after 34 steps with 1 reset with depth 16 and stack size 15 in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-13 finished in 531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(F(G((F(p1)||p0))))&&X(p2))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:52] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:52] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 03:05:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:52] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:52] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s12 1) (GEQ s82 1)), p0:(OR (LT s48 1) (LT s115 1)), p1:(OR (LT s50 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 150 steps with 2 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-15 finished in 440 ms.
All properties solved by simple procedures.
Total runtime 8449 ms.

BK_STOP 1652670353199

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-04"
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 CSRepetitions-PT-04, 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 r024-tall-165251918800636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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