Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410000028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r133-smll-167819410000028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 1678257539533

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 06:39:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 06:39:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:39:03] [INFO ] Load time of PNML (sax parser for PT used): 585 ms
[2023-03-08 06:39:03] [INFO ] Transformed 250 places.
[2023-03-08 06:39:03] [INFO ] Transformed 2600 transitions.
[2023-03-08 06:39:03] [INFO ] Found NUPN structural information;
[2023-03-08 06:39:03] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 781 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 120 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 74 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-08 06:39:03] [INFO ] Computed 150 place invariants in 30 ms
[2023-03-08 06:39:04] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-08 06:39:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:04] [INFO ] Invariant cache hit.
[2023-03-08 06:39:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:39:05] [INFO ] Implicit Places using invariants and state equation in 760 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 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 with State Equation took 1536 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 31 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1642 ms. Remains : 201/250 places, 2600/2600 transitions.
Support contains 120 out of 201 places after structural reductions.
[2023-03-08 06:39:06] [INFO ] Flatten gal took : 434 ms
[2023-03-08 06:39:06] [INFO ] Flatten gal took : 204 ms
[2023-03-08 06:39:07] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 117 out of 201 places (down from 120) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 34) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:39:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 06:39:08] [INFO ] Computed 101 place invariants in 2 ms
[2023-03-08 06:39:08] [INFO ] [Real]Absence check using 100 positive place invariants in 31 ms returned sat
[2023-03-08 06:39:08] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:39:08] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p2)||p1))))'
Support contains 11 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 51 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:09] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:09] [INFO ] Invariant cache hit.
[2023-03-08 06:39:09] [INFO ] Implicit Places using invariants in 716 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 724 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 33 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 809 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 539 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : Dekker-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s77 1) (EQ s176 1)), p1:(OR (AND (EQ s3 1) (EQ s45 1) (EQ s102 1) (EQ s17 1) (EQ s87 1) (EQ s116 1)) (AND (EQ s7 1) (EQ s77 1) (EQ s...], nbAcceptance=0, 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 34 steps with 1 reset in 7 ms.
FORMULA Dekker-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-00 finished in 1460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 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 363 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:10] [INFO ] Invariant cache hit.
[2023-03-08 06:39:11] [INFO ] Implicit Places using invariants in 735 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 741 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 181 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1288 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s63 1) (EQ s162 1) (OR (EQ s33 0) (EQ s59 0) (EQ s132 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][true]]
Product exploration explored 100000 steps with 905 reset in 1510 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-01 finished in 2877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 4 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 112 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:13] [INFO ] Invariant cache hit.
[2023-03-08 06:39:14] [INFO ] Implicit Places using invariants in 843 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 854 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 112 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1079 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s41 1) (EQ s140 1)), p1:(AND (EQ s41 1) (EQ s43 1) (EQ s140 1)), p2:(OR (AND (EQ s41 1) (EQ s43 1) (EQ s140 1)) (AND (EQ s25 1) (EQ...], nbAcceptance=3, 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 1715 ms.
Stack based approach found an accepted trace after 194 steps with 0 reset with depth 195 and stack size 195 in 4 ms.
FORMULA Dekker-PT-050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-02 finished in 2972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0))||G(p2)||X(F(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.
[2023-03-08 06:39:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:16] [INFO ] Invariant cache hit.
[2023-03-08 06:39:17] [INFO ] Implicit Places using invariants in 770 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 775 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 17 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 809 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (EQ s83 1) (EQ s99 1) (EQ s182 1)), p3:(AND (EQ s87 1) (EQ s93 1) (EQ s192 1)), p1:(AND (EQ s7 1) (EQ s61 1) (EQ s106 1)), p2:(AND (EQ s83 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1226 reset in 1404 ms.
Stack based approach found an accepted trace after 92 steps with 1 reset with depth 5 and stack size 5 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-03 finished in 2609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||F((p1||G(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 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:19] [INFO ] Invariant cache hit.
[2023-03-08 06:39:19] [INFO ] Implicit Places using invariants in 835 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 844 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 19 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 879 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s21 1) (EQ s118 1)), p1:(AND (EQ s9 1) (EQ s25 1) (EQ s108 1)), p2:(AND (EQ s1 1) (EQ s77 1) (EQ s176 1))], 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 1024 reset in 1387 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 52 in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-04 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&G(p2))))))'
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 88 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:21] [INFO ] Invariant cache hit.
[2023-03-08 06:39:22] [INFO ] Implicit Places using invariants in 696 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 702 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 154 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 949 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s75 0) (EQ s91 0) (EQ s190 0)), p2:(AND (EQ s13 1) (EQ s73 1) (EQ s172 1)), p0:(AND (EQ s29 1) (EQ s91 1) (EQ s128 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1630 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-05 finished in 2874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 6 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 91 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:24] [INFO ] Invariant cache hit.
[2023-03-08 06:39:25] [INFO ] Implicit Places using invariants in 538 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 554 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 87 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 732 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s65 0) (EQ s122 0)), p1:(AND (EQ s29 1) (EQ s47 1) (EQ s146 1) (EQ s23 1) (EQ s65 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 353 reset in 1189 ms.
Stack based approach found an accepted trace after 285 steps with 2 reset with depth 58 and stack size 57 in 5 ms.
FORMULA Dekker-PT-050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-06 finished in 2030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(X(p1) U ((!p2&&X(p1))||X(G(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 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:26] [INFO ] Invariant cache hit.
[2023-03-08 06:39:26] [INFO ] Implicit Places using invariants in 554 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 558 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 LTL mode , in 2 iterations and 589 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s41 1) (EQ s57 1) (EQ s156 1)), p0:(AND (EQ s23 1) (EQ s75 1) (EQ s174 1)), p1:(OR (AND (EQ s15 1) (EQ s115 1)) (AND (EQ s41 1) (EQ s57 1) (EQ...], 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 0 reset in 1206 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-07 finished in 2036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
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 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:28] [INFO ] Invariant cache hit.
[2023-03-08 06:39:29] [INFO ] Implicit Places using invariants in 776 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 780 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 LTL mode , in 2 iterations and 810 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s53 0) (EQ s93 0) (EQ s192 0)), p1:(AND (OR (EQ s51 0) (EQ s77 0) (EQ s176 0)) (OR (EQ s13 0) (EQ s87 0) (EQ s186 0)))], 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 1195 ms.
Product exploration explored 100000 steps with 50000 reset in 1022 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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-050-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLFireability-09 finished in 3461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 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 83 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:31] [INFO ] Invariant cache hit.
[2023-03-08 06:39:32] [INFO ] Implicit Places using invariants in 577 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 580 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 SI_LTL mode , in 2 iterations and 747 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-10 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 (NEQ s13 1) (NEQ s65 1) (NEQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 774 reset in 1183 ms.
Stack based approach found an accepted trace after 1323 steps with 3 reset with depth 536 and stack size 525 in 17 ms.
FORMULA Dekker-PT-050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-10 finished in 2059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(X(X(X(p1)))&&G(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 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:33] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:33] [INFO ] Invariant cache hit.
[2023-03-08 06:39:34] [INFO ] Implicit Places using invariants in 756 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 759 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 LTL mode , in 2 iterations and 790 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (AND (NOT p2) p0), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 1}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 2}]], initial=0, aps=[p2:(OR (EQ s27 0) (EQ s45 0) (EQ s126 0)), p0:(AND (EQ s39 1) (EQ s99 1) (EQ s198 1)), p1:(AND (EQ s13 1) (EQ s71 1) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-14 finished in 1287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(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 14 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:39:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:39:35] [INFO ] Invariant cache hit.
[2023-03-08 06:39:35] [INFO ] Implicit Places using invariants in 723 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 727 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 LTL mode , in 2 iterations and 759 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s75 1) (EQ s93 1) (EQ s174 1)) (AND (EQ s53 1) (EQ s89 1) (EQ s152 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]]
Product exploration explored 100000 steps with 1762 reset in 1165 ms.
Stack based approach found an accepted trace after 64 steps with 1 reset with depth 54 and stack size 54 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-15 finished in 2051 ms.
All properties solved by simple procedures.
Total runtime 34607 ms.

BK_STOP 1678257578352

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5348"
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 r133-smll-167819410000028"
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 ;