Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.4K Apr 29 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 469K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1652667354916

Running Version 202205111006
[2022-05-16 02:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:15:56] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-05-16 02:15:56] [INFO ] Transformed 1119 places.
[2022-05-16 02:15:56] [INFO ] Transformed 874 transitions.
[2022-05-16 02:15:56] [INFO ] Found NUPN structural information;
[2022-05-16 02:15:56] [INFO ] Parsed PT model containing 1119 places and 874 transitions in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d02r11-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 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 104 ms. Remains 998 /1119 variables (removed 121) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:15:56] [INFO ] Computed 440 place invariants in 306 ms
[2022-05-16 02:16:00] [INFO ] Implicit Places using invariants in 3396 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:16:00] [INFO ] Computed 440 place invariants in 256 ms
[2022-05-16 02:18:07] [INFO ] Performed 166/998 implicitness test of which 0 returned IMPLICIT in 126 seconds.
[2022-05-16 02:18:07] [INFO ] Timeout of Implicit test with SMT after 126 seconds.
[2022-05-16 02:18:07] [INFO ] Implicit Places using invariants and state equation in 127168 ms returned []
Implicit Place search using SMT with State Equation took 130595 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:18:07] [INFO ] Computed 440 place invariants in 228 ms
[2022-05-16 02:18:09] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1119 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1119 places, 874/874 transitions.
Support contains 90 out of 998 places after structural reductions.
[2022-05-16 02:18:09] [INFO ] Flatten gal took : 133 ms
[2022-05-16 02:18:09] [INFO ] Flatten gal took : 84 ms
[2022-05-16 02:18:09] [INFO ] Input system was already deterministic with 874 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 32) seen :31
Finished Best-First random walk after 3033 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=116 )
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(p1)))))'
Support contains 8 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 56 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:18:10] [INFO ] Computed 440 place invariants in 228 ms
[2022-05-16 02:18:13] [INFO ] Implicit Places using invariants in 3293 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:18:14] [INFO ] Computed 440 place invariants in 217 ms
[2022-05-16 02:20:54] [INFO ] Performed 599/998 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2022-05-16 02:20:54] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2022-05-16 02:20:54] [INFO ] Implicit Places using invariants and state equation in 160243 ms returned []
Implicit Place search using SMT with State Equation took 163542 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:20:54] [INFO ] Computed 440 place invariants in 231 ms
[2022-05-16 02:20:56] [INFO ] Dead Transitions using invariants and state equation in 1948 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s408 1) (EQ s409 1) (EQ s410 1) (EQ s847 1)), p1:(AND (EQ s255 1) (EQ s256 1) (EQ s258 1) (EQ s697 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 14 ms.
FORMULA Echo-PT-d02r11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-00 finished in 165997 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(!F(p0))||!p1) U p2))'
Support contains 5 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.37 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 113 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:20:56] [INFO ] Computed 436 place invariants in 271 ms
[2022-05-16 02:21:00] [INFO ] Implicit Places using invariants in 3784 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3790 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 50 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), p2, (AND (NOT p0) p2)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s475 1) (EQ s477 1) (EQ s912 1)), p2:(AND (EQ s118 1) (EQ s546 1) (NOT (AND (EQ s475 1) (EQ s477 1) (EQ s912 1)))), p1:(AND (EQ s118 1) (EQ s5...], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 31 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 4094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||!(G((X(p0)||p1)) U 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 15 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:00] [INFO ] Computed 440 place invariants in 231 ms
[2022-05-16 02:21:04] [INFO ] Implicit Places using invariants in 3495 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:04] [INFO ] Computed 440 place invariants in 228 ms
[2022-05-16 02:21:15] [INFO ] Implicit Places using invariants and state equation in 11369 ms returned []
Implicit Place search using SMT with State Equation took 14867 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:15] [INFO ] Computed 440 place invariants in 235 ms
[2022-05-16 02:21:17] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 316 ms :[p0, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 p0), (AND p1 (NOT p0)), true, (OR p0 p1), false]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 0}, { cond=p1, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}]], initial=1, aps=[p1:(AND (EQ s43 1) (EQ s259 1)), p0:(AND (EQ s160 1) (EQ s161 1) (EQ s162 1) (EQ s599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 699 ms.
Product exploration explored 100000 steps with 33333 reset in 715 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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 11 factoid took 1494 ms. Reduced automaton from 9 states, 20 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r11-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-03 finished in 20346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(F(p2)&&F(p0))))))'
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.5 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 47 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:21:21] [INFO ] Computed 436 place invariants in 283 ms
[2022-05-16 02:21:25] [INFO ] Implicit Places using invariants in 4057 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4070 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 36 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 672 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s51 1) (EQ s294 1)), p2:(OR (EQ s113 0) (EQ s526 0)), p0:(AND (EQ s14 1) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 309 steps with 1 reset in 5 ms.
FORMULA Echo-PT-d02r11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-04 finished in 4873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(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.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 64 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:21:26] [INFO ] Computed 436 place invariants in 246 ms
[2022-05-16 02:21:30] [INFO ] Implicit Places using invariants in 4653 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4666 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 50 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 785 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s368 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 414 reset in 804 ms.
Product exploration explored 100000 steps with 414 reset in 920 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 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r11-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-05 finished in 7707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G((F(G(p0))||F(p1)||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 27 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:21:33] [INFO ] Computed 436 place invariants in 244 ms
[2022-05-16 02:21:37] [INFO ] Implicit Places using invariants in 3795 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3817 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 2 iterations. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-06 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 s135 1) (EQ s136 1) (EQ s137 1) (EQ s566 1)), p1:(AND (EQ s53 1) (EQ s300 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 240 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-06 finished in 3976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||(X(X(X(F(X(p1))))) U p2)))'
Support contains 8 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 13 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:37] [INFO ] Computed 440 place invariants in 292 ms
[2022-05-16 02:21:41] [INFO ] Implicit Places using invariants in 3655 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:41] [INFO ] Computed 440 place invariants in 235 ms
[2022-05-16 02:21:52] [INFO ] Implicit Places using invariants and state equation in 11350 ms returned []
Implicit Place search using SMT with State Equation took 15028 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:52] [INFO ] Computed 440 place invariants in 208 ms
[2022-05-16 02:21:54] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (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-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 7}, { cond=p2, acceptance={} source=1 dest: 8}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND p2 p0), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 3}]], initial=2, aps=[p1:(AND (EQ s327 1) (EQ s329 1) (EQ s330 1) (EQ s768 1)), p2:(AND (EQ s92 1) (EQ s450 1)), p0:(AND (EQ s119 1) (EQ s554 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, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-07 finished in 17309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((G(p1)||p0))||X(p2)))))'
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 18 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:55] [INFO ] Computed 440 place invariants in 204 ms
[2022-05-16 02:21:58] [INFO ] Implicit Places using invariants in 3722 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:21:58] [INFO ] Computed 440 place invariants in 235 ms
[2022-05-16 02:22:41] [INFO ] Performed 197/998 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2022-05-16 02:22:50] [INFO ] Implicit Places using invariants and state equation in 52108 ms returned []
Implicit Place search using SMT with State Equation took 55851 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:22:50] [INFO ] Computed 440 place invariants in 195 ms
[2022-05-16 02:22:52] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 898 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=5, aps=[p2:(AND (EQ s105 1) (EQ s499 1)), p0:(OR (EQ s78 0) (EQ s393 0) (EQ s105 0) (EQ s499 0)), p1:(OR (EQ s27 0) (EQ s205 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 533 steps with 2 reset in 9 ms.
FORMULA Echo-PT-d02r11-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-09 finished in 58628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 9 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
[2022-05-16 02:22:53] [INFO ] Computed 440 place invariants in 198 ms
[2022-05-16 02:22:57] [INFO ] Implicit Places using invariants in 4196 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:22:57] [INFO ] Computed 440 place invariants in 213 ms
[2022-05-16 02:24:50] [INFO ] Performed 599/998 implicitness test of which 0 returned IMPLICIT in 112 seconds.
[2022-05-16 02:24:51] [INFO ] Implicit Places using invariants and state equation in 113953 ms returned []
Implicit Place search using SMT with State Equation took 118152 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:24:51] [INFO ] Computed 440 place invariants in 230 ms
[2022-05-16 02:24:53] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s208 1) (EQ s209 1) (EQ s647 1) (OR (AND (EQ s14 1) (EQ s168 1)) (AND (EQ s530 1) (EQ s531 1) (EQ s532 1) (EQ s965 1)))), p0:(AND (EQ s14 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 242 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-10 finished in 120200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(p0)||(G(p1)&&X(G(p2))))))))'
Support contains 10 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.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 32 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:24:53] [INFO ] Computed 436 place invariants in 285 ms
[2022-05-16 02:24:57] [INFO ] Implicit Places using invariants in 4025 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4028 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 2 iterations. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={2} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={1, 2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s111 1) (EQ s519 1)), p1:(OR (EQ s540 0) (EQ s541 0) (EQ s543 0) (EQ s978 0)), p2:(OR (EQ s350 0) (EQ s351 0) (EQ s353 0) (EQ s784 0))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 414 reset in 865 ms.
Product exploration explored 100000 steps with 414 reset in 1030 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 : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1307 ms. Reduced automaton from 3 states, 18 edges and 3 AP to 3 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:25:02] [INFO ] Computed 432 place invariants in 240 ms
[2022-05-16 02:25:03] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 829 ms returned sat
[2022-05-16 02:25:14] [INFO ] After 11952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 988 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 988/988 places, 872/872 transitions.
Graph (complete) has 2892 edges and 988 vertex of which 984 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 984 transition count 868
Applied a total of 5 rules in 31 ms. Remains 984 /988 variables (removed 4) and now considering 868/872 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/988 places, 868/872 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 580506 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 580506 steps, saw 112989 distinct states, run finished after 3003 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 868 rows 984 cols
[2022-05-16 02:25:17] [INFO ] Computed 428 place invariants in 294 ms
[2022-05-16 02:25:18] [INFO ] [Real]Absence check using 0 positive and 428 generalized place invariants in 542 ms returned sat
[2022-05-16 02:25:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 02:25:42] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 984 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 984/984 places, 868/868 transitions.
Applied a total of 0 rules in 42 ms. Remains 984 /984 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/984 places, 868/868 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 984/984 places, 868/868 transitions.
Applied a total of 0 rules in 44 ms. Remains 984 /984 variables (removed 0) and now considering 868/868 (removed 0) transitions.
// Phase 1: matrix 868 rows 984 cols
[2022-05-16 02:25:42] [INFO ] Computed 428 place invariants in 291 ms
[2022-05-16 02:25:45] [INFO ] Implicit Places using invariants in 3319 ms returned []
// Phase 1: matrix 868 rows 984 cols
[2022-05-16 02:25:46] [INFO ] Computed 428 place invariants in 321 ms
[2022-05-16 02:25:49] [INFO ] Implicit Places using invariants and state equation in 3879 ms returned []
Implicit Place search using SMT with State Equation took 7219 ms to find 0 implicit places.
[2022-05-16 02:25:49] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 868 rows 984 cols
[2022-05-16 02:25:50] [INFO ] Computed 428 place invariants in 306 ms
[2022-05-16 02:25:51] [INFO ] Dead Transitions using invariants and state equation in 1962 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 984/984 places, 868/868 transitions.
Applied a total of 0 rules in 20 ms. Remains 984 /984 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 868 rows 984 cols
[2022-05-16 02:25:52] [INFO ] Computed 428 place invariants in 303 ms
[2022-05-16 02:25:52] [INFO ] [Real]Absence check using 0 positive and 428 generalized place invariants in 542 ms returned sat
[2022-05-16 02:29:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 02:29:37] [INFO ] After 225033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
[2022-05-16 02:29:37] [INFO ] Flatten gal took : 66 ms
[2022-05-16 02:29:37] [INFO ] Flatten gal took : 69 ms
[2022-05-16 02:29:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8983787522818221725.gal : 31 ms
[2022-05-16 02:29:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4739473618591076903.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16156856997071697487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8983787522818221725.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4739473618591076903.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4739473618591076903.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 77
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :77 after 168
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :168 after 1100
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1100 after 2329
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2329 after 4297
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4297 after 75156
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :75156 after 255817
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :255817 after 1.29714e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.29714e+06 after 2.02624e+06
Detected timeout of ITS tools.
[2022-05-16 02:29:52] [INFO ] Flatten gal took : 47 ms
[2022-05-16 02:29:52] [INFO ] Applying decomposition
[2022-05-16 02:29:52] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2354863138854695462.txt' '-o' '/tmp/graph2354863138854695462.bin' '-w' '/tmp/graph2354863138854695462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2354863138854695462.bin' '-l' '-1' '-v' '-w' '/tmp/graph2354863138854695462.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:29:52] [INFO ] Decomposing Gal with order
[2022-05-16 02:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:29:53] [INFO ] Removed a total of 950 redundant transitions.
[2022-05-16 02:29:53] [INFO ] Flatten gal took : 160 ms
[2022-05-16 02:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 48 ms.
[2022-05-16 02:29:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6681929773766041517.gal : 19 ms
[2022-05-16 02:29:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17141719535365047779.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16156856997071697487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6681929773766041517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17141719535365047779.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality17141719535365047779.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2 after 4.03e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12508247405533916081
[2022-05-16 02:30:08] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12508247405533916081
Running compilation step : cd /tmp/ltsmin12508247405533916081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1745 ms.
Running link step : cd /tmp/ltsmin12508247405533916081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12508247405533916081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf4==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 24 factoid took 1380 ms. Reduced automaton from 3 states, 18 edges and 3 AP to 3 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 10 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 27 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:30:25] [INFO ] Computed 432 place invariants in 248 ms
[2022-05-16 02:30:28] [INFO ] Implicit Places using invariants in 3527 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:30:28] [INFO ] Computed 432 place invariants in 266 ms
[2022-05-16 02:33:08] [INFO ] Performed 12/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:33:08] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:33:08] [INFO ] Implicit Places using invariants and state equation in 160296 ms returned []
Implicit Place search using SMT with State Equation took 163829 ms to find 0 implicit places.
[2022-05-16 02:33:08] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:33:09] [INFO ] Computed 432 place invariants in 264 ms
[2022-05-16 02:33:11] [INFO ] Dead Transitions using invariants and state equation in 2304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 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 : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1108 ms. Reduced automaton from 3 states, 18 edges and 3 AP to 3 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:33:13] [INFO ] Computed 432 place invariants in 251 ms
[2022-05-16 02:33:14] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 826 ms returned sat
[2022-05-16 02:33:14] [INFO ] After 1124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 02:33:15] [INFO ] [Nat]Absence check using 0 positive and 432 generalized place invariants in 786 ms returned sat
[2022-05-16 02:33:25] [INFO ] After 9788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 02:33:26] [INFO ] After 10317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 483 ms.
[2022-05-16 02:33:26] [INFO ] After 11974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 10 out of 988 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 988/988 places, 872/872 transitions.
Graph (complete) has 2892 edges and 988 vertex of which 984 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 984 transition count 868
Applied a total of 5 rules in 24 ms. Remains 984 /988 variables (removed 4) and now considering 868/872 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/988 places, 868/872 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Finished Best-First random walk after 2314 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=210 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 24 factoid took 1329 ms. Reduced automaton from 3 states, 18 edges and 3 AP to 3 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 414 reset in 860 ms.
Product exploration explored 100000 steps with 414 reset in 997 ms.
Built C files in :
/tmp/ltsmin988776132537607015
[2022-05-16 02:33:30] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:33:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:33:30] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:33:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:33:30] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:33:30] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:33:30] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin988776132537607015
Running compilation step : cd /tmp/ltsmin988776132537607015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2703 ms.
Running link step : cd /tmp/ltsmin988776132537607015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin988776132537607015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10189909909490489976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 26 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:33:45] [INFO ] Computed 432 place invariants in 258 ms
[2022-05-16 02:33:49] [INFO ] Implicit Places using invariants in 3690 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:33:49] [INFO ] Computed 432 place invariants in 247 ms
[2022-05-16 02:36:29] [INFO ] Performed 23/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:36:29] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:36:29] [INFO ] Implicit Places using invariants and state equation in 160282 ms returned []
Implicit Place search using SMT with State Equation took 163979 ms to find 0 implicit places.
[2022-05-16 02:36:29] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:36:29] [INFO ] Computed 432 place invariants in 271 ms
[2022-05-16 02:36:31] [INFO ] Dead Transitions using invariants and state equation in 2388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin6417855773315704275
[2022-05-16 02:36:31] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:36:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:36:31] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:36:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:36:31] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:36:31] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:36:31] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6417855773315704275
Running compilation step : cd /tmp/ltsmin6417855773315704275;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2670 ms.
Running link step : cd /tmp/ltsmin6417855773315704275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6417855773315704275;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5967846535055252633.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:36:46] [INFO ] Flatten gal took : 45 ms
[2022-05-16 02:36:47] [INFO ] Flatten gal took : 51 ms
[2022-05-16 02:36:47] [INFO ] Time to serialize gal into /tmp/LTL9569957962049025578.gal : 6 ms
[2022-05-16 02:36:47] [INFO ] Time to serialize properties into /tmp/LTL17501916253658294241.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9569957962049025578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17501916253658294241.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9569957...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G((G("((p1111==1)&&(p529==1))"))||((G("(((p550==0)||(p551==0))||((p553==0)||(p988==0)))"))&&(X(G("(((p352==0)||(p353==0))||((p3...184
Formula 0 simplified : !GFG(G"((p1111==1)&&(p529==1))" | (G"(((p550==0)||(p551==0))||((p553==0)||(p988==0)))" & XG"(((p352==0)||(p353==0))||((p355==0)||(p7...166
Detected timeout of ITS tools.
[2022-05-16 02:37:02] [INFO ] Flatten gal took : 41 ms
[2022-05-16 02:37:02] [INFO ] Applying decomposition
[2022-05-16 02:37:02] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2266268793213329744.txt' '-o' '/tmp/graph2266268793213329744.bin' '-w' '/tmp/graph2266268793213329744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2266268793213329744.bin' '-l' '-1' '-v' '-w' '/tmp/graph2266268793213329744.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:37:02] [INFO ] Decomposing Gal with order
[2022-05-16 02:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:37:02] [INFO ] Removed a total of 1111 redundant transitions.
[2022-05-16 02:37:02] [INFO ] Flatten gal took : 124 ms
[2022-05-16 02:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 42 ms.
[2022-05-16 02:37:02] [INFO ] Time to serialize gal into /tmp/LTL5974513123904539016.gal : 17 ms
[2022-05-16 02:37:02] [INFO ] Time to serialize properties into /tmp/LTL16818654234859965381.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5974513123904539016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16818654234859965381.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5974513...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G((G("((i2.i0.u171.p1111==1)&&(i2.i0.u36.p529==1))"))||((G("(((i0.u39.p550==0)||(i0.u39.p551==0))||((i0.u39.p553==0)||(i0.u39.p...277
Formula 0 simplified : !GFG(G"((i2.i0.u171.p1111==1)&&(i2.i0.u36.p529==1))" | (G"(((i0.u39.p550==0)||(i0.u39.p551==0))||((i0.u39.p553==0)||(i0.u39.p988==0)...259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17803575199670797336
[2022-05-16 02:37:17] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17803575199670797336
Running compilation step : cd /tmp/ltsmin17803575199670797336;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1679 ms.
Running link step : cd /tmp/ltsmin17803575199670797336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17803575199670797336;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([]((LTLAPp0==true))||([]((LTLAPp1==true))&&X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d02r11-LTLFireability-11 finished in 759115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((p0 U 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.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 24 ms. Remains 993 /998 variables (removed 5) and now considering 873/874 (removed 1) transitions.
// Phase 1: matrix 873 rows 993 cols
[2022-05-16 02:37:33] [INFO ] Computed 436 place invariants in 270 ms
[2022-05-16 02:37:36] [INFO ] Implicit Places using invariants in 3774 ms returned []
// Phase 1: matrix 873 rows 993 cols
[2022-05-16 02:37:36] [INFO ] Computed 436 place invariants in 273 ms
[2022-05-16 02:40:16] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160291 ms
Implicit Place search using SMT with State Equation took 164068 ms to find 0 implicit places.
[2022-05-16 02:40:16] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 873 rows 993 cols
[2022-05-16 02:40:17] [INFO ] Computed 436 place invariants in 267 ms
[2022-05-16 02:40:18] [INFO ] Dead Transitions using invariants and state equation in 1949 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 993/998 places, 873/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 993/998 places, 873/874 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s182 1) (EQ s183 1) (EQ s617 1)), p0:(AND (EQ s376 1) (EQ s378 1) (EQ s379 1) (EQ s813 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 241 steps with 0 reset in 13 ms.
FORMULA Echo-PT-d02r11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-12 finished in 166194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(F(p1))))||p0)))'
Support contains 8 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.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:19] [INFO ] Computed 440 place invariants in 211 ms
[2022-05-16 02:40:22] [INFO ] Implicit Places using invariants in 3455 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:22] [INFO ] Computed 440 place invariants in 222 ms
[2022-05-16 02:40:33] [INFO ] Implicit Places using invariants and state equation in 11360 ms returned []
Implicit Place search using SMT with State Equation took 14829 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:34] [INFO ] Computed 440 place invariants in 235 ms
[2022-05-16 02:40:35] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s297 1) (EQ s298 1) (EQ s299 1) (EQ s740 1)) (AND (EQ s423 1) (EQ s424 1) (EQ s425 1) (EQ s862 1))), p1:(AND (EQ s423 1) (EQ s424 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d02r11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-13 finished in 16931 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(G(p0))&&p1))||p0))))'
Support contains 8 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 13 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:36] [INFO ] Computed 440 place invariants in 215 ms
[2022-05-16 02:40:40] [INFO ] Implicit Places using invariants in 4273 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:40] [INFO ] Computed 440 place invariants in 193 ms
[2022-05-16 02:40:52] [INFO ] Implicit Places using invariants and state equation in 12501 ms returned []
Implicit Place search using SMT with State Equation took 16780 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:52] [INFO ] Computed 440 place invariants in 193 ms
[2022-05-16 02:40:54] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s545 1) (EQ s547 1) (EQ s548 1) (EQ s982 1)), p1:(OR (EQ s255 0) (EQ s256 0) (EQ s257 0) (EQ s698 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 459 steps with 1 reset in 4 ms.
FORMULA Echo-PT-d02r11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-14 finished in 18825 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(p0)))||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 17 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:54] [INFO ] Computed 440 place invariants in 206 ms
[2022-05-16 02:40:58] [INFO ] Implicit Places using invariants in 3628 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:40:58] [INFO ] Computed 440 place invariants in 203 ms
[2022-05-16 02:41:08] [INFO ] Implicit Places using invariants and state equation in 10474 ms returned []
Implicit Place search using SMT with State Equation took 14113 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:41:09] [INFO ] Computed 440 place invariants in 204 ms
[2022-05-16 02:41:10] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s37 1) (EQ s236 1)), p0:(OR (EQ s36 0) (EQ s232 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 438 ms.
Product exploration explored 100000 steps with 25000 reset in 490 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 p1) p0), (X (NOT p1)), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r11-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-15 finished in 17633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(p0)||(G(p1)&&X(G(p2))))))))'
[2022-05-16 02:41:12] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17641274970346762071
[2022-05-16 02:41:12] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2022-05-16 02:41:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:41:12] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2022-05-16 02:41:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:41:12] [INFO ] Applying decomposition
[2022-05-16 02:41:12] [INFO ] Flatten gal took : 38 ms
[2022-05-16 02:41:12] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2022-05-16 02:41:12] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:41:12] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17641274970346762071
Running compilation step : cd /tmp/ltsmin17641274970346762071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph452508022200837585.txt' '-o' '/tmp/graph452508022200837585.bin' '-w' '/tmp/graph452508022200837585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph452508022200837585.bin' '-l' '-1' '-v' '-w' '/tmp/graph452508022200837585.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:41:12] [INFO ] Decomposing Gal with order
[2022-05-16 02:41:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:41:12] [INFO ] Removed a total of 1102 redundant transitions.
[2022-05-16 02:41:12] [INFO ] Flatten gal took : 76 ms
[2022-05-16 02:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 18 ms.
[2022-05-16 02:41:12] [INFO ] Time to serialize gal into /tmp/LTLFireability12907300507299674068.gal : 12 ms
[2022-05-16 02:41:12] [INFO ] Time to serialize properties into /tmp/LTLFireability3716328136034444016.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12907300507299674068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3716328136034444016.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G((G("((i10.u165.p1111==1)&&(i10.u167.p529==1))"))||((G("(((i4.i1.u37.p550==0)||(i4.i1.u37.p551==0))||((i4.i1.u37.p553==0)||(i4...285
Formula 0 simplified : !GFG(G"((i10.u165.p1111==1)&&(i10.u167.p529==1))" | (G"(((i4.i1.u37.p550==0)||(i4.i1.u37.p551==0))||((i4.i1.u37.p553==0)||(i4.i1.u37...267
Compilation finished in 2628 ms.
Running link step : cd /tmp/ltsmin17641274970346762071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17641274970346762071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([]((LTLAPp0==true))||([]((LTLAPp1==true))&&X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: LTL layer: formula: [](<>([](([]((LTLAPp0==true))||([]((LTLAPp1==true))&&X([]((LTLAPp2==true))))))))
pins2lts-mc-linux64( 0/ 8), 0.023: "[](<>([](([]((LTLAPp0==true))||([]((LTLAPp1==true))&&X([]((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.059: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.076: buchi has 8 states
pins2lts-mc-linux64( 7/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.249: There are 878 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.249: State length is 999, there are 915 groups
pins2lts-mc-linux64( 0/ 8), 0.249: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.249: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.249: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.249: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.519: [Blue] ~120 levels ~960 states ~35816 transitions
pins2lts-mc-linux64( 5/ 8), 1.622: [Blue] ~240 levels ~1920 states ~48624 transitions
pins2lts-mc-linux64( 5/ 8), 1.845: [Blue] ~243 levels ~3840 states ~53400 transitions
pins2lts-mc-linux64( 5/ 8), 2.515: [Blue] ~243 levels ~7680 states ~64928 transitions
pins2lts-mc-linux64( 5/ 8), 3.607: [Blue] ~243 levels ~15360 states ~93088 transitions
pins2lts-mc-linux64( 5/ 8), 4.547: [Blue] ~243 levels ~30720 states ~149312 transitions
pins2lts-mc-linux64( 5/ 8), 7.362: [Blue] ~243 levels ~61440 states ~287896 transitions
pins2lts-mc-linux64( 5/ 8), 9.823: [Blue] ~243 levels ~122880 states ~592688 transitions
pins2lts-mc-linux64( 5/ 8), 14.619: [Blue] ~243 levels ~245760 states ~1230376 transitions
pins2lts-mc-linux64( 1/ 8), 28.704: [Blue] ~239 levels ~491520 states ~2284816 transitions
pins2lts-mc-linux64( 1/ 8), 56.962: [Blue] ~239 levels ~983040 states ~5093320 transitions
pins2lts-mc-linux64( 2/ 8), 91.366: [Blue] ~240 levels ~1966080 states ~10839720 transitions
pins2lts-mc-linux64( 2/ 8), 159.540: [Blue] ~240 levels ~3932160 states ~22918352 transitions
pins2lts-mc-linux64( 2/ 8), 296.928: [Blue] ~240 levels ~7864320 states ~49370376 transitions
pins2lts-mc-linux64( 2/ 8), 579.581: [Blue] ~240 levels ~15728640 states ~104107112 transitions
pins2lts-mc-linux64( 3/ 8), 721.285: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 721.372:
pins2lts-mc-linux64( 0/ 8), 721.372: Explored 18928625 states 132830621 transitions, fanout: 7.017
pins2lts-mc-linux64( 0/ 8), 721.372: Total exploration time 721.110 sec (721.000 sec minimum, 721.058 sec on average)
pins2lts-mc-linux64( 0/ 8), 721.372: States per second: 26249, Transitions per second: 184203
pins2lts-mc-linux64( 0/ 8), 721.372:
pins2lts-mc-linux64( 0/ 8), 721.372: State space has 18894059 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 721.372: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 721.372: blue states: 18928625 (100.18%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 721.372: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 721.372: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 721.372:
pins2lts-mc-linux64( 0/ 8), 721.372: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 721.372:
pins2lts-mc-linux64( 0/ 8), 721.372: Queue width: 8B, total height: 1921, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 721.372: Tree memory: 400.1MB, 22.2 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 721.372: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 721.372: Stored 887 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 721.372: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 721.372: Est. total memory use: 400.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17641274970346762071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([]((LTLAPp0==true))||([]((LTLAPp1==true))&&X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17641274970346762071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](([]((LTLAPp0==true))||([]((LTLAPp1==true))&&X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 03:09:41] [INFO ] Applying decomposition
[2022-05-16 03:09:43] [INFO ] Flatten gal took : 387 ms
[2022-05-16 03:09:43] [INFO ] Decomposing Gal with order
[2022-05-16 03:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:09:43] [INFO ] Removed a total of 2252 redundant transitions.
[2022-05-16 03:09:44] [INFO ] Flatten gal took : 971 ms
[2022-05-16 03:09:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 399 ms.
[2022-05-16 03:09:45] [INFO ] Time to serialize gal into /tmp/LTLFireability13643283664806452982.gal : 198 ms
[2022-05-16 03:09:45] [INFO ] Time to serialize properties into /tmp/LTLFireability10102515194503838669.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13643283664806452982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10102515194503838669.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G(F(G((G("((u123.p1111==1)&&(u486.p529==1))"))||((G("(((u506.p550==0)||(u507.p551==0))||((u509.p553==0)||(u34.p988==0)))"))&&(X(G("...232
Formula 0 simplified : !GFG(G"((u123.p1111==1)&&(u486.p529==1))" | (G"(((u506.p550==0)||(u507.p551==0))||((u509.p553==0)||(u34.p988==0)))" & XG"(((u329.p35...214

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r078-tall-165260110200380"
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 ;