Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 120K Mar 5 18:23 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 QuasiCertifProtocol-COL-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678986224804

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 17:03:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 17:03:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:03:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 17:03:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 17:03:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2023-03-16 17:03:46] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 17:03:46] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-16 17:03:46] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10013 steps, including 258 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 17:03:47] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-16 17:03:47] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-16 17:03:47] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:3
[2023-03-16 17:03:47] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-16 17:03:47] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-16 17:03:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 44 ms returned sat
[2023-03-16 17:03:48] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-16 17:03:48] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 17:03:48] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 120 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 6 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-16 17:03:48] [INFO ] Flatten gal took : 29 ms
[2023-03-16 17:03:48] [INFO ] Flatten gal took : 5 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2023-03-16 17:03:48] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 28 ms.
[2023-03-16 17:03:48] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Support contains 2819 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 33 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:03:48] [INFO ] Computed 2492 place invariants in 179 ms
[2023-03-16 17:03:49] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2023-03-16 17:03:49] [INFO ] Invariant cache hit.
[2023-03-16 17:03:51] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2914 ms to find 0 implicit places.
[2023-03-16 17:03:51] [INFO ] Invariant cache hit.
[2023-03-16 17:03:52] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4099 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2819 out of 2936 places after structural reductions.
[2023-03-16 17:03:52] [INFO ] Flatten gal took : 191 ms
[2023-03-16 17:03:53] [INFO ] Flatten gal took : 130 ms
[2023-03-16 17:03:53] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-16 17:03:55] [INFO ] Invariant cache hit.
[2023-03-16 17:03:57] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 541 ms returned sat
[2023-03-16 17:03:57] [INFO ] After 1528ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-16 17:03:58] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 518 ms returned sat
[2023-03-16 17:04:07] [INFO ] After 7556ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-03-16 17:04:22] [INFO ] After 22922ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 17:04:22] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 14 Parikh solutions to 10 different solutions.
Finished Parikh walk after 150 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=25 )
Parikh walk visited 13 properties in 27 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.37 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 652 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 17:04:23] [INFO ] Computed 2464 place invariants in 98 ms
[2023-03-16 17:04:27] [INFO ] Implicit Places using invariants in 4089 ms returned []
[2023-03-16 17:04:27] [INFO ] Invariant cache hit.
[2023-03-16 17:04:34] [INFO ] Implicit Places using invariants and state equation in 7047 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11147 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 276 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12077 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 902 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s2768 1) (GEQ s2769 1) (GEQ s2766 1) (GEQ s2767 1) (GEQ s2772 1) (GEQ s2773 1) (GEQ s2770 1) (GEQ s2771 1) (GEQ s2760 1) (GEQ s2761 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-01 finished in 13039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 900 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2934 transition count 444
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2934 transition count 444
Applied a total of 3 rules in 296 ms. Remains 2934 /2936 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2934 cols
[2023-03-16 17:04:36] [INFO ] Computed 2492 place invariants in 59 ms
[2023-03-16 17:04:39] [INFO ] Implicit Places using invariants in 2790 ms returned []
[2023-03-16 17:04:39] [INFO ] Invariant cache hit.
[2023-03-16 17:04:43] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned [2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7074 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2876/2936 places, 444/446 transitions.
Applied a total of 0 rules in 95 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7467 ms. Remains : 2876/2936 places, 444/446 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ 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:(AND (GEQ s2524 1) (GEQ s2525 1) (GEQ s2526 1) (GEQ s2527 1) (GEQ s2528 1) (GEQ s2529 1) (GEQ s2530 1) (GEQ s2531 1) (GEQ s2532 1) (GEQ s2533 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 69 steps with 1 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-02 finished in 7674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(!p0)))) U G(p1)))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 140 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:04:43] [INFO ] Computed 2492 place invariants in 46 ms
[2023-03-16 17:04:48] [INFO ] Implicit Places using invariants in 4406 ms returned []
[2023-03-16 17:04:48] [INFO ] Invariant cache hit.
[2023-03-16 17:04:55] [INFO ] Implicit Places using invariants and state equation in 7421 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11838 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 168 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12146 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 650 ms :[(NOT p1), p0, (AND p0 (NOT p1)), p0, p0, true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s2726 1)) (AND (GEQ s0 1) (GEQ s2725 1)) (AND (GEQ s0 1) (GEQ s2722 1)) (AND (GEQ s0 1) (GEQ s2721 1)) (AND (GEQ s0 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 3021 reset in 634 ms.
Product exploration explored 100000 steps with 3025 reset in 579 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND p1 p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 511826 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 511826 steps, saw 84624 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 17:05:02] [INFO ] Computed 2464 place invariants in 282 ms
[2023-03-16 17:05:03] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 512 ms returned sat
[2023-03-16 17:05:03] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:05:04] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 478 ms returned sat
[2023-03-16 17:05:11] [INFO ] After 8463ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-03 finished in 28360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:05:12] [INFO ] Computed 2492 place invariants in 86 ms
[2023-03-16 17:05:16] [INFO ] Implicit Places using invariants in 4518 ms returned []
[2023-03-16 17:05:16] [INFO ] Invariant cache hit.
[2023-03-16 17:05:24] [INFO ] Implicit Places using invariants and state equation in 7647 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12173 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 142 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12466 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s2905 1), p0:(OR (AND (GEQ s0 1) (GEQ s2842 1)) (AND (GEQ s0 1) (GEQ s2841 1)) (AND (GEQ s0 1) (GEQ s2840 1)) (AND (GEQ s0 1) (GEQ s2839 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7463 reset in 606 ms.
Product exploration explored 100000 steps with 7406 reset in 574 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 447 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 501 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 17:05:27] [INFO ] Computed 2464 place invariants in 262 ms
[2023-03-16 17:05:32] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 3833 ms returned sat
[2023-03-16 17:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:05:42] [INFO ] [Real]Absence check using state equation in 10283 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2875 transition count 442
Applied a total of 5 rules in 331 ms. Remains 2875 /2907 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2875 cols
[2023-03-16 17:05:43] [INFO ] Computed 2436 place invariants in 299 ms
[2023-03-16 17:05:47] [INFO ] Implicit Places using invariants in 4376 ms returned []
[2023-03-16 17:05:47] [INFO ] Invariant cache hit.
[2023-03-16 17:05:55] [INFO ] Implicit Places using invariants and state equation in 7946 ms returned []
Implicit Place search using SMT with State Equation took 12325 ms to find 0 implicit places.
[2023-03-16 17:05:55] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-16 17:05:55] [INFO ] Invariant cache hit.
[2023-03-16 17:05:56] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2875/2907 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13800 ms. Remains : 2875/2907 places, 442/446 transitions.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1)]
[2023-03-16 17:05:57] [INFO ] Invariant cache hit.
[2023-03-16 17:06:01] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3579 ms returned sat
[2023-03-16 17:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:06:12] [INFO ] [Real]Absence check using state equation in 10549 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7418 reset in 524 ms.
Product exploration explored 100000 steps with 7474 reset in 551 ms.
Built C files in :
/tmp/ltsmin18438348579409407736
[2023-03-16 17:06:13] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2023-03-16 17:06:13] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:06:13] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2023-03-16 17:06:13] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:06:13] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2023-03-16 17:06:13] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:06:13] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18438348579409407736
Running compilation step : cd /tmp/ltsmin18438348579409407736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2242 ms.
Running link step : cd /tmp/ltsmin18438348579409407736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin18438348579409407736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased460407079787317810.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 2875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Graph (complete) has 29901 edges and 2875 vertex of which 90 are kept as prefixes of interest. Removing 2785 places using SCC suffix rule.10 ms
Discarding 2785 places :
Also discarding 206 output transitions
Drop transitions removed 206 transitions
Ensure Unique test removed 174 transitions
Reduce isomorphic transitions removed 174 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 90 transition count 62
Applied a total of 175 rules in 15 ms. Remains 90 /2875 variables (removed 2785) and now considering 62/442 (removed 380) transitions.
// Phase 1: matrix 62 rows 90 cols
[2023-03-16 17:06:28] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-16 17:06:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-16 17:06:28] [INFO ] Invariant cache hit.
[2023-03-16 17:06:28] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-16 17:06:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:06:28] [INFO ] Invariant cache hit.
[2023-03-16 17:06:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/2875 places, 62/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 90/2875 places, 62/442 transitions.
Built C files in :
/tmp/ltsmin6720687488239467659
[2023-03-16 17:06:28] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2023-03-16 17:06:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:06:28] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2023-03-16 17:06:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:06:28] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2023-03-16 17:06:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:06:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6720687488239467659
Running compilation step : cd /tmp/ltsmin6720687488239467659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin6720687488239467659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6720687488239467659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5172160144081426943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:06:44] [INFO ] Flatten gal took : 4 ms
[2023-03-16 17:06:44] [INFO ] Flatten gal took : 3 ms
[2023-03-16 17:06:44] [INFO ] Time to serialize gal into /tmp/LTL14054205260560784838.gal : 1 ms
[2023-03-16 17:06:44] [INFO ] Time to serialize properties into /tmp/LTL11408688497818198893.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14054205260560784838.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1707975871096565522.hoa' '-atoms' '/tmp/LTL11408688497818198893.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11408688497818198893.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1707975871096565522.hoa
Detected timeout of ITS tools.
[2023-03-16 17:06:59] [INFO ] Flatten gal took : 70 ms
[2023-03-16 17:06:59] [INFO ] Flatten gal took : 66 ms
[2023-03-16 17:06:59] [INFO ] Time to serialize gal into /tmp/LTL2793349416859717246.gal : 12 ms
[2023-03-16 17:06:59] [INFO ] Time to serialize properties into /tmp/LTL4855779445807411545.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2793349416859717246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4855779445807411545.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((malicious_reservoir_0>=1)&&(s4_28>=1))||((malicious_reservoir_0>=1)&&(s4_27>=1)))||(((malicious_reservoir_0>=1)&&(s4_26>...1316
Formula 0 simplified : F!"(((((((malicious_reservoir_0>=1)&&(s4_28>=1))||((malicious_reservoir_0>=1)&&(s4_27>=1)))||(((malicious_reservoir_0>=1)&&(s4_26>=1...1306
Detected timeout of ITS tools.
[2023-03-16 17:07:14] [INFO ] Flatten gal took : 70 ms
[2023-03-16 17:07:14] [INFO ] Applying decomposition
[2023-03-16 17:07:14] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7175150243862619620.txt' '-o' '/tmp/graph7175150243862619620.bin' '-w' '/tmp/graph7175150243862619620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7175150243862619620.bin' '-l' '-1' '-v' '-w' '/tmp/graph7175150243862619620.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:07:14] [INFO ] Decomposing Gal with order
[2023-03-16 17:07:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:07:15] [INFO ] Removed a total of 319 redundant transitions.
[2023-03-16 17:07:15] [INFO ] Flatten gal took : 379 ms
[2023-03-16 17:07:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 123 ms.
[2023-03-16 17:07:15] [INFO ] Time to serialize gal into /tmp/LTL236492307897365719.gal : 23 ms
[2023-03-16 17:07:15] [INFO ] Time to serialize properties into /tmp/LTL17649107502801990511.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL236492307897365719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17649107502801990511.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((u0.malicious_reservoir_0>=1)&&(i23.u114.s4_28>=1))||((u0.malicious_reservoir_0>=1)&&(i13.u113.s4_27>=1)))||(((u0.malicio...1643
Formula 0 simplified : F!"(((((((u0.malicious_reservoir_0>=1)&&(i23.u114.s4_28>=1))||((u0.malicious_reservoir_0>=1)&&(i13.u113.s4_27>=1)))||(((u0.malicious...1633
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17422572616798331376
[2023-03-16 17:07:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17422572616798331376
Running compilation step : cd /tmp/ltsmin17422572616798331376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1806 ms.
Running link step : cd /tmp/ltsmin17422572616798331376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17422572616798331376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-04 finished in 153889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.13 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2904 transition count 442
Applied a total of 4 rules in 633 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-16 17:07:46] [INFO ] Computed 2464 place invariants in 49 ms
[2023-03-16 17:07:50] [INFO ] Implicit Places using invariants in 4218 ms returned []
[2023-03-16 17:07:50] [INFO ] Invariant cache hit.
[2023-03-16 17:07:57] [INFO ] Implicit Places using invariants and state equation in 7088 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11312 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 171 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12117 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 702 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s2592 1) (LT s2708 1)) (OR (LT s2587 1) (LT s2703 1)) (OR (LT s2591 1) (LT s2707 1)) (OR (LT s2593 1) (LT s2709 1)) (OR (LT s2597 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5150 reset in 679 ms.
Product exploration explored 100000 steps with 5174 reset in 675 ms.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
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 p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 280 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 2846 cols
[2023-03-16 17:08:01] [INFO ] Computed 2408 place invariants in 525 ms
[2023-03-16 17:08:02] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 463 ms returned sat
[2023-03-16 17:08:02] [INFO ] After 818ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:08:03] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 469 ms returned sat
[2023-03-16 17:08:04] [INFO ] After 1013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 17:08:04] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-16 17:08:04] [INFO ] After 2042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-16 17:08:05] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 20628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(!p1 U (p2||G(!p1)))))))'
Support contains 929 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 69 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:08:06] [INFO ] Computed 2492 place invariants in 53 ms
[2023-03-16 17:08:09] [INFO ] Implicit Places using invariants in 3354 ms returned []
[2023-03-16 17:08:09] [INFO ] Invariant cache hit.
[2023-03-16 17:08:16] [INFO ] Implicit Places using invariants and state equation in 6774 ms returned []
Implicit Place search using SMT with State Equation took 10180 ms to find 0 implicit places.
[2023-03-16 17:08:16] [INFO ] Invariant cache hit.
[2023-03-16 17:08:17] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11338 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s1691 1) (GEQ s1720 1) (GEQ s1749 1) (GEQ s1778 1) (GEQ s1807 1) (GEQ s1836 1) (GEQ s1865 1) (GEQ s1894 1) (GEQ s1923 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-06 finished in 11580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.8 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 316 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 17:08:18] [INFO ] Computed 2464 place invariants in 45 ms
[2023-03-16 17:08:22] [INFO ] Implicit Places using invariants in 4093 ms returned []
[2023-03-16 17:08:22] [INFO ] Invariant cache hit.
[2023-03-16 17:08:29] [INFO ] Implicit Places using invariants and state equation in 6840 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 10957 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 177 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11451 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s2668 1)) (AND (GEQ s0 1) (GEQ s2667 1)) (AND (GEQ s0 1) (GEQ s2664 1)) (AND (GEQ s0 1) (GEQ s2663 1)) (AND (GEQ s0 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-07 finished in 11594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)||G(!p1)||X(!p2)))'
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 140 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:08:29] [INFO ] Computed 2492 place invariants in 52 ms
[2023-03-16 17:08:33] [INFO ] Implicit Places using invariants in 4046 ms returned []
[2023-03-16 17:08:33] [INFO ] Invariant cache hit.
[2023-03-16 17:08:40] [INFO ] Implicit Places using invariants and state equation in 7136 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11194 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 142 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11477 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND p0 p2), p0, (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (OR (LT s2621 1) (LT s2766 1)) (OR (LT s2616 1) (LT s2761 1)) (OR (LT s2620 1) (LT s2765 1)) (OR (LT s2622 1) (LT s2767 1)) (OR (LT s2626 1) (LT s...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2726 ms.
Product exploration explored 100000 steps with 50000 reset in 2743 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1 p2))), (X (X p0)), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p2)))
Knowledge based reduction with 8 factoid took 232 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-08 finished in 17885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 58 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 17:08:47] [INFO ] Invariant cache hit.
[2023-03-16 17:08:51] [INFO ] Implicit Places using invariants in 3998 ms returned []
[2023-03-16 17:08:51] [INFO ] Invariant cache hit.
[2023-03-16 17:09:00] [INFO ] Implicit Places using invariants and state equation in 8555 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12585 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 131 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12865 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s2621 1) (LT s2766 1)) (OR (LT s2616 1) (LT s2761 1)) (OR (LT s2620 1) (LT s2765 1)) (OR (LT s2622 1) (LT s2767 1)) (OR (LT s2626 1) (LT s...], 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 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-09 finished in 12972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 58 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 171 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 17:09:00] [INFO ] Invariant cache hit.
[2023-03-16 17:09:04] [INFO ] Implicit Places using invariants in 3978 ms returned []
[2023-03-16 17:09:04] [INFO ] Invariant cache hit.
[2023-03-16 17:09:13] [INFO ] Implicit Places using invariants and state equation in 8794 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12776 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 134 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13081 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s2621 1) (LT s2766 1)) (OR (LT s2616 1) (LT s2761 1)) (OR (LT s2620 1) (LT s2765 1)) (OR (LT s2622 1) (LT s2767 1)) (OR (LT s2626 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3028 reset in 490 ms.
Product exploration explored 100000 steps with 3025 reset in 523 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1427 steps, run visited all 1 properties in 8 ms. (steps per millisecond=178 )
Probabilistic random walk after 1427 steps, saw 1398 distinct states, run finished after 8 ms. (steps per millisecond=178 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 58 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 135 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 17:09:16] [INFO ] Computed 2464 place invariants in 253 ms
[2023-03-16 17:09:20] [INFO ] Implicit Places using invariants in 4509 ms returned []
[2023-03-16 17:09:20] [INFO ] Invariant cache hit.
[2023-03-16 17:09:28] [INFO ] Implicit Places using invariants and state equation in 8212 ms returned []
Implicit Place search using SMT with State Equation took 12730 ms to find 0 implicit places.
[2023-03-16 17:09:28] [INFO ] Invariant cache hit.
[2023-03-16 17:09:29] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13920 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1427 steps, run visited all 1 properties in 8 ms. (steps per millisecond=178 )
Probabilistic random walk after 1427 steps, saw 1398 distinct states, run finished after 8 ms. (steps per millisecond=178 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3024 reset in 493 ms.
Product exploration explored 100000 steps with 3026 reset in 513 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 58 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2877 transition count 445
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 441 ms. Remains 2877 /2907 variables (removed 30) and now considering 445/446 (removed 1) transitions.
[2023-03-16 17:09:32] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 445 rows 2877 cols
[2023-03-16 17:09:33] [INFO ] Computed 2436 place invariants in 393 ms
[2023-03-16 17:09:34] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2907 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1888 ms. Remains : 2877/2907 places, 445/446 transitions.
Built C files in :
/tmp/ltsmin1432150516821359756
[2023-03-16 17:09:34] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1432150516821359756
Running compilation step : cd /tmp/ltsmin1432150516821359756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1899 ms.
Running link step : cd /tmp/ltsmin1432150516821359756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1432150516821359756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11351420714504752285.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 58 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 141 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 17:09:49] [INFO ] Computed 2464 place invariants in 251 ms
[2023-03-16 17:09:54] [INFO ] Implicit Places using invariants in 4598 ms returned []
[2023-03-16 17:09:54] [INFO ] Invariant cache hit.
[2023-03-16 17:10:02] [INFO ] Implicit Places using invariants and state equation in 7975 ms returned []
Implicit Place search using SMT with State Equation took 12578 ms to find 0 implicit places.
[2023-03-16 17:10:02] [INFO ] Invariant cache hit.
[2023-03-16 17:10:03] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13800 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin11365817879394206257
[2023-03-16 17:10:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11365817879394206257
Running compilation step : cd /tmp/ltsmin11365817879394206257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1811 ms.
Running link step : cd /tmp/ltsmin11365817879394206257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11365817879394206257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6189257432229670443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:10:18] [INFO ] Flatten gal took : 65 ms
[2023-03-16 17:10:18] [INFO ] Flatten gal took : 64 ms
[2023-03-16 17:10:18] [INFO ] Time to serialize gal into /tmp/LTL14054803650701167011.gal : 8 ms
[2023-03-16 17:10:18] [INFO ] Time to serialize properties into /tmp/LTL4709400049261657446.prop : 213 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14054803650701167011.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12774026550129276576.hoa' '-atoms' '/tmp/LTL4709400049261657446.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4709400049261657446.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12774026550129276576.hoa
Detected timeout of ITS tools.
[2023-03-16 17:10:34] [INFO ] Flatten gal took : 61 ms
[2023-03-16 17:10:34] [INFO ] Flatten gal took : 58 ms
[2023-03-16 17:10:34] [INFO ] Time to serialize gal into /tmp/LTL15320349501345883838.gal : 8 ms
[2023-03-16 17:10:34] [INFO ] Time to serialize properties into /tmp/LTL17530525153917397486.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15320349501345883838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17530525153917397486.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((n3_10<1)||(s2_10<1))&&((n3_5<1)||(s2_5<1)))&&(((n3_9<1)||(s2_9<1))&&((n3_11<1)||(s2_11<1))))&&((((n3_15<1)||(s2_15<1))&...764
Formula 0 simplified : XF!"(((((((n3_10<1)||(s2_10<1))&&((n3_5<1)||(s2_5<1)))&&(((n3_9<1)||(s2_9<1))&&((n3_11<1)||(s2_11<1))))&&((((n3_15<1)||(s2_15<1))&&(...758
Detected timeout of ITS tools.
[2023-03-16 17:10:49] [INFO ] Flatten gal took : 57 ms
[2023-03-16 17:10:49] [INFO ] Applying decomposition
[2023-03-16 17:10:49] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10781069446581162060.txt' '-o' '/tmp/graph10781069446581162060.bin' '-w' '/tmp/graph10781069446581162060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10781069446581162060.bin' '-l' '-1' '-v' '-w' '/tmp/graph10781069446581162060.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:10:49] [INFO ] Decomposing Gal with order
[2023-03-16 17:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:10:49] [INFO ] Removed a total of 288 redundant transitions.
[2023-03-16 17:10:49] [INFO ] Flatten gal took : 198 ms
[2023-03-16 17:10:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 96 ms.
[2023-03-16 17:10:49] [INFO ] Time to serialize gal into /tmp/LTL5122616029739832185.gal : 17 ms
[2023-03-16 17:10:49] [INFO ] Time to serialize properties into /tmp/LTL8454602677410597396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5122616029739832185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8454602677410597396.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((i12.u38.n3_10<1)||(i12.u106.s2_10<1))&&((i27.i0.u35.n3_5<1)||(i27.i0.u105.s2_5<1)))&&(((i3.i1.u50.n3_9<1)||(i3.i1.u91.s...1329
Formula 0 simplified : XF!"(((((((i12.u38.n3_10<1)||(i12.u106.s2_10<1))&&((i27.i0.u35.n3_5<1)||(i27.i0.u105.s2_5<1)))&&(((i3.i1.u50.n3_9<1)||(i3.i1.u91.s2_...1323
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13593839199793103564
[2023-03-16 17:11:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13593839199793103564
Running compilation step : cd /tmp/ltsmin13593839199793103564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1702 ms.
Running link step : cd /tmp/ltsmin13593839199793103564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13593839199793103564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-12 finished in 139569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1770 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.11 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 87 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 17:11:20] [INFO ] Computed 2464 place invariants in 51 ms
[2023-03-16 17:11:22] [INFO ] Implicit Places using invariants in 2435 ms returned []
[2023-03-16 17:11:22] [INFO ] Invariant cache hit.
[2023-03-16 17:11:26] [INFO ] Implicit Places using invariants and state equation in 4335 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 6777 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2874/2936 places, 441/446 transitions.
Applied a total of 0 rules in 47 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6912 ms. Remains : 2874/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1) (GEQ s302 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-13 finished in 7000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 180 are kept as prefixes of interest. Removing 2756 places using SCC suffix rule.9 ms
Discarding 2756 places :
Also discarding 176 output transitions
Drop transitions removed 176 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 179 transition count 124
Applied a total of 146 rules in 20 ms. Remains 179 /2936 variables (removed 2757) and now considering 124/446 (removed 322) transitions.
// Phase 1: matrix 124 rows 179 cols
[2023-03-16 17:11:27] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-16 17:11:27] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-16 17:11:27] [INFO ] Invariant cache hit.
[2023-03-16 17:11:27] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 265 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/2936 places, 124/446 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 150/2936 places, 124/446 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s148 1), p1:(LT s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2785 reset in 306 ms.
Product exploration explored 100000 steps with 2783 reset in 330 ms.
Computed a total of 150 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 150 transition count 124
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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-14 finished in 1313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 58 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 145 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:11:28] [INFO ] Computed 2492 place invariants in 54 ms
[2023-03-16 17:11:32] [INFO ] Implicit Places using invariants in 4281 ms returned []
[2023-03-16 17:11:32] [INFO ] Invariant cache hit.
[2023-03-16 17:11:41] [INFO ] Implicit Places using invariants and state equation in 8863 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13152 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 161 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13458 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2672 1) (LT s2730 1)) (OR (LT s2688 1) (LT s2746 1)) (OR (LT s2693 1) (LT s2751 1)) (OR (LT s2677 1) (LT s2735 1)) (OR (LT s2687 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 31826 reset in 1547 ms.
Product exploration explored 100000 steps with 32026 reset in 1562 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-15 finished in 17252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-28-LTLFireability-04
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.17 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2904 transition count 442
Applied a total of 5 rules in 316 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-16 17:11:46] [INFO ] Computed 2464 place invariants in 50 ms
[2023-03-16 17:11:50] [INFO ] Implicit Places using invariants in 4196 ms returned []
[2023-03-16 17:11:50] [INFO ] Invariant cache hit.
[2023-03-16 17:11:57] [INFO ] Implicit Places using invariants and state equation in 7362 ms returned [2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11562 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2875/2936 places, 442/446 transitions.
Applied a total of 0 rules in 155 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12033 ms. Remains : 2875/2936 places, 442/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s2873 1), p0:(OR (AND (GEQ s0 1) (GEQ s2813 1)) (AND (GEQ s0 1) (GEQ s2812 1)) (AND (GEQ s0 1) (GEQ s2811 1)) (AND (GEQ s0 1) (GEQ s2810 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7412 reset in 542 ms.
Product exploration explored 100000 steps with 7435 reset in 551 ms.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
// Phase 1: matrix 442 rows 2875 cols
[2023-03-16 17:12:00] [INFO ] Computed 2436 place invariants in 273 ms
[2023-03-16 17:12:04] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3338 ms returned sat
[2023-03-16 17:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:12:15] [INFO ] [Real]Absence check using state equation in 10806 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2875 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Applied a total of 0 rules in 147 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 17:12:15] [INFO ] Invariant cache hit.
[2023-03-16 17:12:19] [INFO ] Implicit Places using invariants in 4048 ms returned []
[2023-03-16 17:12:19] [INFO ] Invariant cache hit.
[2023-03-16 17:12:27] [INFO ] Implicit Places using invariants and state equation in 7728 ms returned []
Implicit Place search using SMT with State Equation took 11787 ms to find 0 implicit places.
[2023-03-16 17:12:27] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 17:12:27] [INFO ] Invariant cache hit.
[2023-03-16 17:12:28] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13018 ms. Remains : 2875/2875 places, 442/442 transitions.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 522 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2023-03-16 17:12:29] [INFO ] Invariant cache hit.
[2023-03-16 17:12:33] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3253 ms returned sat
[2023-03-16 17:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:12:44] [INFO ] [Real]Absence check using state equation in 10896 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7400 reset in 519 ms.
Product exploration explored 100000 steps with 7456 reset in 534 ms.
Built C files in :
/tmp/ltsmin11910301768184207172
[2023-03-16 17:12:45] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2023-03-16 17:12:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:12:45] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2023-03-16 17:12:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:12:45] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2023-03-16 17:12:45] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:12:45] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11910301768184207172
Running compilation step : cd /tmp/ltsmin11910301768184207172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2056 ms.
Running link step : cd /tmp/ltsmin11910301768184207172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11910301768184207172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9841953610513504149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 2875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Graph (complete) has 29901 edges and 2875 vertex of which 90 are kept as prefixes of interest. Removing 2785 places using SCC suffix rule.8 ms
Discarding 2785 places :
Also discarding 206 output transitions
Drop transitions removed 206 transitions
Ensure Unique test removed 174 transitions
Reduce isomorphic transitions removed 174 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 90 transition count 62
Applied a total of 175 rules in 15 ms. Remains 90 /2875 variables (removed 2785) and now considering 62/442 (removed 380) transitions.
// Phase 1: matrix 62 rows 90 cols
[2023-03-16 17:13:00] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-16 17:13:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-16 17:13:00] [INFO ] Invariant cache hit.
[2023-03-16 17:13:01] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-16 17:13:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 17:13:01] [INFO ] Invariant cache hit.
[2023-03-16 17:13:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/2875 places, 62/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 90/2875 places, 62/442 transitions.
Built C files in :
/tmp/ltsmin16904136075809990317
[2023-03-16 17:13:01] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2023-03-16 17:13:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:13:01] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2023-03-16 17:13:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:13:01] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2023-03-16 17:13:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:13:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16904136075809990317
Running compilation step : cd /tmp/ltsmin16904136075809990317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin16904136075809990317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16904136075809990317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8594745147038326820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:13:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 17:13:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 17:13:16] [INFO ] Time to serialize gal into /tmp/LTL5590989499830641074.gal : 1 ms
[2023-03-16 17:13:16] [INFO ] Time to serialize properties into /tmp/LTL6071294346403695943.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5590989499830641074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16188551543220550219.hoa' '-atoms' '/tmp/LTL6071294346403695943.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6071294346403695943.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16188551543220550219.hoa
Detected timeout of ITS tools.
[2023-03-16 17:13:31] [INFO ] Flatten gal took : 56 ms
[2023-03-16 17:13:31] [INFO ] Flatten gal took : 56 ms
[2023-03-16 17:13:31] [INFO ] Time to serialize gal into /tmp/LTL17736276063476536814.gal : 7 ms
[2023-03-16 17:13:31] [INFO ] Time to serialize properties into /tmp/LTL1555012480762818870.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17736276063476536814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1555012480762818870.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((malicious_reservoir_0>=1)&&(s4_28>=1))||((malicious_reservoir_0>=1)&&(s4_27>=1)))||(((malicious_reservoir_0>=1)&&(s4_26>...1316
Formula 0 simplified : F!"(((((((malicious_reservoir_0>=1)&&(s4_28>=1))||((malicious_reservoir_0>=1)&&(s4_27>=1)))||(((malicious_reservoir_0>=1)&&(s4_26>=1...1306
Detected timeout of ITS tools.
[2023-03-16 17:13:46] [INFO ] Flatten gal took : 56 ms
[2023-03-16 17:13:46] [INFO ] Applying decomposition
[2023-03-16 17:13:46] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3244938490238129070.txt' '-o' '/tmp/graph3244938490238129070.bin' '-w' '/tmp/graph3244938490238129070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3244938490238129070.bin' '-l' '-1' '-v' '-w' '/tmp/graph3244938490238129070.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:13:46] [INFO ] Decomposing Gal with order
[2023-03-16 17:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:13:47] [INFO ] Removed a total of 319 redundant transitions.
[2023-03-16 17:13:47] [INFO ] Flatten gal took : 179 ms
[2023-03-16 17:13:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 50 ms.
[2023-03-16 17:13:47] [INFO ] Time to serialize gal into /tmp/LTL16834279439780469116.gal : 14 ms
[2023-03-16 17:13:47] [INFO ] Time to serialize properties into /tmp/LTL12564264833572410194.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16834279439780469116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12564264833572410194.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((u0.malicious_reservoir_0>=1)&&(i30.u116.s4_28>=1))||((u0.malicious_reservoir_0>=1)&&(i11.u115.s4_27>=1)))||(((u0.malicio...1649
Formula 0 simplified : F!"(((((((u0.malicious_reservoir_0>=1)&&(i30.u116.s4_28>=1))||((u0.malicious_reservoir_0>=1)&&(i11.u115.s4_27>=1)))||(((u0.malicious...1639
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11962724523648111225
[2023-03-16 17:14:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11962724523648111225
Running compilation step : cd /tmp/ltsmin11962724523648111225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1741 ms.
Running link step : cd /tmp/ltsmin11962724523648111225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11962724523648111225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-04 finished in 151690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLFireability-12
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 58 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2904 transition count 442
Applied a total of 4 rules in 441 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-16 17:14:17] [INFO ] Computed 2464 place invariants in 48 ms
[2023-03-16 17:14:22] [INFO ] Implicit Places using invariants in 4147 ms returned []
[2023-03-16 17:14:22] [INFO ] Invariant cache hit.
[2023-03-16 17:14:29] [INFO ] Implicit Places using invariants and state equation in 7678 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11845 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12430 ms. Remains : 2846/2936 places, 442/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s2592 1) (LT s2708 1)) (OR (LT s2587 1) (LT s2703 1)) (OR (LT s2591 1) (LT s2707 1)) (OR (LT s2593 1) (LT s2709 1)) (OR (LT s2597 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2816 reset in 523 ms.
Product exploration explored 100000 steps with 2815 reset in 540 ms.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
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), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1611447 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :{}
Probabilistic random walk after 1611447 steps, saw 231517 distinct states, run finished after 3001 ms. (steps per millisecond=536 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 2846 cols
[2023-03-16 17:14:35] [INFO ] Computed 2408 place invariants in 579 ms
[2023-03-16 17:14:36] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 484 ms returned sat
[2023-03-16 17:14:36] [INFO ] After 808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:14:36] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 497 ms returned sat
[2023-03-16 17:14:37] [INFO ] After 953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 17:14:38] [INFO ] After 1085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-16 17:14:38] [INFO ] After 2012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 58 out of 2846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 132 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 17:14:38] [INFO ] Invariant cache hit.
[2023-03-16 17:14:42] [INFO ] Implicit Places using invariants in 4065 ms returned []
[2023-03-16 17:14:42] [INFO ] Invariant cache hit.
[2023-03-16 17:14:50] [INFO ] Implicit Places using invariants and state equation in 7762 ms returned []
Implicit Place search using SMT with State Equation took 11832 ms to find 0 implicit places.
[2023-03-16 17:14:50] [INFO ] Invariant cache hit.
[2023-03-16 17:14:51] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13006 ms. Remains : 2846/2846 places, 442/442 transitions.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
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), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1598774 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :{}
Probabilistic random walk after 1598774 steps, saw 229911 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 17:14:55] [INFO ] Invariant cache hit.
[2023-03-16 17:14:56] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 501 ms returned sat
[2023-03-16 17:14:56] [INFO ] After 853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:14:57] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 498 ms returned sat
[2023-03-16 17:14:58] [INFO ] After 1001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 17:14:58] [INFO ] After 1162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-16 17:14:58] [INFO ] After 2090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2818 reset in 530 ms.
Product exploration explored 100000 steps with 2816 reset in 527 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 58 out of 2846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 158 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 17:15:00] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-16 17:15:00] [INFO ] Invariant cache hit.
[2023-03-16 17:15:01] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1173 ms. Remains : 2846/2846 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin5576274968970905345
[2023-03-16 17:15:01] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5576274968970905345
Running compilation step : cd /tmp/ltsmin5576274968970905345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1771 ms.
Running link step : cd /tmp/ltsmin5576274968970905345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5576274968970905345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9995234774000201224.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 58 out of 2846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 130 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 17:15:17] [INFO ] Invariant cache hit.
[2023-03-16 17:15:21] [INFO ] Implicit Places using invariants in 4131 ms returned []
[2023-03-16 17:15:21] [INFO ] Invariant cache hit.
[2023-03-16 17:15:29] [INFO ] Implicit Places using invariants and state equation in 7879 ms returned []
Implicit Place search using SMT with State Equation took 12014 ms to find 0 implicit places.
[2023-03-16 17:15:29] [INFO ] Invariant cache hit.
[2023-03-16 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13187 ms. Remains : 2846/2846 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin4729864083300546908
[2023-03-16 17:15:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4729864083300546908
Running compilation step : cd /tmp/ltsmin4729864083300546908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1858 ms.
Running link step : cd /tmp/ltsmin4729864083300546908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4729864083300546908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9566435794304343024.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:15:45] [INFO ] Flatten gal took : 56 ms
[2023-03-16 17:15:45] [INFO ] Flatten gal took : 55 ms
[2023-03-16 17:15:45] [INFO ] Time to serialize gal into /tmp/LTL17941099438417635368.gal : 8 ms
[2023-03-16 17:15:45] [INFO ] Time to serialize properties into /tmp/LTL15971465958980977461.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17941099438417635368.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5808690627982398117.hoa' '-atoms' '/tmp/LTL15971465958980977461.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15971465958980977461.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5808690627982398117.hoa
Detected timeout of ITS tools.
[2023-03-16 17:16:01] [INFO ] Flatten gal took : 57 ms
[2023-03-16 17:16:01] [INFO ] Flatten gal took : 58 ms
[2023-03-16 17:16:01] [INFO ] Time to serialize gal into /tmp/LTL4440457119373862399.gal : 7 ms
[2023-03-16 17:16:01] [INFO ] Time to serialize properties into /tmp/LTL16993177042817550781.ltl : 80 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4440457119373862399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16993177042817550781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((n3_10<1)||(s2_10<1))&&((n3_5<1)||(s2_5<1)))&&(((n3_9<1)||(s2_9<1))&&((n3_11<1)||(s2_11<1))))&&((((n3_15<1)||(s2_15<1))&...764
Formula 0 simplified : XF!"(((((((n3_10<1)||(s2_10<1))&&((n3_5<1)||(s2_5<1)))&&(((n3_9<1)||(s2_9<1))&&((n3_11<1)||(s2_11<1))))&&((((n3_15<1)||(s2_15<1))&&(...758
Detected timeout of ITS tools.
[2023-03-16 17:16:16] [INFO ] Flatten gal took : 54 ms
[2023-03-16 17:16:16] [INFO ] Applying decomposition
[2023-03-16 17:16:16] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph152519871259902414.txt' '-o' '/tmp/graph152519871259902414.bin' '-w' '/tmp/graph152519871259902414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph152519871259902414.bin' '-l' '-1' '-v' '-w' '/tmp/graph152519871259902414.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:16:16] [INFO ] Decomposing Gal with order
[2023-03-16 17:16:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:16:16] [INFO ] Removed a total of 319 redundant transitions.
[2023-03-16 17:16:16] [INFO ] Flatten gal took : 164 ms
[2023-03-16 17:16:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 45 ms.
[2023-03-16 17:16:16] [INFO ] Time to serialize gal into /tmp/LTL10982127744158694522.gal : 16 ms
[2023-03-16 17:16:16] [INFO ] Time to serialize properties into /tmp/LTL18312077205838977937.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10982127744158694522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18312077205838977937.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((i25.u32.n3_10<1)||(i25.u62.s2_10<1))&&((i9.u29.n3_5<1)||(i9.u44.s2_5<1)))&&(((i5.u18.n3_9<1)||(i5.u48.s2_9<1))&&((i17.u...1212
Formula 0 simplified : XF!"(((((((i25.u32.n3_10<1)||(i25.u62.s2_10<1))&&((i9.u29.n3_5<1)||(i9.u44.s2_5<1)))&&(((i5.u18.n3_9<1)||(i5.u48.s2_9<1))&&((i17.u33...1206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3062078095956441266
[2023-03-16 17:16:32] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3062078095956441266
Running compilation step : cd /tmp/ltsmin3062078095956441266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1808 ms.
Running link step : cd /tmp/ltsmin3062078095956441266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3062078095956441266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-12 finished in 149786 ms.
[2023-03-16 17:16:47] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15159799999708820160
[2023-03-16 17:16:47] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2023-03-16 17:16:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:16:47] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2023-03-16 17:16:47] [INFO ] Applying decomposition
[2023-03-16 17:16:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:16:47] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2023-03-16 17:16:47] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:16:47] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15159799999708820160
Running compilation step : cd /tmp/ltsmin15159799999708820160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 17:16:47] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3202414834585588859.txt' '-o' '/tmp/graph3202414834585588859.bin' '-w' '/tmp/graph3202414834585588859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3202414834585588859.bin' '-l' '-1' '-v' '-w' '/tmp/graph3202414834585588859.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:16:47] [INFO ] Decomposing Gal with order
[2023-03-16 17:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:16:47] [INFO ] Removed a total of 289 redundant transitions.
[2023-03-16 17:16:47] [INFO ] Flatten gal took : 176 ms
[2023-03-16 17:16:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 84 ms.
[2023-03-16 17:16:47] [INFO ] Time to serialize gal into /tmp/LTLFireability8333522087142303479.gal : 19 ms
[2023-03-16 17:16:47] [INFO ] Time to serialize properties into /tmp/LTLFireability11762680610365504995.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8333522087142303479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11762680610365504995.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G("(((((((u0.malicious_reservoir_0>=1)&&(i18.i1.u170.s4_28>=1))||((u0.malicious_reservoir_0>=1)&&(i20.i0.u169.s4_27>=1)))||(((u0.m...1736
Formula 0 simplified : F!"(((((((u0.malicious_reservoir_0>=1)&&(i18.i1.u170.s4_28>=1))||((u0.malicious_reservoir_0>=1)&&(i20.i0.u169.s4_27>=1)))||(((u0.mal...1726
Compilation finished in 2265 ms.
Running link step : cd /tmp/ltsmin15159799999708820160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15159799999708820160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.182: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.182: LTL layer: formula: ([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))
pins2lts-mc-linux64( 6/ 8), 0.183: "([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.183: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.208: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.210: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.213: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.222: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.224: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.241: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.538: DFS-FIFO for weak LTL, using special progress label 450
pins2lts-mc-linux64( 0/ 8), 0.538: There are 451 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.538: State length is 2937, there are 451 groups
pins2lts-mc-linux64( 0/ 8), 0.538: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.538: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.538: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.538: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.640: ~18 levels ~960 states ~3624 transitions
pins2lts-mc-linux64( 6/ 8), 0.670: ~18 levels ~1920 states ~5000 transitions
pins2lts-mc-linux64( 6/ 8), 0.766: ~18 levels ~3840 states ~8208 transitions
pins2lts-mc-linux64( 6/ 8), 0.992: ~18 levels ~7680 states ~14528 transitions
pins2lts-mc-linux64( 6/ 8), 1.457: ~18 levels ~15360 states ~29800 transitions
pins2lts-mc-linux64( 6/ 8), 2.327: ~18 levels ~30720 states ~62384 transitions
pins2lts-mc-linux64( 6/ 8), 3.984: ~18 levels ~61440 states ~142344 transitions
pins2lts-mc-linux64( 1/ 8), 7.195: ~18 levels ~122880 states ~303848 transitions
pins2lts-mc-linux64( 1/ 8), 13.467: ~18 levels ~245760 states ~671408 transitions
pins2lts-mc-linux64( 6/ 8), 25.793: ~18 levels ~491520 states ~1431832 transitions
pins2lts-mc-linux64( 7/ 8), 50.191: ~18 levels ~983040 states ~3116208 transitions
pins2lts-mc-linux64( 7/ 8), 99.896: ~18 levels ~1966080 states ~6896472 transitions
pins2lts-mc-linux64( 7/ 8), 199.751: ~18 levels ~3932160 states ~14666592 transitions
pins2lts-mc-linux64( 7/ 8), 316.755: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 317.111:
pins2lts-mc-linux64( 0/ 8), 317.111: mean standard work distribution: 0.4% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 317.111:
pins2lts-mc-linux64( 0/ 8), 317.111: Explored 5927771 states 23610013 transitions, fanout: 3.983
pins2lts-mc-linux64( 0/ 8), 317.111: Total exploration time 316.560 sec (316.210 sec minimum, 316.389 sec on average)
pins2lts-mc-linux64( 0/ 8), 317.111: States per second: 18726, Transitions per second: 74583
pins2lts-mc-linux64( 0/ 8), 317.111:
pins2lts-mc-linux64( 0/ 8), 317.111: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 317.111: Redundant explorations: -0.0317
pins2lts-mc-linux64( 0/ 8), 317.111:
pins2lts-mc-linux64( 0/ 8), 317.111: Queue width: 8B, total height: 152, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 317.111: Tree memory: 301.2MB, 53.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 317.111: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 317.111: Stored 506 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 317.111: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 317.111: Est. total memory use: 301.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15159799999708820160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15159799999708820160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 17:41:20] [INFO ] Applying decomposition
[2023-03-16 17:41:21] [INFO ] Flatten gal took : 456 ms
[2023-03-16 17:41:21] [INFO ] Decomposing Gal with order
[2023-03-16 17:41:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:41:22] [INFO ] Removed a total of 260 redundant transitions.
[2023-03-16 17:41:22] [INFO ] Flatten gal took : 734 ms
[2023-03-16 17:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 341 ms.
[2023-03-16 17:41:22] [INFO ] Time to serialize gal into /tmp/LTLFireability9304757644230936149.gal : 142 ms
[2023-03-16 17:41:22] [INFO ] Time to serialize properties into /tmp/LTLFireability5290596227505352437.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9304757644230936149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5290596227505352437.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G("(((((((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid28.s4_28>=1))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsi...2092
Formula 0 simplified : F!"(((((((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid28.s4_28>=1))||((malicious_reservoir.malicious_reservoir_0>=1)&&(tsid2...2082
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136496 kB
After kill :
MemTotal: 16393216 kB
MemFree: 10323508 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-28, 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 r293-tall-167873946000844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;