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.r165-tall-167838849900092.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 Echo-PT-d03r05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838849900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 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.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:06 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 716K 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-d03r05-LTLFireability-00
FORMULA_NAME Echo-PT-d03r05-LTLFireability-01
FORMULA_NAME Echo-PT-d03r05-LTLFireability-02
FORMULA_NAME Echo-PT-d03r05-LTLFireability-03
FORMULA_NAME Echo-PT-d03r05-LTLFireability-04
FORMULA_NAME Echo-PT-d03r05-LTLFireability-05
FORMULA_NAME Echo-PT-d03r05-LTLFireability-06
FORMULA_NAME Echo-PT-d03r05-LTLFireability-07
FORMULA_NAME Echo-PT-d03r05-LTLFireability-08
FORMULA_NAME Echo-PT-d03r05-LTLFireability-09
FORMULA_NAME Echo-PT-d03r05-LTLFireability-10
FORMULA_NAME Echo-PT-d03r05-LTLFireability-11
FORMULA_NAME Echo-PT-d03r05-LTLFireability-12
FORMULA_NAME Echo-PT-d03r05-LTLFireability-13
FORMULA_NAME Echo-PT-d03r05-LTLFireability-14
FORMULA_NAME Echo-PT-d03r05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679430749964

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=Echo-PT-d03r05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-21 20:32:31] [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-21 20:32:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:32:31] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-21 20:32:31] [INFO ] Transformed 1445 places.
[2023-03-21 20:32:31] [INFO ] Transformed 1190 transitions.
[2023-03-21 20:32:31] [INFO ] Found NUPN structural information;
[2023-03-21 20:32:31] [INFO ] Parsed PT model containing 1445 places and 1190 transitions and 8260 arcs in 208 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 1 formulas.
FORMULA Echo-PT-d03r05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 1445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1445/1445 places, 1190/1190 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 1320 transition count 1190
Applied a total of 125 rules in 108 ms. Remains 1320 /1445 variables (removed 125) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 20:32:33] [INFO ] Computed 600 place invariants in 1783 ms
[2023-03-21 20:32:35] [INFO ] Implicit Places using invariants in 3204 ms returned []
[2023-03-21 20:32:35] [INFO ] Invariant cache hit.
[2023-03-21 20:35:15] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:35:15] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:35:15] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 163261 ms to find 0 implicit places.
[2023-03-21 20:35:15] [INFO ] Invariant cache hit.
[2023-03-21 20:35:23] [INFO ] Dead Transitions using invariants and state equation in 8318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1445 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171702 ms. Remains : 1320/1445 places, 1190/1190 transitions.
Support contains 94 out of 1320 places after structural reductions.
[2023-03-21 20:35:24] [INFO ] Flatten gal took : 291 ms
[2023-03-21 20:35:24] [INFO ] Flatten gal took : 230 ms
[2023-03-21 20:35:24] [INFO ] Input system was already deterministic with 1190 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 37) seen :36
Finished Best-First random walk after 2142 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=119 )
FORMULA Echo-PT-d03r05-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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' '!(X(G(p0)))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 45 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:35:25] [INFO ] Invariant cache hit.
[2023-03-21 20:35:42] [INFO ] Implicit Places using invariants in 17256 ms returned []
[2023-03-21 20:35:43] [INFO ] Invariant cache hit.
[2023-03-21 20:38:23] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:38:23] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:38:23] [INFO ] Implicit Places using invariants and state equation in 160039 ms returned []
Implicit Place search using SMT with State Equation took 177321 ms to find 0 implicit places.
[2023-03-21 20:38:23] [INFO ] Invariant cache hit.
[2023-03-21 20:38:31] [INFO ] Dead Transitions using invariants and state equation in 8240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185615 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-00 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 s398 0) (EQ s762 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 521 steps with 2 reset in 25 ms.
FORMULA Echo-PT-d03r05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-00 finished in 185905 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)))'
Support contains 7 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.12 ms
Discarding 7 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 164 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-21 20:38:33] [INFO ] Computed 594 place invariants in 1496 ms
[2023-03-21 20:41:13] [INFO ] Performed 716/1312 implicitness test of which 2 returned IMPLICIT in 158 seconds.
[2023-03-21 20:41:13] [INFO ] Implicit Places using invariants in 161532 ms returned [615, 716]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161537 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1310/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 74 ms. Remains 1310 /1310 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161775 ms. Remains : 1310/1320 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s622 0) (EQ s623 0) (EQ s624 0) (EQ s625 0) (EQ s1214 0)) (OR (EQ s389 0) (EQ s711 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 401 reset in 1474 ms.
Product exploration explored 100000 steps with 401 reset in 1464 ms.
Computed a total of 1310 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1310 transition count 1188
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), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-01 finished in 165351 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)&&X((G(p2)&&p1))))'
Support contains 9 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 29 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 20:41:18] [INFO ] Computed 600 place invariants in 1550 ms
[2023-03-21 20:41:32] [INFO ] Implicit Places using invariants in 15740 ms returned []
[2023-03-21 20:41:32] [INFO ] Invariant cache hit.
[2023-03-21 20:44:12] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:44:12] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:44:12] [INFO ] Implicit Places using invariants and state equation in 160033 ms returned []
Implicit Place search using SMT with State Equation took 175777 ms to find 0 implicit places.
[2023-03-21 20:44:12] [INFO ] Invariant cache hit.
[2023-03-21 20:44:20] [INFO ] Dead Transitions using invariants and state equation in 7914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183722 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s341 1) (EQ s497 1)), p1:(AND (EQ s98 1) (EQ s825 1) (EQ s826 1) (EQ s827 1) (EQ s828 1)), p2:(AND (EQ s379 1) (EQ s668 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d03r05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-02 finished in 183961 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((F(G(p0)) U !p1)))))'
Support contains 10 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 20 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:44:20] [INFO ] Invariant cache hit.
[2023-03-21 20:44:36] [INFO ] Implicit Places using invariants in 15775 ms returned []
[2023-03-21 20:44:36] [INFO ] Invariant cache hit.
[2023-03-21 20:47:16] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:47:16] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:47:16] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 175803 ms to find 0 implicit places.
[2023-03-21 20:47:16] [INFO ] Invariant cache hit.
[2023-03-21 20:47:24] [INFO ] Dead Transitions using invariants and state equation in 8100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183925 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 210 ms :[p1, p1, p1, (NOT p0), p1]
Running random walk in product with property : Echo-PT-d03r05-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=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s51 1) (EQ s776 1) (EQ s778 1) (EQ s779 1) (EQ s780 1) (EQ s781 1)), p0:(AND (EQ s569 1) (EQ s570 1) (EQ s571 1) (EQ s1172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 501 steps with 1 reset in 8 ms.
FORMULA Echo-PT-d03r05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-04 finished in 184162 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(X((!(p0 U p1)&&F(p0))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 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 48 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-21 20:47:26] [INFO ] Computed 594 place invariants in 1333 ms
[2023-03-21 20:47:39] [INFO ] Implicit Places using invariants in 13999 ms returned [615, 737, 742, 763, 864]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 14005 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1307/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 45 ms. Remains 1307 /1307 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14099 ms. Remains : 1307/1320 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s450 1) (EQ s985 1)), p1:(AND (EQ s353 1) (EQ s545 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 248 steps with 0 reset in 5 ms.
FORMULA Echo-PT-d03r05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-05 finished in 14262 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||X((G(F(p2))||p1)))))'
Support contains 11 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 19 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 20:47:40] [INFO ] Computed 600 place invariants in 1630 ms
[2023-03-21 20:47:55] [INFO ] Implicit Places using invariants in 16322 ms returned []
[2023-03-21 20:47:55] [INFO ] Invariant cache hit.
[2023-03-21 20:50:35] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:50:35] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:50:35] [INFO ] Implicit Places using invariants and state equation in 160023 ms returned []
Implicit Place search using SMT with State Equation took 176347 ms to find 0 implicit places.
[2023-03-21 20:50:35] [INFO ] Invariant cache hit.
[2023-03-21 20:50:43] [INFO ] Dead Transitions using invariants and state equation in 7715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184084 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s336 1) (EQ s477 1)), p1:(OR (EQ s296 0) (EQ s1013 0) (EQ s1014 0) (EQ s1015 0) (EQ s1016 0)), p2:(AND (EQ s570 1) (EQ s571 1) (EQ s572 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 898 ms.
Product exploration explored 100000 steps with 50000 reset in 823 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-06 finished in 186547 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 U p2))))'
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 26 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:50:45] [INFO ] Invariant cache hit.
[2023-03-21 20:51:01] [INFO ] Implicit Places using invariants in 15883 ms returned []
[2023-03-21 20:51:01] [INFO ] Invariant cache hit.
[2023-03-21 20:53:41] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:53:41] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:53:41] [INFO ] Implicit Places using invariants and state equation in 160029 ms returned []
Implicit Place search using SMT with State Equation took 175914 ms to find 0 implicit places.
[2023-03-21 20:53:41] [INFO ] Invariant cache hit.
[2023-03-21 20:53:49] [INFO ] Dead Transitions using invariants and state equation in 7853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183796 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 712 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s386 1) (EQ s696 1)), p1:(AND (NOT (AND (EQ s454 1) (EQ s1011 1) (EQ s402 1) (EQ s785 1))) (EQ s341 1) (EQ s497 1)), p0:(OR (EQ s386 0) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 869 ms.
Product exploration explored 100000 steps with 50000 reset in 908 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p2) (NOT p1) p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p2 p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 12 factoid took 1947 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-07 finished in 188702 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(p1)&&F(G(p2))&&p0)))'
Support contains 11 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 26 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:53:54] [INFO ] Invariant cache hit.
[2023-03-21 20:54:08] [INFO ] Implicit Places using invariants in 14313 ms returned []
[2023-03-21 20:54:08] [INFO ] Invariant cache hit.
[2023-03-21 20:56:48] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:56:48] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:56:48] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 174340 ms to find 0 implicit places.
[2023-03-21 20:56:48] [INFO ] Invariant cache hit.
[2023-03-21 20:56:57] [INFO ] Dead Transitions using invariants and state equation in 8414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182783 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s402 1) (EQ s786 1) (EQ s332 1) (EQ s414 1) (EQ s335 1) (EQ s473 1)), p1:(AND (EQ s7 1) (EQ s726 1) (EQ s728 1) (EQ s729 1) (EQ s730 1)), p2:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-08 finished in 182986 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)||X(X(F((p1&&F(p2)))))))'
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 24 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:56:57] [INFO ] Invariant cache hit.
[2023-03-21 20:57:14] [INFO ] Implicit Places using invariants in 16778 ms returned []
[2023-03-21 20:57:14] [INFO ] Invariant cache hit.
[2023-03-21 20:59:54] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:59:54] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:59:54] [INFO ] Implicit Places using invariants and state equation in 160040 ms returned []
Implicit Place search using SMT with State Equation took 176819 ms to find 0 implicit places.
[2023-03-21 20:59:54] [INFO ] Invariant cache hit.
[2023-03-21 21:00:02] [INFO ] Dead Transitions using invariants and state equation in 8239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185083 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (EQ s676 0) (EQ s678 0) (EQ s679 0) (EQ s1277 0)), p1:(OR (EQ s408 0) (EQ s809 0)), p0:(AND (EQ s402 1) (EQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 767 ms.
Product exploration explored 100000 steps with 33333 reset in 810 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p2 p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p2)))))
Knowledge based reduction with 11 factoid took 267 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-09 finished in 187679 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)||F(p1)))'
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 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 41 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-21 21:00:06] [INFO ] Computed 594 place invariants in 1361 ms
[2023-03-21 21:00:21] [INFO ] Implicit Places using invariants in 16506 ms returned [615, 716, 737, 742, 864]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 16513 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1307/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 36 ms. Remains 1307 /1307 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16592 ms. Remains : 1307/1320 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (AND (EQ s386 1) (EQ s697 1)) (AND (EQ s567 1) (EQ s568 1) (EQ s570 1) (EQ s1158 1))), p0:(OR (EQ s426 0) (EQ s885 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 598 steps with 3 reset in 11 ms.
FORMULA Echo-PT-d03r05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-10 finished in 16723 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' '!(((p0 U p1) U (X(F(p1))&&(p1||X((p2 U p3))))))'
Support contains 9 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 18 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 21:00:23] [INFO ] Computed 600 place invariants in 1560 ms
[2023-03-21 21:00:39] [INFO ] Implicit Places using invariants in 17506 ms returned []
[2023-03-21 21:00:39] [INFO ] Invariant cache hit.
[2023-03-21 21:03:19] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 21:03:19] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 21:03:19] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 177533 ms to find 0 implicit places.
[2023-03-21 21:03:19] [INFO ] Invariant cache hit.
[2023-03-21 21:03:27] [INFO ] Dead Transitions using invariants and state equation in 8034 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185587 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s435 1) (EQ s939 1)), p0:(AND (EQ s554 1) (EQ s555 1) (EQ s557 1) (EQ s558 1) (EQ s1156 1)), p3:(AND (EQ s435 1) (EQ s939 1) (EQ s332 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-11 finished in 185947 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||X(((F(p2)&&p1) U p3))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 23 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 21:03:27] [INFO ] Invariant cache hit.
[2023-03-21 21:03:45] [INFO ] Implicit Places using invariants in 17503 ms returned []
[2023-03-21 21:03:45] [INFO ] Invariant cache hit.
[2023-03-21 21:06:25] [INFO ] Implicit Places using invariants and state equation in 160021 ms returned []
Implicit Place search using SMT with State Equation took 177530 ms to find 0 implicit places.
[2023-03-21 21:06:25] [INFO ] Invariant cache hit.
[2023-03-21 21:06:33] [INFO ] Dead Transitions using invariants and state equation in 8558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186113 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s459 1) (EQ s1027 1)), p3:(AND (EQ s340 1) (EQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 984 steps with 29 reset in 18 ms.
FORMULA Echo-PT-d03r05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-13 finished in 186280 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(F(p0))&&(X(X(p1)) U p2))))'
Support contains 7 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 27 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 21:06:34] [INFO ] Invariant cache hit.
[2023-03-21 21:09:14] [INFO ] Implicit Places using invariants in 160019 ms returned []
[2023-03-21 21:09:14] [INFO ] Invariant cache hit.
[2023-03-21 21:11:54] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 21:11:54] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 21:11:54] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 320052 ms to find 0 implicit places.
[2023-03-21 21:11:54] [INFO ] Invariant cache hit.
[2023-03-21 21:12:02] [INFO ] Dead Transitions using invariants and state equation in 8009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328090 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s35 1) (EQ s759 1) (EQ s760 1) (EQ s762 1) (EQ s763 1)), p0:(OR (EQ s35 0) (EQ s759 0) (EQ s760 0) (EQ s762 0) (EQ s763 0)), p1:(AND (EQ s413 ...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 1 ms.
FORMULA Echo-PT-d03r05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-14 finished in 328395 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(X((G(!p0) U G(p1))))))'
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 18 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 21:12:02] [INFO ] Invariant cache hit.
[2023-03-21 21:12:19] [INFO ] Implicit Places using invariants in 17004 ms returned []
[2023-03-21 21:12:19] [INFO ] Invariant cache hit.
[2023-03-21 21:14:59] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 21:14:59] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 21:14:59] [INFO ] Implicit Places using invariants and state equation in 160034 ms returned []
Implicit Place search using SMT with State Equation took 177050 ms to find 0 implicit places.
[2023-03-21 21:14:59] [INFO ] Invariant cache hit.
[2023-03-21 21:15:07] [INFO ] Dead Transitions using invariants and state equation in 7902 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184983 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 1578 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s407 1) (EQ s805 1)), p0:(AND (EQ s535 1) (EQ s536 1) (EQ s537 1) (EQ s1138 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]]
Product exploration explored 100000 steps with 16671 reset in 752 ms.
Product exploration explored 100000 steps with 16612 reset in 836 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p1) (NOT p0)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Finished random walk after 5381 steps, including 21 resets, run visited all 5 properties in 105 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
[2023-03-21 21:15:12] [INFO ] Invariant cache hit.
[2023-03-21 21:15:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 21:15:27] [INFO ] [Real]Absence check using 0 positive and 600 generalized place invariants in 13605 ms returned unknown
Could not prove EG (NOT p1)
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 20 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 21:15:27] [INFO ] Invariant cache hit.
[2023-03-21 21:15:45] [INFO ] Implicit Places using invariants in 17781 ms returned []
[2023-03-21 21:15:45] [INFO ] Invariant cache hit.
[2023-03-21 21:18:25] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 21:18:25] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 21:18:25] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 177825 ms to find 0 implicit places.
[2023-03-21 21:18:25] [INFO ] Invariant cache hit.
[2023-03-21 21:18:33] [INFO ] Dead Transitions using invariants and state equation in 8181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186036 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 875 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:18:35] [INFO ] Invariant cache hit.
[2023-03-21 21:18:37] [INFO ] [Real]Absence check using 0 positive and 600 generalized place invariants in 2400 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:19:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:19:00] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1307 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 1307 transition count 1183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 1306 transition count 1182
Applied a total of 8 rules in 92 ms. Remains 1306 /1320 variables (removed 14) and now considering 1182/1190 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1306/1320 places, 1182/1190 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 495036 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 495036 steps, saw 82701 distinct states, run finished after 3003 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1182 rows 1306 cols
[2023-03-21 21:19:04] [INFO ] Computed 588 place invariants in 1485 ms
[2023-03-21 21:19:06] [INFO ] [Real]Absence check using 0 positive and 588 generalized place invariants in 1020 ms returned sat
[2023-03-21 21:19:16] [INFO ] After 11206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1182/1182 transitions.
Applied a total of 0 rules in 48 ms. Remains 1306 /1306 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1306/1306 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1182/1182 transitions.
Applied a total of 0 rules in 31 ms. Remains 1306 /1306 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2023-03-21 21:19:16] [INFO ] Invariant cache hit.
[2023-03-21 21:19:28] [INFO ] Implicit Places using invariants in 12722 ms returned [611, 712, 733, 738, 759, 860]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 12724 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1300/1306 places, 1182/1182 transitions.
Applied a total of 0 rules in 32 ms. Remains 1300 /1300 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12788 ms. Remains : 1300/1306 places, 1182/1182 transitions.
Finished random walk after 1102 steps, including 4 resets, run visited all 1 properties in 16 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 779 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 21:19:31] [INFO ] Computed 600 place invariants in 1566 ms
[2023-03-21 21:19:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 21:19:46] [INFO ] [Real]Absence check using 0 positive and 600 generalized place invariants in 13709 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Product exploration explored 100000 steps with 33310 reset in 902 ms.
Product exploration explored 100000 steps with 33316 reset in 926 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 122 ms. Remains 1313 /1320 variables (removed 7) and now considering 1189/1190 (removed 1) transitions.
[2023-03-21 21:19:49] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 1189 rows 1313 cols
[2023-03-21 21:19:50] [INFO ] Computed 594 place invariants in 1558 ms
[2023-03-21 21:20:50] [INFO ] Performed 0/1189 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 21:20:50] [INFO ] Dead Transitions using invariants and state equation in 61575 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1313/1320 places, 1189/1190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61804 ms. Remains : 1313/1320 places, 1189/1190 transitions.
Built C files in :
/tmp/ltsmin4146618382963772223
[2023-03-21 21:20:50] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146618382963772223
Running compilation step : cd /tmp/ltsmin4146618382963772223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2627 ms.
Running link step : cd /tmp/ltsmin4146618382963772223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4146618382963772223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7016482591172348205.hoa' '--buchi-type=spotba'
LTSmin run took 3305 ms.
FORMULA Echo-PT-d03r05-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Echo-PT-d03r05-LTLFireability-15 finished in 534340 ms.
All properties solved by simple procedures.
Total runtime 2905492 ms.

BK_STOP 1679433664401

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="Echo-PT-d03r05"
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 Echo-PT-d03r05, 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 r165-tall-167838849900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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