Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 107K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 666K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 13 03:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 76K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 121K Apr 13 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 795K Apr 13 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 749K May 18 16:43 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-PT-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716773354046

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 01:29:15] [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]
[2024-05-27 01:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:29:15] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-27 01:29:15] [INFO ] Transformed 2998 places.
[2024-05-27 01:29:15] [INFO ] Transformed 446 transitions.
[2024-05-27 01:29:15] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2738 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 70 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-27 01:29:16] [INFO ] Computed 2492 invariants in 122 ms
[2024-05-27 01:29:17] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-05-27 01:29:17] [INFO ] Invariant cache hit.
[2024-05-27 01:29:19] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2809 ms to find 0 implicit places.
[2024-05-27 01:29:19] [INFO ] Invariant cache hit.
[2024-05-27 01:29:20] [INFO ] Dead Transitions using invariants and state equation in 1083 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 3969 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2738 out of 2936 places after structural reductions.
[2024-05-27 01:29:20] [INFO ] Flatten gal took : 250 ms
[2024-05-27 01:29:20] [INFO ] Flatten gal took : 133 ms
[2024-05-27 01:29:21] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-27 01:29:22] [INFO ] Invariant cache hit.
[2024-05-27 01:29:24] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 524 ms returned sat
[2024-05-27 01:29:24] [INFO ] After 1889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-27 01:29:26] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 598 ms returned sat
[2024-05-27 01:29:40] [INFO ] After 13043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-27 01:29:49] [INFO ] After 22193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-27 01:29:49] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Finished Parikh walk after 224 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=20 )
Parikh walk visited 19 properties in 53 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 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 315 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:29:50] [INFO ] Invariant cache hit.
[2024-05-27 01:29:53] [INFO ] Implicit Places using invariants in 3598 ms returned []
[2024-05-27 01:29:53] [INFO ] Invariant cache hit.
[2024-05-27 01:30:01] [INFO ] Implicit Places using invariants and state equation in 7861 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11476 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 132 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 11923 ms. Remains : 2907/2936 places, 446/446 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s215 1)) (AND (GEQ s0 1) (GEQ s198 1)) (AND (GEQ s0 1) (GEQ s199 1)) (AND (GEQ s0 1) (GEQ s200 1)) (AND (GEQ s0 1) (GEQ s201 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2100 ms.
Product exploration explored 100000 steps with 50000 reset in 1920 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), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 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-PT-28-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-00 finished in 16667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 1740 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 35 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:30:06] [INFO ] Invariant cache hit.
[2024-05-27 01:30:08] [INFO ] Implicit Places using invariants in 2222 ms returned []
[2024-05-27 01:30:08] [INFO ] Invariant cache hit.
[2024-05-27 01:30:12] [INFO ] Implicit Places using invariants and state equation in 3922 ms returned []
Implicit Place search using SMT with State Equation took 6162 ms to find 0 implicit places.
[2024-05-27 01:30:12] [INFO ] Invariant cache hit.
[2024-05-27 01:30:13] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7273 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s78 1) (GEQ s1888 1) (GEQ s1921 1) (GEQ s1962 1) (GEQ s2042 1) (GEQ s2049 1) (GEQ s2071 1) (GEQ s2084 1) (GEQ s2115 1) (GEQ s2142 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-01 finished in 7500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 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 148 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:30:14] [INFO ] Invariant cache hit.
[2024-05-27 01:30:18] [INFO ] Implicit Places using invariants in 4198 ms returned []
[2024-05-27 01:30:18] [INFO ] Invariant cache hit.
[2024-05-27 01:30:25] [INFO ] Implicit Places using invariants and state equation in 7115 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11318 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 11627 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s213 1), p0:(GEQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7442 reset in 545 ms.
Product exploration explored 100000 steps with 7428 reset in 569 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)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:30:28] [INFO ] Computed 2464 invariants in 352 ms
[2024-05-27 01:30:34] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 4677 ms returned sat
[2024-05-27 01:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:30:43] [INFO ] [Real]Absence check using state equation in 9207 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 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 167 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:30:43] [INFO ] Invariant cache hit.
[2024-05-27 01:30:47] [INFO ] Implicit Places using invariants in 4034 ms returned []
[2024-05-27 01:30:47] [INFO ] Invariant cache hit.
[2024-05-27 01:30:54] [INFO ] Implicit Places using invariants and state equation in 7241 ms returned []
Implicit Place search using SMT with State Equation took 11277 ms to find 0 implicit places.
[2024-05-27 01:30:54] [INFO ] Invariant cache hit.
[2024-05-27 01:30:55] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12491 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 : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-27 01:30:57] [INFO ] Invariant cache hit.
[2024-05-27 01:31:03] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 5313 ms returned sat
[2024-05-27 01:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:12] [INFO ] [Real]Absence check using state equation in 8604 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7366 reset in 561 ms.
Product exploration explored 100000 steps with 7379 reset in 600 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 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 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.52 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1979 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1979 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 1979 transition count 331
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 116 rules in 466 ms. Remains 1979 /2907 variables (removed 928) and now considering 331/446 (removed 115) transitions.
[2024-05-27 01:31:14] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 331 rows 1979 cols
[2024-05-27 01:31:14] [INFO ] Computed 1652 invariants in 22 ms
[2024-05-27 01:31:15] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1979/2907 places, 331/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1193 ms. Remains : 1979/2907 places, 331/446 transitions.
Built C files in :
/tmp/ltsmin14029511073286448228
[2024-05-27 01:31:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14029511073286448228
Running compilation step : cd /tmp/ltsmin14029511073286448228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1876 ms.
Running link step : cd /tmp/ltsmin14029511073286448228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14029511073286448228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9781832817698596847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 188 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:31:30] [INFO ] Computed 2464 invariants in 330 ms
[2024-05-27 01:31:34] [INFO ] Implicit Places using invariants in 4252 ms returned []
[2024-05-27 01:31:34] [INFO ] Invariant cache hit.
[2024-05-27 01:31:42] [INFO ] Implicit Places using invariants and state equation in 7815 ms returned []
Implicit Place search using SMT with State Equation took 12069 ms to find 0 implicit places.
[2024-05-27 01:31:42] [INFO ] Invariant cache hit.
[2024-05-27 01:31:43] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13336 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin16890782736559457590
[2024-05-27 01:31:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16890782736559457590
Running compilation step : cd /tmp/ltsmin16890782736559457590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1805 ms.
Running link step : cd /tmp/ltsmin16890782736559457590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16890782736559457590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15463641128133821363.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:31:58] [INFO ] Flatten gal took : 70 ms
[2024-05-27 01:31:58] [INFO ] Flatten gal took : 70 ms
[2024-05-27 01:31:58] [INFO ] Time to serialize gal into /tmp/LTL659132510622364149.gal : 16 ms
[2024-05-27 01:31:58] [INFO ] Time to serialize properties into /tmp/LTL3732324511814753718.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL659132510622364149.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13085342736497342068.hoa' '-atoms' '/tmp/LTL3732324511814753718.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3732324511814753718.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13085342736497342068.hoa
Detected timeout of ITS tools.
[2024-05-27 01:32:14] [INFO ] Flatten gal took : 69 ms
[2024-05-27 01:32:14] [INFO ] Flatten gal took : 67 ms
[2024-05-27 01:32:14] [INFO ] Time to serialize gal into /tmp/LTL8632917617805869915.gal : 10 ms
[2024-05-27 01:32:14] [INFO ] Time to serialize properties into /tmp/LTL13864561953163094984.ltl : 116 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8632917617805869915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13864561953163094984.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("(a3>=1)"))||(F("(a1>=1)"))))
Formula 0 simplified : X!"(a3>=1)" & G!"(a1>=1)"
Detected timeout of ITS tools.
[2024-05-27 01:32:29] [INFO ] Flatten gal took : 65 ms
[2024-05-27 01:32:29] [INFO ] Applying decomposition
[2024-05-27 01:32:29] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1505422373750967011.txt' '-o' '/tmp/graph1505422373750967011.bin' '-w' '/tmp/graph1505422373750967011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1505422373750967011.bin' '-l' '-1' '-v' '-w' '/tmp/graph1505422373750967011.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:32:29] [INFO ] Decomposing Gal with order
[2024-05-27 01:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:32:30] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-27 01:32:30] [INFO ] Flatten gal took : 398 ms
[2024-05-27 01:32:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 127 ms.
[2024-05-27 01:32:30] [INFO ] Time to serialize gal into /tmp/LTL18349573716029454609.gal : 29 ms
[2024-05-27 01:32:30] [INFO ] Time to serialize properties into /tmp/LTL14612990171758129627.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18349573716029454609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14612990171758129627.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X("(i18.i1.u113.a3>=1)"))||(F("(i18.i1.u77.a1>=1)"))))
Formula 0 simplified : X!"(i18.i1.u113.a3>=1)" & G!"(i18.i1.u77.a1>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6161744765140145439
[2024-05-27 01:32:45] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6161744765140145439
Running compilation step : cd /tmp/ltsmin6161744765140145439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1826 ms.
Running link step : cd /tmp/ltsmin6161744765140145439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6161744765140145439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-02 finished in 166497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 871 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 111 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-27 01:33:00] [INFO ] Computed 2492 invariants in 40 ms
[2024-05-27 01:33:03] [INFO ] Implicit Places using invariants in 2816 ms returned []
[2024-05-27 01:33:03] [INFO ] Invariant cache hit.
[2024-05-27 01:33:08] [INFO ] Implicit Places using invariants and state equation in 4706 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 7530 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 111 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 7754 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s14 1) (GEQ s522 1) (GEQ s523 1) (GEQ s524 1) (GEQ s525 1) (GEQ s526 1) (GEQ s530 1) (GEQ s531 1) (GEQ s532 1) (GEQ s533 1) (GEQ s534 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-03 finished in 7871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||G(F(p2))))))'
Support contains 1741 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 46 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:33:08] [INFO ] Invariant cache hit.
[2024-05-27 01:33:10] [INFO ] Implicit Places using invariants in 1923 ms returned []
[2024-05-27 01:33:10] [INFO ] Invariant cache hit.
[2024-05-27 01:33:14] [INFO ] Implicit Places using invariants and state equation in 3767 ms returned []
Implicit Place search using SMT with State Equation took 5694 ms to find 0 implicit places.
[2024-05-27 01:33:14] [INFO ] Invariant cache hit.
[2024-05-27 01:33:15] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6801 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s2781 1), p2:(OR (AND (GEQ s1837 1) (GEQ s1838 1) (GEQ s1839 1) (GEQ s1841 1) (GEQ s1842 1) (GEQ s1843 1) (GEQ s1844 1) (GEQ s1845 1) (GEQ s1846 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2098 steps with 62 reset in 20 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 7060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1 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 202 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:33:15] [INFO ] Invariant cache hit.
[2024-05-27 01:33:19] [INFO ] Implicit Places using invariants in 3867 ms returned []
[2024-05-27 01:33:19] [INFO ] Invariant cache hit.
[2024-05-27 01:33:25] [INFO ] Implicit Places using invariants and state equation in 6433 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10307 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 194 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 10705 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s149 1)) (AND (GEQ s0 1) (GEQ s148 1)) (AND (GEQ s0 1) (GEQ s147 1)) (AND (GEQ s0 1) (GEQ s153 1)) (AND (GEQ s0 1) (GEQ s152 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3027 reset in 498 ms.
Product exploration explored 100000 steps with 3024 reset in 471 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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 300 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 997057 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 997057 steps, saw 126588 distinct states, run finished after 3002 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:33:31] [INFO ] Computed 2464 invariants in 295 ms
[2024-05-27 01:33:32] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 513 ms returned sat
[2024-05-27 01:33:33] [INFO ] After 1940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:33:34] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 499 ms returned sat
[2024-05-27 01:33:35] [INFO ] After 1109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 01:33:35] [INFO ] After 1383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 221 ms.
[2024-05-27 01:33:35] [INFO ] After 2485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 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 205 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:33:36] [INFO ] Invariant cache hit.
[2024-05-27 01:33:40] [INFO ] Implicit Places using invariants in 3975 ms returned []
[2024-05-27 01:33:40] [INFO ] Invariant cache hit.
[2024-05-27 01:33:49] [INFO ] Implicit Places using invariants and state equation in 8659 ms returned []
Implicit Place search using SMT with State Equation took 12638 ms to find 0 implicit places.
[2024-05-27 01:33:49] [INFO ] Invariant cache hit.
[2024-05-27 01:33:50] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13967 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 : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 303 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 969904 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 969904 steps, saw 123444 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 01:33:54] [INFO ] Invariant cache hit.
[2024-05-27 01:33:55] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 542 ms returned sat
[2024-05-27 01:33:56] [INFO ] After 2006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:33:57] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 528 ms returned sat
[2024-05-27 01:33:58] [INFO ] After 1122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 01:33:58] [INFO ] After 1426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 203 ms.
[2024-05-27 01:33:58] [INFO ] After 2606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 3021 reset in 444 ms.
Product exploration explored 100000 steps with 3026 reset in 506 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 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.15 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 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2877 transition count 446
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 472 ms. Remains 2877 /2907 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:34:01] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 446 rows 2877 cols
[2024-05-27 01:34:01] [INFO ] Computed 2436 invariants in 314 ms
[2024-05-27 01:34:02] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2907 places, 446/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1937 ms. Remains : 2877/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin17835141640332410048
[2024-05-27 01:34:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17835141640332410048
Running compilation step : cd /tmp/ltsmin17835141640332410048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1781 ms.
Running link step : cd /tmp/ltsmin17835141640332410048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17835141640332410048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10120798874572177391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 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 209 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:34:18] [INFO ] Computed 2464 invariants in 323 ms
[2024-05-27 01:34:21] [INFO ] Implicit Places using invariants in 4119 ms returned []
[2024-05-27 01:34:21] [INFO ] Invariant cache hit.
[2024-05-27 01:34:29] [INFO ] Implicit Places using invariants and state equation in 7638 ms returned []
Implicit Place search using SMT with State Equation took 11762 ms to find 0 implicit places.
[2024-05-27 01:34:29] [INFO ] Invariant cache hit.
[2024-05-27 01:34:30] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13071 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin15049784274516889648
[2024-05-27 01:34:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15049784274516889648
Running compilation step : cd /tmp/ltsmin15049784274516889648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1874 ms.
Running link step : cd /tmp/ltsmin15049784274516889648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15049784274516889648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16487760606707476634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:34:45] [INFO ] Flatten gal took : 58 ms
[2024-05-27 01:34:46] [INFO ] Flatten gal took : 70 ms
[2024-05-27 01:34:46] [INFO ] Time to serialize gal into /tmp/LTL2764154913120140700.gal : 11 ms
[2024-05-27 01:34:46] [INFO ] Time to serialize properties into /tmp/LTL2036675234194340204.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2764154913120140700.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13742823135609860178.hoa' '-atoms' '/tmp/LTL2036675234194340204.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2036675234194340204.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13742823135609860178.hoa
Detected timeout of ITS tools.
[2024-05-27 01:35:01] [INFO ] Flatten gal took : 59 ms
[2024-05-27 01:35:01] [INFO ] Flatten gal took : 58 ms
[2024-05-27 01:35:01] [INFO ] Time to serialize gal into /tmp/LTL10753116777721887762.gal : 8 ms
[2024-05-27 01:35:01] [INFO ] Time to serialize properties into /tmp/LTL11408980369278155568.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10753116777721887762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11408980369278155568.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((malicious_reservoir>=1)&&(s3_24>=1))||((malicious_reservoir>=1)&&(s3_23>=1)))||(((malicious_reservoir>=1)&&(s3_22>=1)...2826
Formula 0 simplified : F(!"((((((s6_0<1)&&(s6_1<1))&&((s6_4<1)&&(s6_5<1)))&&(((s6_2<1)&&(s6_8<1))&&((s6_3<1)&&(s6_6<1))))&&((((s6_9<1)&&(s6_12<1))&&((s6_7<...2815
Detected timeout of ITS tools.
[2024-05-27 01:35:16] [INFO ] Flatten gal took : 55 ms
[2024-05-27 01:35:16] [INFO ] Applying decomposition
[2024-05-27 01:35:16] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11128614933907819774.txt' '-o' '/tmp/graph11128614933907819774.bin' '-w' '/tmp/graph11128614933907819774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11128614933907819774.bin' '-l' '-1' '-v' '-w' '/tmp/graph11128614933907819774.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:35:16] [INFO ] Decomposing Gal with order
[2024-05-27 01:35:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:35:16] [INFO ] Removed a total of 287 redundant transitions.
[2024-05-27 01:35:16] [INFO ] Flatten gal took : 183 ms
[2024-05-27 01:35:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 54 ms.
[2024-05-27 01:35:17] [INFO ] Time to serialize gal into /tmp/LTL10018160004241448739.gal : 19 ms
[2024-05-27 01:35:17] [INFO ] Time to serialize properties into /tmp/LTL17865701030695124559.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10018160004241448739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17865701030695124559.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((u0.malicious_reservoir>=1)&&(i36.i2.u144.s3_24>=1))||((u0.malicious_reservoir>=1)&&(i39.u143.s3_23>=1)))||(((u0.malic...3755
Formula 0 simplified : F(!"((((((u1.s6_0<1)&&(u2.s6_1<1))&&((u3.s6_4<1)&&(u4.s6_5<1)))&&(((u5.s6_2<1)&&(u7.s6_8<1))&&((u6.s6_3<1)&&(u9.s6_6<1))))&&((((u8.s...3744
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12884933360735553107
[2024-05-27 01:35:32] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12884933360735553107
Running compilation step : cd /tmp/ltsmin12884933360735553107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1850 ms.
Running link step : cd /tmp/ltsmin12884933360735553107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12884933360735553107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp0==true) U [](!(LTLAPp0==true))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 151772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 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 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.11 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 2006 transition count 328
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 2006 transition count 328
Applied a total of 118 rules in 494 ms. Remains 2006 /2936 variables (removed 930) and now considering 328/446 (removed 118) transitions.
// Phase 1: matrix 328 rows 2006 cols
[2024-05-27 01:35:47] [INFO ] Computed 1680 invariants in 12 ms
[2024-05-27 01:35:50] [INFO ] Implicit Places using invariants in 2326 ms returned []
[2024-05-27 01:35:50] [INFO ] Invariant cache hit.
[2024-05-27 01:35:55] [INFO ] Implicit Places using invariants and state equation in 5893 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8227 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1948/2936 places, 328/446 transitions.
Applied a total of 0 rules in 129 ms. Remains 1948 /1948 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8852 ms. Remains : 1948/2936 places, 328/446 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2815 reset in 369 ms.
Product exploration explored 100000 steps with 2819 reset in 384 ms.
Computed a total of 1948 stabilizing places and 328 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1948 transition count 328
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-06 finished in 9977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((!p0||X(G(!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 215 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-27 01:35:57] [INFO ] Computed 2492 invariants in 36 ms
[2024-05-27 01:36:01] [INFO ] Implicit Places using invariants in 4333 ms returned []
[2024-05-27 01:36:01] [INFO ] Invariant cache hit.
[2024-05-27 01:36:09] [INFO ] Implicit Places using invariants and state equation in 7549 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11887 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 202 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 12305 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), false, (AND (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s216 1), p1:(AND (GEQ s217 1) (GEQ s2876 1) (GEQ s2879 1) (GEQ s2880 1) (GEQ s2881 1) (GEQ s2882 1) (GEQ s2883 1) (GEQ s2884 1) (GEQ s2885 1) (GEQ...], 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-07 finished in 12453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p1)&&p0))&&F(G(p2)))))'
Support contains 62 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 220 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:36:09] [INFO ] Invariant cache hit.
[2024-05-27 01:36:13] [INFO ] Implicit Places using invariants in 4032 ms returned []
[2024-05-27 01:36:13] [INFO ] Invariant cache hit.
[2024-05-27 01:36:20] [INFO ] Implicit Places using invariants and state equation in 6413 ms returned [1969, 1970, 1972, 1981, 1982, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 10452 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2936 places, 446/446 transitions.
Applied a total of 0 rules in 195 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10868 ms. Remains : 2908/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1373 1) (GEQ s1374 1) (GEQ s1375 1) (GEQ s1376 1) (GEQ s1378 1) (GEQ s1381 1) (GEQ s1382 1) (GEQ s1383 1) (GEQ s1384 1) (GEQ s1385 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 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 11086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 35 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 205 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:36:20] [INFO ] Invariant cache hit.
[2024-05-27 01:36:24] [INFO ] Implicit Places using invariants in 3827 ms returned []
[2024-05-27 01:36:24] [INFO ] Invariant cache hit.
[2024-05-27 01:36:30] [INFO ] Implicit Places using invariants and state equation in 6054 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 9892 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 215 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 10314 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s217 1) (LT s2876 1) (LT s2879 1) (LT s2880 1) (LT s2881 1) (LT s2882 1) (LT s2883 1) (LT s2884 1) (LT s2885 1) (LT s2886 1) (LT s2887 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3024 reset in 312 ms.
Product exploration explored 100000 steps with 3028 reset in 339 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 p1 (NOT p0)), (X p1), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 303 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:36:33] [INFO ] Computed 2464 invariants in 332 ms
[2024-05-27 01:36:33] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 488 ms returned sat
[2024-05-27 01:36:33] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:36:34] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 542 ms returned sat
[2024-05-27 01:36:40] [INFO ] After 5684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 01:36:41] [INFO ] After 6609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 668 ms.
[2024-05-27 01:36:42] [INFO ] After 8165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 342 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-09 finished in 21722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(X(!p1)||G(p2))))'
Support contains 32 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 217 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-27 01:36:42] [INFO ] Computed 2492 invariants in 38 ms
[2024-05-27 01:36:46] [INFO ] Implicit Places using invariants in 4201 ms returned []
[2024-05-27 01:36:46] [INFO ] Invariant cache hit.
[2024-05-27 01:36:54] [INFO ] Implicit Places using invariants and state equation in 7653 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11864 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 192 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 12275 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (AND p1 (NOT p2))), p1, (NOT p0), (NOT p0), (AND (NOT p2) p1), true, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s12 1) (GEQ s506 1) (GEQ s507 1) (GEQ s508 1) (GEQ s509 1) (GEQ s510 1) (GEQ s511 1) (GEQ s512 1) (GEQ s513 1) (GEQ s514 1) (GEQ s515 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-10 finished in 12565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (G((p1||X(F(p2)))) U (p2 U p0)))))'
Support contains 4 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.12 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 0 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
Applied a total of 3 rules in 444 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-27 01:36:55] [INFO ] Computed 2464 invariants in 40 ms
[2024-05-27 01:36:59] [INFO ] Implicit Places using invariants in 4088 ms returned []
[2024-05-27 01:36:59] [INFO ] Invariant cache hit.
[2024-05-27 01:37:07] [INFO ] Implicit Places using invariants and state equation in 7846 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2607, 2608, 2609, 2610, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2825]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11941 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 232 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 12617 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(GEQ s211 1), p2:(AND (GEQ s0 1) (GEQ s129 1)), p1:(GEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-11 finished in 12872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.9 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
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 117 place count 2006 transition count 328
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 2006 transition count 328
Applied a total of 118 rules in 470 ms. Remains 2006 /2936 variables (removed 930) and now considering 328/446 (removed 118) transitions.
// Phase 1: matrix 328 rows 2006 cols
[2024-05-27 01:37:08] [INFO ] Computed 1680 invariants in 20 ms
[2024-05-27 01:37:10] [INFO ] Implicit Places using invariants in 2505 ms returned []
[2024-05-27 01:37:10] [INFO ] Invariant cache hit.
[2024-05-27 01:37:16] [INFO ] Implicit Places using invariants and state equation in 5496 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8007 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1948/2936 places, 328/446 transitions.
Applied a total of 0 rules in 113 ms. Remains 1948 /1948 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8592 ms. Remains : 1948/2936 places, 328/446 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s122 1) (GEQ s1919 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-12 finished in 8648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 1 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 209 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-27 01:37:16] [INFO ] Computed 2492 invariants in 30 ms
[2024-05-27 01:37:21] [INFO ] Implicit Places using invariants in 4512 ms returned []
[2024-05-27 01:37:21] [INFO ] Invariant cache hit.
[2024-05-27 01:37:28] [INFO ] Implicit Places using invariants and state equation in 7036 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11557 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 195 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 11962 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s47 1)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 3021 reset in 305 ms.
Product exploration explored 100000 steps with 3017 reset in 314 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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
Incomplete random walk after 10000 steps, including 303 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1654817 steps, run timeout after 3001 ms. (steps per millisecond=551 ) properties seen :{}
Probabilistic random walk after 1654817 steps, saw 208667 distinct states, run finished after 3001 ms. (steps per millisecond=551 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:37:33] [INFO ] Computed 2464 invariants in 305 ms
[2024-05-27 01:37:34] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 540 ms returned sat
[2024-05-27 01:37:35] [INFO ] After 1010ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 01:37:35] [INFO ] After 1121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-27 01:37:35] [INFO ] After 2092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 164 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0, p0]
Support contains 1 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 216 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:37:35] [INFO ] Invariant cache hit.
[2024-05-27 01:37:39] [INFO ] Implicit Places using invariants in 3814 ms returned []
[2024-05-27 01:37:39] [INFO ] Invariant cache hit.
[2024-05-27 01:37:46] [INFO ] Implicit Places using invariants and state equation in 6706 ms returned []
Implicit Place search using SMT with State Equation took 10526 ms to find 0 implicit places.
[2024-05-27 01:37:46] [INFO ] Invariant cache hit.
[2024-05-27 01:37:47] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11843 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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1670748 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1670748 steps, saw 210661 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 01:37:51] [INFO ] Invariant cache hit.
[2024-05-27 01:37:52] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 512 ms returned sat
[2024-05-27 01:37:53] [INFO ] After 949ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 01:37:53] [INFO ] After 1088ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-27 01:37:53] [INFO ] After 2006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 109 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 3020 reset in 312 ms.
Product exploration explored 100000 steps with 3027 reset in 337 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 101 ms :[true, p0, p0, p0]
Support contains 1 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 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.12 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 1980 transition count 332
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 1980 transition count 332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 1980 transition count 334
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 115 rules in 359 ms. Remains 1980 /2907 variables (removed 927) and now considering 334/446 (removed 112) transitions.
[2024-05-27 01:37:54] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 334 rows 1980 cols
[2024-05-27 01:37:54] [INFO ] Computed 1652 invariants in 12 ms
[2024-05-27 01:37:55] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1980/2907 places, 334/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1180 ms. Remains : 1980/2907 places, 334/446 transitions.
Built C files in :
/tmp/ltsmin16125921459050448115
[2024-05-27 01:37:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16125921459050448115
Running compilation step : cd /tmp/ltsmin16125921459050448115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1887 ms.
Running link step : cd /tmp/ltsmin16125921459050448115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16125921459050448115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10363188709669023953.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 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 210 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:38:11] [INFO ] Computed 2464 invariants in 331 ms
[2024-05-27 01:38:15] [INFO ] Implicit Places using invariants in 4407 ms returned []
[2024-05-27 01:38:15] [INFO ] Invariant cache hit.
[2024-05-27 01:38:23] [INFO ] Implicit Places using invariants and state equation in 8453 ms returned []
Implicit Place search using SMT with State Equation took 12864 ms to find 0 implicit places.
[2024-05-27 01:38:23] [INFO ] Invariant cache hit.
[2024-05-27 01:38:24] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14181 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin1192492110704026928
[2024-05-27 01:38:25] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1192492110704026928
Running compilation step : cd /tmp/ltsmin1192492110704026928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1938 ms.
Running link step : cd /tmp/ltsmin1192492110704026928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1192492110704026928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6645512072947091452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:38:40] [INFO ] Flatten gal took : 70 ms
[2024-05-27 01:38:40] [INFO ] Flatten gal took : 60 ms
[2024-05-27 01:38:40] [INFO ] Time to serialize gal into /tmp/LTL3575380847357737137.gal : 9 ms
[2024-05-27 01:38:40] [INFO ] Time to serialize properties into /tmp/LTL10584373485850589621.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3575380847357737137.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16007986591530118096.hoa' '-atoms' '/tmp/LTL10584373485850589621.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10584373485850589621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16007986591530118096.hoa
Detected timeout of ITS tools.
[2024-05-27 01:38:55] [INFO ] Flatten gal took : 59 ms
[2024-05-27 01:38:55] [INFO ] Flatten gal took : 59 ms
[2024-05-27 01:38:55] [INFO ] Time to serialize gal into /tmp/LTL786054512360839715.gal : 8 ms
[2024-05-27 01:38:55] [INFO ] Time to serialize properties into /tmp/LTL12792283204822610909.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL786054512360839715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12792283204822610909.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(s6_14<1)")))))
Formula 0 simplified : XXF!"(s6_14<1)"
Detected timeout of ITS tools.
[2024-05-27 01:39:10] [INFO ] Flatten gal took : 57 ms
[2024-05-27 01:39:10] [INFO ] Applying decomposition
[2024-05-27 01:39:10] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph17072279163573955535.txt' '-o' '/tmp/graph17072279163573955535.bin' '-w' '/tmp/graph17072279163573955535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17072279163573955535.bin' '-l' '-1' '-v' '-w' '/tmp/graph17072279163573955535.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:39:10] [INFO ] Decomposing Gal with order
[2024-05-27 01:39:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:39:11] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-27 01:39:11] [INFO ] Flatten gal took : 164 ms
[2024-05-27 01:39:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 56 ms.
[2024-05-27 01:39:11] [INFO ] Time to serialize gal into /tmp/LTL10819412000269756864.gal : 19 ms
[2024-05-27 01:39:11] [INFO ] Time to serialize properties into /tmp/LTL8340356837298344570.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10819412000269756864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8340356837298344570.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(u17.s6_14<1)")))))
Formula 0 simplified : XXF!"(u17.s6_14<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10527779176840338575
[2024-05-27 01:39:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10527779176840338575
Running compilation step : cd /tmp/ltsmin10527779176840338575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1811 ms.
Running link step : cd /tmp/ltsmin10527779176840338575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10527779176840338575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 144925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1 U G(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-05
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 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.15 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 452 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-27 01:39:42] [INFO ] Computed 2464 invariants in 33 ms
[2024-05-27 01:39:46] [INFO ] Implicit Places using invariants in 3836 ms returned []
[2024-05-27 01:39:46] [INFO ] Invariant cache hit.
[2024-05-27 01:39:52] [INFO ] Implicit Places using invariants and state equation in 6334 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2606, 2607, 2608, 2609, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2824]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 10180 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 211 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10845 ms. Remains : 2845/2936 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s149 1)) (AND (GEQ s0 1) (GEQ s148 1)) (AND (GEQ s0 1) (GEQ s147 1)) (AND (GEQ s0 1) (GEQ s153 1)) (AND (GEQ s0 1) (GEQ s152 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2808 reset in 526 ms.
Product exploration explored 100000 steps with 2810 reset in 561 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1164580 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :{}
Probabilistic random walk after 1164580 steps, saw 149036 distinct states, run finished after 3003 ms. (steps per millisecond=387 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 441 rows 2845 cols
[2024-05-27 01:39:58] [INFO ] Computed 2408 invariants in 468 ms
[2024-05-27 01:39:58] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 526 ms returned sat
[2024-05-27 01:40:00] [INFO ] After 1959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:40:00] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 514 ms returned sat
[2024-05-27 01:40:02] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 01:40:02] [INFO ] After 1399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 204 ms.
[2024-05-27 01:40:02] [INFO ] After 2555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 150 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 111 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 194 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-27 01:40:03] [INFO ] Invariant cache hit.
[2024-05-27 01:40:06] [INFO ] Implicit Places using invariants in 3726 ms returned []
[2024-05-27 01:40:06] [INFO ] Invariant cache hit.
[2024-05-27 01:40:14] [INFO ] Implicit Places using invariants and state equation in 7668 ms returned []
Implicit Place search using SMT with State Equation took 11398 ms to find 0 implicit places.
[2024-05-27 01:40:14] [INFO ] Invariant cache hit.
[2024-05-27 01:40:15] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12668 ms. Remains : 2845/2845 places, 441/441 transitions.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1109081 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{}
Probabilistic random walk after 1109081 steps, saw 141681 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 01:40:19] [INFO ] Invariant cache hit.
[2024-05-27 01:40:20] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 518 ms returned sat
[2024-05-27 01:40:21] [INFO ] After 1930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:40:22] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 515 ms returned sat
[2024-05-27 01:40:23] [INFO ] After 1059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 01:40:23] [INFO ] After 1339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 206 ms.
[2024-05-27 01:40:24] [INFO ] After 2490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 149 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 109 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 116 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 2814 reset in 553 ms.
Product exploration explored 100000 steps with 2815 reset in 562 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 241 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-27 01:40:26] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-27 01:40:26] [INFO ] Invariant cache hit.
[2024-05-27 01:40:27] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1385 ms. Remains : 2845/2845 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin12704352644229740186
[2024-05-27 01:40:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12704352644229740186
Running compilation step : cd /tmp/ltsmin12704352644229740186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1866 ms.
Running link step : cd /tmp/ltsmin12704352644229740186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12704352644229740186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3515728165601471495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 196 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-27 01:40:42] [INFO ] Invariant cache hit.
[2024-05-27 01:40:46] [INFO ] Implicit Places using invariants in 3870 ms returned []
[2024-05-27 01:40:46] [INFO ] Invariant cache hit.
[2024-05-27 01:40:54] [INFO ] Implicit Places using invariants and state equation in 7591 ms returned []
Implicit Place search using SMT with State Equation took 11467 ms to find 0 implicit places.
[2024-05-27 01:40:54] [INFO ] Invariant cache hit.
[2024-05-27 01:40:55] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12748 ms. Remains : 2845/2845 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin12122993651994723458
[2024-05-27 01:40:55] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12122993651994723458
Running compilation step : cd /tmp/ltsmin12122993651994723458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1872 ms.
Running link step : cd /tmp/ltsmin12122993651994723458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12122993651994723458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7714965123401127490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:41:10] [INFO ] Flatten gal took : 55 ms
[2024-05-27 01:41:10] [INFO ] Flatten gal took : 53 ms
[2024-05-27 01:41:10] [INFO ] Time to serialize gal into /tmp/LTL6414739229351707818.gal : 7 ms
[2024-05-27 01:41:10] [INFO ] Time to serialize properties into /tmp/LTL9995641252381175711.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6414739229351707818.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5330376331391259412.hoa' '-atoms' '/tmp/LTL9995641252381175711.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9995641252381175711.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5330376331391259412.hoa
Detected timeout of ITS tools.
[2024-05-27 01:41:25] [INFO ] Flatten gal took : 56 ms
[2024-05-27 01:41:25] [INFO ] Flatten gal took : 57 ms
[2024-05-27 01:41:25] [INFO ] Time to serialize gal into /tmp/LTL1208964236819325331.gal : 8 ms
[2024-05-27 01:41:25] [INFO ] Time to serialize properties into /tmp/LTL1339562282851460832.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1208964236819325331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1339562282851460832.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((malicious_reservoir>=1)&&(s3_24>=1))||((malicious_reservoir>=1)&&(s3_23>=1)))||(((malicious_reservoir>=1)&&(s3_22>=1)...2826
Formula 0 simplified : F(!"((((((s6_0<1)&&(s6_1<1))&&((s6_4<1)&&(s6_5<1)))&&(((s6_2<1)&&(s6_8<1))&&((s6_3<1)&&(s6_6<1))))&&((((s6_9<1)&&(s6_12<1))&&((s6_7<...2815
Detected timeout of ITS tools.
[2024-05-27 01:41:40] [INFO ] Flatten gal took : 56 ms
[2024-05-27 01:41:40] [INFO ] Applying decomposition
[2024-05-27 01:41:40] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6681014543233053765.txt' '-o' '/tmp/graph6681014543233053765.bin' '-w' '/tmp/graph6681014543233053765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6681014543233053765.bin' '-l' '-1' '-v' '-w' '/tmp/graph6681014543233053765.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:41:40] [INFO ] Decomposing Gal with order
[2024-05-27 01:41:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:41:41] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-27 01:41:41] [INFO ] Flatten gal took : 169 ms
[2024-05-27 01:41:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 53 ms.
[2024-05-27 01:41:41] [INFO ] Time to serialize gal into /tmp/LTL10293565699655456681.gal : 16 ms
[2024-05-27 01:41:41] [INFO ] Time to serialize properties into /tmp/LTL8266023290595767029.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10293565699655456681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8266023290595767029.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((u0.malicious_reservoir>=1)&&(i58.u45.s3_24>=1))||((u0.malicious_reservoir>=1)&&(i42.u46.s3_23>=1)))||(((u0.malicious_...3573
Formula 0 simplified : F(!"((((((u1.s6_0<1)&&(u2.s6_1<1))&&((u3.s6_4<1)&&(u4.s6_5<1)))&&(((u5.s6_2<1)&&(u7.s6_8<1))&&((u6.s6_3<1)&&(u9.s6_6<1))))&&((((u8.s...3562
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12468162142299990836
[2024-05-27 01:41:56] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12468162142299990836
Running compilation step : cd /tmp/ltsmin12468162142299990836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1800 ms.
Running link step : cd /tmp/ltsmin12468162142299990836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12468162142299990836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp0==true) U [](!(LTLAPp0==true))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 149931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-14
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0, p0]
Support contains 1 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 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.9 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 2008 transition count 331
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 2008 transition count 331
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 117 place count 2006 transition count 329
Applied a total of 117 rules in 350 ms. Remains 2006 /2936 variables (removed 930) and now considering 329/446 (removed 117) transitions.
// Phase 1: matrix 329 rows 2006 cols
[2024-05-27 01:42:12] [INFO ] Computed 1680 invariants in 21 ms
[2024-05-27 01:42:14] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2024-05-27 01:42:14] [INFO ] Invariant cache hit.
[2024-05-27 01:42:19] [INFO ] Implicit Places using invariants and state equation in 5021 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7373 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1948/2936 places, 329/446 transitions.
Applied a total of 0 rules in 118 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7841 ms. Remains : 1948/2936 places, 329/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s2 1)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 2814 reset in 353 ms.
Product exploration explored 100000 steps with 2813 reset in 378 ms.
Computed a total of 1948 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1948 transition count 329
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 p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Incomplete random walk after 10000 steps, including 282 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 8 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2254978 steps, run timeout after 3001 ms. (steps per millisecond=751 ) properties seen :{}
Probabilistic random walk after 2254978 steps, saw 284347 distinct states, run finished after 3001 ms. (steps per millisecond=751 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 329 rows 1948 cols
[2024-05-27 01:42:23] [INFO ] Computed 1624 invariants in 23 ms
[2024-05-27 01:42:24] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 314 ms returned sat
[2024-05-27 01:42:24] [INFO ] After 545ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 01:42:24] [INFO ] After 614ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-27 01:42:25] [INFO ] After 1211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0, p0]
Support contains 1 out of 1948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1948/1948 places, 329/329 transitions.
Applied a total of 0 rules in 97 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2024-05-27 01:42:25] [INFO ] Invariant cache hit.
[2024-05-27 01:42:27] [INFO ] Implicit Places using invariants in 2067 ms returned []
[2024-05-27 01:42:27] [INFO ] Invariant cache hit.
[2024-05-27 01:42:31] [INFO ] Implicit Places using invariants and state equation in 3774 ms returned []
Implicit Place search using SMT with State Equation took 5856 ms to find 0 implicit places.
[2024-05-27 01:42:31] [INFO ] Invariant cache hit.
[2024-05-27 01:42:32] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6623 ms. Remains : 1948/1948 places, 329/329 transitions.
Computed a total of 1948 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1948 transition count 329
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 p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p0, p0, p0]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2243882 steps, run timeout after 3001 ms. (steps per millisecond=747 ) properties seen :{}
Probabilistic random walk after 2243882 steps, saw 283333 distinct states, run finished after 3001 ms. (steps per millisecond=747 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 01:42:35] [INFO ] Invariant cache hit.
[2024-05-27 01:42:36] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 303 ms returned sat
[2024-05-27 01:42:36] [INFO ] After 573ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 01:42:36] [INFO ] After 647ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-27 01:42:36] [INFO ] After 1245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 154 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 111 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 124 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 2816 reset in 365 ms.
Product exploration explored 100000 steps with 2817 reset in 376 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[true, p0, p0, p0]
Support contains 1 out of 1948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1948/1948 places, 329/329 transitions.
Applied a total of 0 rules in 112 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2024-05-27 01:42:38] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-27 01:42:38] [INFO ] Invariant cache hit.
[2024-05-27 01:42:39] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 869 ms. Remains : 1948/1948 places, 329/329 transitions.
Built C files in :
/tmp/ltsmin9101639424033211754
[2024-05-27 01:42:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9101639424033211754
Running compilation step : cd /tmp/ltsmin9101639424033211754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1213 ms.
Running link step : cd /tmp/ltsmin9101639424033211754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9101639424033211754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8085144114090833623.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1948/1948 places, 329/329 transitions.
Applied a total of 0 rules in 100 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2024-05-27 01:42:54] [INFO ] Invariant cache hit.
[2024-05-27 01:42:56] [INFO ] Implicit Places using invariants in 2207 ms returned []
[2024-05-27 01:42:56] [INFO ] Invariant cache hit.
[2024-05-27 01:43:00] [INFO ] Implicit Places using invariants and state equation in 3708 ms returned []
Implicit Place search using SMT with State Equation took 5919 ms to find 0 implicit places.
[2024-05-27 01:43:00] [INFO ] Invariant cache hit.
[2024-05-27 01:43:01] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6707 ms. Remains : 1948/1948 places, 329/329 transitions.
Built C files in :
/tmp/ltsmin9099280091275560152
[2024-05-27 01:43:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9099280091275560152
Running compilation step : cd /tmp/ltsmin9099280091275560152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1188 ms.
Running link step : cd /tmp/ltsmin9099280091275560152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9099280091275560152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16271447311139245116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:43:16] [INFO ] Flatten gal took : 39 ms
[2024-05-27 01:43:16] [INFO ] Flatten gal took : 38 ms
[2024-05-27 01:43:16] [INFO ] Time to serialize gal into /tmp/LTL17664800845369482147.gal : 6 ms
[2024-05-27 01:43:16] [INFO ] Time to serialize properties into /tmp/LTL633101846761036780.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17664800845369482147.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4133660911626549983.hoa' '-atoms' '/tmp/LTL633101846761036780.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL633101846761036780.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4133660911626549983.hoa
Detected timeout of ITS tools.
[2024-05-27 01:43:31] [INFO ] Flatten gal took : 38 ms
[2024-05-27 01:43:31] [INFO ] Flatten gal took : 38 ms
[2024-05-27 01:43:31] [INFO ] Time to serialize gal into /tmp/LTL2497790653399627001.gal : 5 ms
[2024-05-27 01:43:31] [INFO ] Time to serialize properties into /tmp/LTL11898937813374258114.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2497790653399627001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11898937813374258114.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(s6_14<1)")))))
Formula 0 simplified : XXF!"(s6_14<1)"
Detected timeout of ITS tools.
[2024-05-27 01:43:46] [INFO ] Flatten gal took : 39 ms
[2024-05-27 01:43:46] [INFO ] Applying decomposition
[2024-05-27 01:43:46] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16801305434621311968.txt' '-o' '/tmp/graph16801305434621311968.bin' '-w' '/tmp/graph16801305434621311968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16801305434621311968.bin' '-l' '-1' '-v' '-w' '/tmp/graph16801305434621311968.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:43:46] [INFO ] Decomposing Gal with order
[2024-05-27 01:43:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:43:46] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-27 01:43:46] [INFO ] Flatten gal took : 79 ms
[2024-05-27 01:43:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 29 ms.
[2024-05-27 01:43:46] [INFO ] Time to serialize gal into /tmp/LTL17938181510268520247.gal : 9 ms
[2024-05-27 01:43:46] [INFO ] Time to serialize properties into /tmp/LTL11946869293460902825.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17938181510268520247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11946869293460902825.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(u2.s6_14<1)")))))
Formula 0 simplified : XXF!"(u2.s6_14<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16576399739609511252
[2024-05-27 01:44:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16576399739609511252
Running compilation step : cd /tmp/ltsmin16576399739609511252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1223 ms.
Running link step : cd /tmp/ltsmin16576399739609511252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16576399739609511252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 125576 ms.
[2024-05-27 01:44:17] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8691263308666316473
[2024-05-27 01:44:17] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-27 01:44:17] [INFO ] Applying decomposition
[2024-05-27 01:44:17] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:44:17] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-27 01:44:17] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:44:17] [INFO ] Flatten gal took : 57 ms
[2024-05-27 01:44:17] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-27 01:44:17] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:44:17] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8691263308666316473
Running compilation step : cd /tmp/ltsmin8691263308666316473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2193158711018897361.txt' '-o' '/tmp/graph2193158711018897361.bin' '-w' '/tmp/graph2193158711018897361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2193158711018897361.bin' '-l' '-1' '-v' '-w' '/tmp/graph2193158711018897361.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:44:17] [INFO ] Decomposing Gal with order
[2024-05-27 01:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:44:17] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-27 01:44:17] [INFO ] Flatten gal took : 153 ms
[2024-05-27 01:44:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 67 ms.
[2024-05-27 01:44:17] [INFO ] Time to serialize gal into /tmp/LTLFireability17219871250115174131.gal : 21 ms
[2024-05-27 01:44:17] [INFO ] Time to serialize properties into /tmp/LTLFireability1454886989597948195.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17219871250115174131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1454886989597948195.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !(((X("(i51.i0.u88.a3>=1)"))||(F("(i51.i0.u89.a1>=1)"))))
Formula 0 simplified : X!"(i51.i0.u88.a3>=1)" & G!"(i51.i0.u89.a1>=1)"
Compilation finished in 2112 ms.
Running link step : cd /tmp/ltsmin8691263308666316473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8691263308666316473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8691263308666316473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8691263308666316473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.051: LTL layer: formula: [](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))
pins2lts-mc-linux64( 0/ 8), 0.052: "[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.076: buchi has 4 states
pins2lts-mc-linux64( 2/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.093: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.428: DFS-FIFO for weak LTL, using special progress label 452
pins2lts-mc-linux64( 0/ 8), 0.428: There are 453 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.428: State length is 2937, there are 453 groups
pins2lts-mc-linux64( 0/ 8), 0.428: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.428: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.428: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.428: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.775: ~1 levels ~960 states ~26336 transitions
pins2lts-mc-linux64( 3/ 8), 1.042: ~1 levels ~1920 states ~64264 transitions
pins2lts-mc-linux64( 7/ 8), 1.470: ~1 levels ~3840 states ~115376 transitions
pins2lts-mc-linux64( 2/ 8), 2.153: ~1 levels ~7680 states ~221784 transitions
pins2lts-mc-linux64( 2/ 8), 3.169: ~1 levels ~15360 states ~454696 transitions
pins2lts-mc-linux64( 7/ 8), 6.032: ~1 levels ~30720 states ~1108608 transitions
pins2lts-mc-linux64( 7/ 8), 11.454: ~1 levels ~61440 states ~1900320 transitions
pins2lts-mc-linux64( 7/ 8), 24.925: ~1 levels ~122880 states ~4111832 transitions
pins2lts-mc-linux64( 2/ 8), 47.584: ~1 levels ~245760 states ~8858024 transitions
pins2lts-mc-linux64( 1/ 8), 81.626: ~1 levels ~491520 states ~17690120 transitions
pins2lts-mc-linux64( 1/ 8), 161.066: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 161.742:
pins2lts-mc-linux64( 0/ 8), 161.742: mean standard work distribution: 11.5% (states) 18.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 161.742:
pins2lts-mc-linux64( 0/ 8), 161.742: Explored 632637 states 27576437 transitions, fanout: 43.590
pins2lts-mc-linux64( 0/ 8), 161.742: Total exploration time 161.310 sec (160.620 sec minimum, 160.997 sec on average)
pins2lts-mc-linux64( 0/ 8), 161.742: States per second: 3922, Transitions per second: 170953
pins2lts-mc-linux64( 0/ 8), 161.742:
pins2lts-mc-linux64( 0/ 8), 161.742: Progress states detected: 8450960
pins2lts-mc-linux64( 0/ 8), 161.742: Redundant explorations: -92.5141
pins2lts-mc-linux64( 0/ 8), 161.742:
pins2lts-mc-linux64( 0/ 8), 161.742: Queue width: 8B, total height: 10450470, memory: 79.73MB
pins2lts-mc-linux64( 0/ 8), 161.742: Tree memory: 320.5MB, 39.8 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 161.742: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 161.742: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 161.742: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 161.742: Est. total memory use: 400.2MB (~1103.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8691263308666316473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8691263308666316473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==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.
[2024-05-27 02:09:28] [INFO ] Flatten gal took : 444 ms
[2024-05-27 02:09:28] [INFO ] Time to serialize gal into /tmp/LTLFireability12602658507877476779.gal : 31 ms
[2024-05-27 02:09:28] [INFO ] Time to serialize properties into /tmp/LTLFireability10317627215918864683.ltl : 6 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12602658507877476779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10317627215918864683.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !(((X("(a3>=1)"))||(F("(a1>=1)"))))
Formula 0 simplified : X!"(a3>=1)" & G!"(a1>=1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 138412 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11453124 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-PT-28"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-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 r329-tall-171662361500063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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