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.r169-tall-167838855300060.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 ltsminxred
Input is Echo-PT-d02r11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 469K 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 Echo-PT-d02r11-LTLFireability-00
FORMULA_NAME Echo-PT-d02r11-LTLFireability-01
FORMULA_NAME Echo-PT-d02r11-LTLFireability-02
FORMULA_NAME Echo-PT-d02r11-LTLFireability-03
FORMULA_NAME Echo-PT-d02r11-LTLFireability-04
FORMULA_NAME Echo-PT-d02r11-LTLFireability-05
FORMULA_NAME Echo-PT-d02r11-LTLFireability-06
FORMULA_NAME Echo-PT-d02r11-LTLFireability-07
FORMULA_NAME Echo-PT-d02r11-LTLFireability-08
FORMULA_NAME Echo-PT-d02r11-LTLFireability-09
FORMULA_NAME Echo-PT-d02r11-LTLFireability-10
FORMULA_NAME Echo-PT-d02r11-LTLFireability-11
FORMULA_NAME Echo-PT-d02r11-LTLFireability-12
FORMULA_NAME Echo-PT-d02r11-LTLFireability-13
FORMULA_NAME Echo-PT-d02r11-LTLFireability-14
FORMULA_NAME Echo-PT-d02r11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678468996048

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 17:23:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 17:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:23:17] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-10 17:23:17] [INFO ] Transformed 1119 places.
[2023-03-10 17:23:17] [INFO ] Transformed 874 transitions.
[2023-03-10 17:23:17] [INFO ] Found NUPN structural information;
[2023-03-10 17:23:17] [INFO ] Parsed PT model containing 1119 places and 874 transitions and 4996 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d02r11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 874/874 transitions.
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 998 transition count 874
Applied a total of 121 rules in 101 ms. Remains 998 /1119 variables (removed 121) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 17:23:18] [INFO ] Computed 440 place invariants in 333 ms
[2023-03-10 17:23:22] [INFO ] Implicit Places using invariants in 4022 ms returned []
[2023-03-10 17:23:22] [INFO ] Invariant cache hit.
[2023-03-10 17:26:02] [INFO ] Performed 166/998 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2023-03-10 17:26:02] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2023-03-10 17:26:02] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 164076 ms to find 0 implicit places.
[2023-03-10 17:26:02] [INFO ] Invariant cache hit.
[2023-03-10 17:26:03] [INFO ] Dead Transitions using invariants and state equation in 1653 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1119 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165833 ms. Remains : 998/1119 places, 874/874 transitions.
Support contains 74 out of 998 places after structural reductions.
[2023-03-10 17:26:04] [INFO ] Flatten gal took : 175 ms
[2023-03-10 17:26:04] [INFO ] Flatten gal took : 82 ms
[2023-03-10 17:26:04] [INFO ] Input system was already deterministic with 874 transitions.
Support contains 72 out of 998 places (down from 74) after GAL structural reductions.
Finished random walk after 9520 steps, including 39 resets, run visited all 28 properties in 337 ms. (steps per millisecond=28 )
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(p0) U G((p1 U X(p1)))))'
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 48 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2023-03-10 17:26:05] [INFO ] Invariant cache hit.
[2023-03-10 17:26:09] [INFO ] Implicit Places using invariants in 3841 ms returned []
[2023-03-10 17:26:09] [INFO ] Invariant cache hit.
[2023-03-10 17:26:20] [INFO ] Implicit Places using invariants and state equation in 11480 ms returned []
Implicit Place search using SMT with State Equation took 15337 ms to find 0 implicit places.
[2023-03-10 17:26:20] [INFO ] Invariant cache hit.
[2023-03-10 17:26:22] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16976 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s206 1)), p1:(AND (EQ s33 1) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-02 finished in 17404 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||X(F(p1))))))'
Support contains 7 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 76 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2023-03-10 17:26:23] [INFO ] Computed 436 place invariants in 316 ms
[2023-03-10 17:26:26] [INFO ] Implicit Places using invariants in 3787 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3791 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 65 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3933 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s147 1) (EQ s149 1) (EQ s580 1)), p1:(AND (EQ s434 1) (EQ s435 1) (EQ s871 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 344 steps with 1 reset in 11 ms.
FORMULA Echo-PT-d02r11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-03 finished in 4038 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((G((p0||F(!p1))) U (p2 U p3))))'
Support contains 10 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 21 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 17:26:26] [INFO ] Computed 440 place invariants in 223 ms
[2023-03-10 17:26:30] [INFO ] Implicit Places using invariants in 4050 ms returned []
[2023-03-10 17:26:30] [INFO ] Invariant cache hit.
[2023-03-10 17:26:42] [INFO ] Implicit Places using invariants and state equation in 11376 ms returned []
Implicit Place search using SMT with State Equation took 15429 ms to find 0 implicit places.
[2023-03-10 17:26:42] [INFO ] Invariant cache hit.
[2023-03-10 17:26:43] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17099 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p3), (NOT p3), p1, (AND p1 (NOT p0)), (AND p0 p1 (NOT p3))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s64 1) (EQ s339 1)), p2:(AND (EQ s281 1) (EQ s282 1) (EQ s284 1) (EQ s723 1)), p0:(AND (EQ s19 1) (EQ s183 1)), p1:(AND (EQ s43 1) (EQ s260 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 749 reset in 1026 ms.
Product exploration explored 100000 steps with 666 reset in 977 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 737 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p3), (NOT p3)]
Finished random walk after 5620 steps, including 23 resets, run visited all 1 properties in 58 ms. (steps per millisecond=96 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 18 factoid took 589 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p3)]
[2023-03-10 17:26:47] [INFO ] Invariant cache hit.
[2023-03-10 17:27:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:27:03] [INFO ] [Real]Absence check using 0 positive and 440 generalized place invariants in 14232 ms returned unknown
Could not prove EG (NOT p3)
Support contains 2 out of 998 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 42 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2023-03-10 17:27:03] [INFO ] Computed 436 place invariants in 261 ms
[2023-03-10 17:27:07] [INFO ] Implicit Places using invariants in 4511 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4514 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 35 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4592 ms. Remains : 988/998 places, 872/874 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p3)]
Finished random walk after 745 steps, including 3 resets, run visited all 1 properties in 12 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3))), (F (G (NOT p3)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p3)]
// Phase 1: matrix 872 rows 988 cols
[2023-03-10 17:27:08] [INFO ] Computed 432 place invariants in 262 ms
[2023-03-10 17:27:19] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 10447 ms returned sat
[2023-03-10 17:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:27:23] [INFO ] [Real]Absence check using state equation in 3807 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 27 ms :[(NOT p3)]
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 6 ms.
FORMULA Echo-PT-d02r11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-04 finished in 57001 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((G(!p0)||(!p0&&F(!p1))||X((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))'
Support contains 12 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 19 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 17:27:23] [INFO ] Computed 440 place invariants in 208 ms
[2023-03-10 17:27:27] [INFO ] Implicit Places using invariants in 4257 ms returned []
[2023-03-10 17:27:27] [INFO ] Invariant cache hit.
[2023-03-10 17:27:39] [INFO ] Implicit Places using invariants and state equation in 11639 ms returned []
Implicit Place search using SMT with State Equation took 15901 ms to find 0 implicit places.
[2023-03-10 17:27:39] [INFO ] Invariant cache hit.
[2023-03-10 17:27:41] [INFO ] Dead Transitions using invariants and state equation in 1509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17431 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 392 ms :[(AND p0 p2), (AND p0 p2), p2, p2, (AND p1 p0 p2), (AND p0 p1 p2), (AND p1 p2), (AND p1 p2), true, p1, (AND p1 p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 9}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 p2), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p1, acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s328 1)), p1:(AND (EQ s310 1) (EQ s311 1) (EQ s312 1) (EQ s749 1)), p2:(AND (EQ s411 1) (EQ s413 1) (EQ s414 1) (EQ s852 1)), p3:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 691 ms.
Product exploration explored 100000 steps with 50000 reset in 709 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p3 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 14 factoid took 226 ms. Reduced automaton from 11 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-05 finished in 19781 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(G(p0)))'
Support contains 2 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 20 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2023-03-10 17:27:43] [INFO ] Invariant cache hit.
[2023-03-10 17:27:47] [INFO ] Implicit Places using invariants in 3640 ms returned []
[2023-03-10 17:27:47] [INFO ] Invariant cache hit.
[2023-03-10 17:29:04] [INFO ] Performed 561/998 implicitness test of which 0 returned IMPLICIT in 77 seconds.
[2023-03-10 17:29:05] [INFO ] Implicit Places using invariants and state equation in 78342 ms returned []
Implicit Place search using SMT with State Equation took 81985 ms to find 0 implicit places.
[2023-03-10 17:29:05] [INFO ] Invariant cache hit.
[2023-03-10 17:29:07] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83585 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s199 0) (EQ s640 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1055 steps with 4 reset in 12 ms.
FORMULA Echo-PT-d02r11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-06 finished in 83685 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((p0||G(!p1))) U p2))'
Support contains 8 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 37 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2023-03-10 17:29:07] [INFO ] Computed 436 place invariants in 274 ms
[2023-03-10 17:29:10] [INFO ] Implicit Places using invariants in 3747 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3749 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 37 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3824 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s97 1) (EQ s465 1)), p0:(AND (EQ s6 1) (EQ s144 1)), p1:(AND (EQ s318 1) (EQ s320 1) (EQ s321 1) (EQ s751 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 786 steps with 3 reset in 12 ms.
FORMULA Echo-PT-d02r11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-08 finished in 3967 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 2 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 32 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
[2023-03-10 17:29:11] [INFO ] Invariant cache hit.
[2023-03-10 17:29:14] [INFO ] Implicit Places using invariants in 3501 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3503 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 27 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3563 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-09 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 s112 1) (NEQ s522 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 458 reset in 854 ms.
Product exploration explored 100000 steps with 444 reset in 899 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-09 finished in 5771 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((p0||G(p1))))'
Support contains 6 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 17:29:17] [INFO ] Computed 440 place invariants in 214 ms
[2023-03-10 17:29:20] [INFO ] Implicit Places using invariants in 3914 ms returned []
[2023-03-10 17:29:20] [INFO ] Invariant cache hit.
[2023-03-10 17:31:38] [INFO ] Performed 561/998 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2023-03-10 17:31:38] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2023-03-10 17:31:38] [INFO ] Implicit Places using invariants and state equation in 137692 ms returned []
Implicit Place search using SMT with State Equation took 141608 ms to find 0 implicit places.
[2023-03-10 17:31:38] [INFO ] Invariant cache hit.
[2023-03-10 17:31:40] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143282 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s120 0) (EQ s560 0)), p0:(AND (EQ s120 1) (EQ s560 1) (OR (AND (EQ s37 1) (EQ s236 1)) (AND (EQ s40 1) (EQ s249 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-10 finished in 143433 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((p0&&F(G(p1)))))'
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2023-03-10 17:31:40] [INFO ] Invariant cache hit.
[2023-03-10 17:31:44] [INFO ] Implicit Places using invariants in 4098 ms returned []
[2023-03-10 17:31:44] [INFO ] Invariant cache hit.
[2023-03-10 17:31:55] [INFO ] Implicit Places using invariants and state equation in 10982 ms returned []
Implicit Place search using SMT with State Equation took 15082 ms to find 0 implicit places.
[2023-03-10 17:31:55] [INFO ] Invariant cache hit.
[2023-03-10 17:31:57] [INFO ] Dead Transitions using invariants and state equation in 1653 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16752 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, 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:(OR (EQ s99 0) (EQ s477 0) (AND (EQ s72 1) (EQ s370 1))), p1:(AND (EQ s99 1) (EQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-12 finished in 16894 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((p0||F(p1)||X(p0))))'
Support contains 6 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 12 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2023-03-10 17:31:57] [INFO ] Invariant cache hit.
[2023-03-10 17:32:00] [INFO ] Implicit Places using invariants in 3650 ms returned []
[2023-03-10 17:32:00] [INFO ] Invariant cache hit.
[2023-03-10 17:32:12] [INFO ] Implicit Places using invariants and state equation in 11858 ms returned []
Implicit Place search using SMT with State Equation took 15510 ms to find 0 implicit places.
[2023-03-10 17:32:12] [INFO ] Invariant cache hit.
[2023-03-10 17:32:14] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17199 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s136 1)), p0:(AND (EQ s491 1) (EQ s492 1) (EQ s494 1) (EQ s929 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 568 steps with 5 reset in 7 ms.
FORMULA Echo-PT-d02r11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-13 finished in 17451 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(X(p0)) U p1)))&&F(p2)))'
Support contains 6 out of 998 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 33 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2023-03-10 17:32:15] [INFO ] Computed 436 place invariants in 276 ms
[2023-03-10 17:32:18] [INFO ] Implicit Places using invariants in 4114 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4117 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 24 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4174 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s10 1) (EQ s161 1)), p2:(AND (EQ s143 1) (EQ s144 1) (EQ s145 1) (EQ s574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d02r11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-14 finished in 4306 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)&&F(G(p1)))))'
Support contains 6 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 26 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
[2023-03-10 17:32:19] [INFO ] Invariant cache hit.
[2023-03-10 17:32:22] [INFO ] Implicit Places using invariants in 3698 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3701 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 30 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3759 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s384 1) (NEQ s385 1) (NEQ s386 1) (NEQ s816 1)), p1:(AND (EQ s111 1) (EQ s519 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d02r11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-15 finished in 3882 ms.
All properties solved by simple procedures.
Total runtime 545345 ms.
ITS solved all properties within timeout

BK_STOP 1678469544259

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

+ 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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Echo-PT-d02r11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d02r11, 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 r169-tall-167838855300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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