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.r060-tall-165254772300620.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 Dekker-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Dekker-PT-050-LTLFireability-00
FORMULA_NAME Dekker-PT-050-LTLFireability-01
FORMULA_NAME Dekker-PT-050-LTLFireability-02
FORMULA_NAME Dekker-PT-050-LTLFireability-03
FORMULA_NAME Dekker-PT-050-LTLFireability-04
FORMULA_NAME Dekker-PT-050-LTLFireability-05
FORMULA_NAME Dekker-PT-050-LTLFireability-06
FORMULA_NAME Dekker-PT-050-LTLFireability-07
FORMULA_NAME Dekker-PT-050-LTLFireability-08
FORMULA_NAME Dekker-PT-050-LTLFireability-09
FORMULA_NAME Dekker-PT-050-LTLFireability-10
FORMULA_NAME Dekker-PT-050-LTLFireability-11
FORMULA_NAME Dekker-PT-050-LTLFireability-12
FORMULA_NAME Dekker-PT-050-LTLFireability-13
FORMULA_NAME Dekker-PT-050-LTLFireability-14
FORMULA_NAME Dekker-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652631760767

Running Version 202205111006
[2022-05-15 16:22:41] [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-15 16:22:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:22:42] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-05-15 16:22:42] [INFO ] Transformed 250 places.
[2022-05-15 16:22:42] [INFO ] Transformed 2600 transitions.
[2022-05-15 16:22:42] [INFO ] Found NUPN structural information;
[2022-05-15 16:22:42] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 334 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 122 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 45 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 16:22:42] [INFO ] Computed 150 place invariants in 20 ms
[2022-05-15 16:22:42] [INFO ] Implicit Places using invariants in 389 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 419 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/250 places, 2600/2600 transitions.
Support contains 122 out of 201 places after structural reductions.
[2022-05-15 16:22:43] [INFO ] Flatten gal took : 229 ms
[2022-05-15 16:22:43] [INFO ] Flatten gal took : 154 ms
[2022-05-15 16:22:43] [INFO ] Input system was already deterministic with 2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 42) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:22:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:44] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:22:44] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-05-15 16:22:44] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:22:44] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA Dekker-PT-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((!(!p0 U p1)||X(F(p2))))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 37 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:44] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:45] [INFO ] Implicit Places using invariants in 439 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 86 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (EQ s15 0) (EQ s39 0) (EQ s138 0)), p1:(AND (EQ s77 1) (EQ s95 1) (EQ s176 1)), p0:(AND (EQ s9 1) (EQ s71 1) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 888 ms.
Product exploration explored 100000 steps with 50000 reset in 801 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Dekker-PT-050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLFireability-01 finished in 2780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 178 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:47] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:48] [INFO ] Implicit Places using invariants in 1034 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s27 0) (EQ s127 0))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 962 ms.
Product exploration explored 100000 steps with 0 reset in 1148 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 : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p0)))
Knowledge based reduction with 1 factoid took 34 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Dekker-PT-050-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLFireability-02 finished in 3567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)&&p0))&&X((F(p2)||p3)))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:51] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:51] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-05-15 16:22:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:51] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:22:52] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2022-05-15 16:22:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:52] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:53] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s17 1) (EQ s116 1)), p3:(AND (EQ s17 1) (EQ s45 1) (EQ s116 1)), p2:(AND (EQ s7 1) (EQ s17 1) (EQ s116 1)), p1:(AND (EQ s48 1) (EQ s...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-03 finished in 2102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F((G(p1)&&F(X(p2))&&p0)))&&X(p3))))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:53] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:53] [INFO ] Implicit Places using invariants in 408 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s83 1) (EQ s93 1) (EQ s182 1)), p2:(AND (EQ s31 1) (EQ s57 1) (EQ s130 1)), p0:(AND (EQ s19 1) (EQ s81 1) (EQ s180 1)), p1:(AND (EQ s19 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-04 finished in 695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))&&p0))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:53] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:54] [INFO ] Implicit Places using invariants in 388 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s49 1) (EQ s120 1) (EQ s15 1) (EQ s39 1) (EQ s114 1)), p1:(AND (EQ s21 1) (EQ s49 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-06 finished in 567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((p1 U X(!p2)))))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:54] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:54] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:54] [INFO ] Implicit Places using invariants in 418 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 424 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 252 ms :[p2, p2, p2, true, p2, p2, p2]
Running random walk in product with property : Dekker-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(AND (EQ s31 1) (EQ s71 1) (EQ s130 1)), p0:(AND (EQ s21 1) (EQ s89 1) (EQ s188 1)), p1:(AND (EQ s13 1) (EQ s27 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39450 steps with 13111 reset in 312 ms.
FORMULA Dekker-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-07 finished in 1047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U !p1)||X(G(p2))) U X(X(p1))))'
Support contains 8 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:55] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:56] [INFO ] Implicit Places using invariants in 409 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 546 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=p2, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 p2), acceptance={} source=3 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 11}], [{ cond=(NOT p1), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 12}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=11 dest: 13}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=11 dest: 14}], [{ cond=(NOT p2), acceptance={} source=12 dest: 9}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(NOT p0), acceptance={} source=13 dest: 9}, { cond=p0, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=14 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p0 p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s41 1) (EQ s140 1)), p0:(AND (EQ s35 1) (EQ s37 1) (EQ s136 1) (EQ s53 1) (EQ s59 1) (EQ s152 1)), p2:(AND (EQ s35 1) (EQ s37 1) (E...], 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 946 reset in 992 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 4 ms.
FORMULA Dekker-PT-050-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-08 finished in 2025 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 188 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:57] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:58] [INFO ] Implicit Places using invariants in 388 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 83 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s55 1) (EQ s99 1) (EQ s198 1)), p0:(AND (EQ s33 1) (EQ s75 1) (EQ s132 1) (OR (EQ s87 0) (EQ s97 0) (EQ s196 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 545 reset in 997 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-09 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 105 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:59] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:22:59] [INFO ] Implicit Places using invariants in 422 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 427 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 77 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (OR (NEQ s73 1) (NEQ s81 1) (NEQ s172 1)) (OR (NEQ s57 1) (NEQ s71 1) (NEQ s170 1))) (AND (EQ s45 1) (EQ s57 1) (EQ s144 1)))], nbAcceptance=1, 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 0 reset in 1026 ms.
Stack based approach found an accepted trace after 133 steps with 0 reset with depth 134 and stack size 130 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-10 finished in 1698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(p0 U X(p1))&&X((G(X(p3))||p2))))))'
Support contains 12 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:23:01] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:23:01] [INFO ] Implicit Places using invariants in 402 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 369 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Running random walk in product with property : Dekker-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 5}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p3), acceptance={0} source=5 dest: 6}, { cond=(AND p0 p1 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=7 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s27 1) (EQ s120 1)), p1:(AND (EQ s23 1) (EQ s65 1) (EQ s164 1)), p2:(OR (EQ s43 0) (EQ s69 0) (EQ s168 0)), p3:(OR (EQ s47 0) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33317 reset in 794 ms.
Product exploration explored 100000 steps with 33320 reset in 875 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 727 ms. Reduced automaton from 8 states, 28 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 465 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Finished random walk after 152 steps, including 0 resets, run visited all 17 properties in 9 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND p3 p0 p1)), (F (AND p3 p1)), (F (AND (NOT p2) p3 (NOT p1))), (F (NOT (AND p3 (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) p0)), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (AND (NOT p2) (NOT p3) p0)), (F (AND (NOT p3) p1)), (F p1), (F (NOT p2)), (F (AND p3 p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p2) p3 p0 (NOT p1))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 1146 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 376 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Stuttering acceptance computed with spot in 391 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Support contains 12 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:23:06] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-15 16:23:07] [INFO ] Implicit Places using invariants in 395 ms returned []
[2022-05-15 16:23:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:23:07] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-15 16:23:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:23:07] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2022-05-15 16:23:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:23:07] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-15 16:23:08] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 322 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 346 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Finished random walk after 1528 steps, including 0 resets, run visited all 17 properties in 45 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (AND p1 p3 p0)), (F (AND p1 p3)), (F (AND (NOT p1) p3 (NOT p2))), (F (NOT (AND (NOT p1) p3))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p3) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3) p0)), (F (AND (NOT p3) p0 (NOT p2))), (F (AND p1 (NOT p3))), (F p1), (F (NOT p2)), (F (AND (NOT p1) p3 p0)), (F (AND p1 p0)), (F (AND (NOT p1) p3 p0 (NOT p2))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 3 factoid took 926 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 348 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Stuttering acceptance computed with spot in 408 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Stuttering acceptance computed with spot in 439 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), false]
Product exploration explored 100000 steps with 33319 reset in 772 ms.
Product exploration explored 100000 steps with 33313 reset in 787 ms.
Built C files in :
/tmp/ltsmin2710653314531402520
[2022-05-15 16:23:13] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2710653314531402520
Running compilation step : cd /tmp/ltsmin2710653314531402520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2710653314531402520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2710653314531402520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 12 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:23:16] [INFO ] Computed 100 place invariants in 5 ms
[2022-05-15 16:23:16] [INFO ] Implicit Places using invariants in 390 ms returned []
[2022-05-15 16:23:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:23:16] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-15 16:23:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:23:17] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2022-05-15 16:23:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:23:17] [INFO ] Computed 100 place invariants in 11 ms
[2022-05-15 16:23:18] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin17507953170451828055
[2022-05-15 16:23:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17507953170451828055
Running compilation step : cd /tmp/ltsmin17507953170451828055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17507953170451828055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17507953170451828055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 16:23:21] [INFO ] Flatten gal took : 133 ms
[2022-05-15 16:23:21] [INFO ] Flatten gal took : 115 ms
[2022-05-15 16:23:21] [INFO ] Time to serialize gal into /tmp/LTL17693113870621467143.gal : 16 ms
[2022-05-15 16:23:21] [INFO ] Time to serialize properties into /tmp/LTL10653054208609211498.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17693113870621467143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10653054208609211498.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1769311...268
Read 1 LTL properties
Checking formula 0 : !((X(F((!(("(((flag_1_10==1)&&(flag_1_13==1))&&(p1_10==1))")U(X("(((flag_1_11==1)&&(flag_1_32==1))&&(p1_32==1))"))))&&(X(((G(X("(((fla...260
Formula 0 simplified : !XF(!("(((flag_1_10==1)&&(flag_1_13==1))&&(p1_10==1))" U X"(((flag_1_11==1)&&(flag_1_32==1))&&(p1_32==1))") & X("((flag_1_34==0)||(p...239
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
7 unique states visited
5 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
696 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.34893,247020,1,0,5373,1.64118e+06,5243,2656,35349,734275,5506
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-050-LTLFireability-11 finished in 28968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(!p1)&&p0)) U G((G(p2) U !p3)))))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:30] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:23:30] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:23:30] [INFO ] Implicit Places using invariants in 407 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 411 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 367 ms :[p3, p3, (OR (NOT p0) p1), p1, (AND (NOT p2) p3), p3, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p3 p2), acceptance={1} source=1 dest: 4}, { cond=(AND p3 p2), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p3 p2 p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2), acceptance={1} source=4 dest: 4}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 p2 p0), acceptance={} source=4 dest: 7}], [{ cond=(AND p3 (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p3 p2), acceptance={1} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p3 p2 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s7 1) (EQ s31 1) (EQ s130 1)), p2:(AND (EQ s61 1) (EQ s87 1) (EQ s186 1)), p0:(AND (EQ s9 1) (EQ s45 1) (EQ s108 1)), p1:(AND (EQ s9 1) (EQ s4...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 545 reset in 1018 ms.
Stack based approach found an accepted trace after 150 steps with 1 reset with depth 92 and stack size 92 in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-12 finished in 1863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(p0)))&&p1)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:23:31] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:23:32] [INFO ] Implicit Places using invariants in 394 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s7 0) (EQ s91 0) (EQ s190 0)), p0:(OR (EQ s35 0) (EQ s99 0) (EQ s198 0))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 807 reset in 978 ms.
Stack based approach found an accepted trace after 583 steps with 5 reset with depth 177 and stack size 175 in 6 ms.
FORMULA Dekker-PT-050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-13 finished in 1573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p1)||p0))||G(F(p2)))))'
Support contains 12 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:33] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:23:33] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:23:33] [INFO ] Implicit Places using invariants in 394 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s39 0) (EQ s138 0) (EQ s3 0) (EQ s55 0) (EQ s154 0)), p2:(AND (EQ s9 1) (EQ s75 1) (EQ s108 1)), p1:(OR (EQ s21 0) (EQ s59 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 315 reset in 984 ms.
Stack based approach found an accepted trace after 1696 steps with 3 reset with depth 965 and stack size 946 in 17 ms.
FORMULA Dekker-PT-050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-14 finished in 1585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)&&X(!G((p2 U p3)))&&!p4)))'
Support contains 13 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:23:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:23:35] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:23:35] [INFO ] Implicit Places using invariants in 382 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) p3 p4), (NOT p0), (NOT p1), p3]
Running random walk in product with property : Dekker-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p4 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p4 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p4:(AND (EQ s3 1) (EQ s59 1) (EQ s158 1)), p1:(AND (EQ s9 1) (EQ s69 1) (EQ s168 1)), p0:(AND (EQ s1 1) (EQ s21 1) (EQ s100 1)), p2:(AND (EQ s1 1) (EQ s75...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1040 reset in 986 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Dekker-PT-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-15 finished in 1609 ms.
All properties solved by simple procedures.
Total runtime 54811 ms.

BK_STOP 1652631816783

--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, 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 r060-tall-165254772300620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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