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-171662361500062.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361500062
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716773321895

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 01:28:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 01:28:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:28:43] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-27 01:28:43] [INFO ] Transformed 2998 places.
[2024-05-27 01:28:43] [INFO ] Transformed 446 transitions.
[2024-05-27 01:28:43] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 93 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1924 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 2939 transition count 446
Applied a total of 59 rules in 136 ms. Remains 2939 /2998 variables (removed 59) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2939 cols
[2024-05-27 01:28:44] [INFO ] Computed 2494 invariants in 153 ms
[2024-05-27 01:28:45] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2024-05-27 01:28:45] [INFO ] Invariant cache hit.
[2024-05-27 01:29:11] [INFO ] Implicit Places using invariants and state equation in 26363 ms returned [1971, 1972, 1974, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 27740 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2910/2998 places, 446/446 transitions.
Applied a total of 0 rules in 42 ms. Remains 2910 /2910 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27919 ms. Remains : 2910/2998 places, 446/446 transitions.
Support contains 1924 out of 2910 places after structural reductions.
[2024-05-27 01:29:12] [INFO ] Flatten gal took : 204 ms
[2024-05-27 01:29:12] [INFO ] Flatten gal took : 128 ms
[2024-05-27 01:29:12] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 1056 out of 2910 places (down from 1924) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 26) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 446 rows 2910 cols
[2024-05-27 01:29:13] [INFO ] Computed 2465 invariants in 56 ms
[2024-05-27 01:29:14] [INFO ] After 1067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-27 01:29:16] [INFO ] [Nat]Absence check using 0 positive and 2465 generalized place invariants in 552 ms returned sat
[2024-05-27 01:29:39] [INFO ] After 22608ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2024-05-27 01:29:39] [INFO ] After 22613ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :13
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-27 01:29:39] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :13
Fused 16 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 87 ms.
Support contains 65 out of 2910 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Graph (complete) has 28544 edges and 2910 vertex of which 1199 are kept as prefixes of interest. Removing 1711 places using SCC suffix rule.10 ms
Discarding 1711 places :
Also discarding 84 output transitions
Drop transitions removed 84 transitions
Drop transitions removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 28 places :
Implicit places reduction removed 28 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 1171 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 206 place count 1170 transition count 186
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 206 place count 1170 transition count 159
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 105 rules applied. Total rules applied 311 place count 1092 transition count 159
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 367 place count 1064 transition count 131
Applied a total of 367 rules in 135 ms. Remains 1064 /2910 variables (removed 1846) and now considering 131/446 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 1064/2910 places, 131/446 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 131 rows 1064 cols
[2024-05-27 01:29:40] [INFO ] Computed 933 invariants in 8 ms
[2024-05-27 01:29:40] [INFO ] [Real]Absence check using 0 positive and 933 generalized place invariants in 152 ms returned sat
[2024-05-27 01:29:40] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2910 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2910 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' '!(F(G(p0)))'
Support contains 29 out of 2910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Graph (complete) has 28544 edges and 2910 vertex of which 2036 are kept as prefixes of interest. Removing 874 places using SCC suffix rule.23 ms
Discarding 874 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 1978 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1978 transition count 329
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 1976 transition count 327
Applied a total of 119 rules in 440 ms. Remains 1976 /2910 variables (removed 934) and now considering 327/446 (removed 119) transitions.
// Phase 1: matrix 327 rows 1976 cols
[2024-05-27 01:29:41] [INFO ] Computed 1652 invariants in 31 ms
[2024-05-27 01:29:43] [INFO ] Implicit Places using invariants in 2239 ms returned []
[2024-05-27 01:29:43] [INFO ] Invariant cache hit.
[2024-05-27 01:29:47] [INFO ] Implicit Places using invariants and state equation in 3589 ms returned [1659, 1660, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1679, 1680, 1681, 1682, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1897]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 5839 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1947/2910 places, 327/446 transitions.
Applied a total of 0 rules in 120 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6401 ms. Remains : 1947/2910 places, 327/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 129 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s114 s115 s116 s117 s118 s119 s120 s121 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 ...], 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 2811 reset in 542 ms.
Product exploration explored 100000 steps with 2816 reset in 486 ms.
Computed a total of 1947 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1947 transition count 327
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 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-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-00 finished in 7913 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))&&F(p1))))'
Support contains 61 out of 2910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Graph (complete) has 28544 edges and 2910 vertex of which 2067 are kept as prefixes of interest. Removing 843 places using SCC suffix rule.11 ms
Discarding 843 places :
Also discarding 0 output transitions
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 2039 transition count 390
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 2039 transition count 390
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 59 place count 2038 transition count 389
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2038 transition count 389
Applied a total of 60 rules in 380 ms. Remains 2038 /2910 variables (removed 872) and now considering 389/446 (removed 57) transitions.
// Phase 1: matrix 389 rows 2038 cols
[2024-05-27 01:29:49] [INFO ] Computed 1680 invariants in 15 ms
[2024-05-27 01:29:51] [INFO ] Implicit Places using invariants in 2300 ms returned []
[2024-05-27 01:29:51] [INFO ] Invariant cache hit.
[2024-05-27 01:29:55] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned []
Implicit Place search using SMT with State Equation took 6120 ms to find 0 implicit places.
[2024-05-27 01:29:55] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-27 01:29:55] [INFO ] Invariant cache hit.
[2024-05-27 01:29:56] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2038/2910 places, 389/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7236 ms. Remains : 2038/2910 places, 389/446 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1883 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(OR (AND (GT s176 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-01 finished in 7444 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) U (p1||G(!p0))))'
Support contains 843 out of 2910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Graph (complete) has 28544 edges and 2910 vertex of which 2068 are kept as prefixes of interest. Removing 842 places using SCC suffix rule.11 ms
Discarding 842 places :
Also discarding 0 output 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 2011 transition count 333
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 2011 transition count 333
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 2009 transition count 331
Applied a total of 117 rules in 136 ms. Remains 2009 /2910 variables (removed 901) and now considering 331/446 (removed 115) transitions.
// Phase 1: matrix 331 rows 2009 cols
[2024-05-27 01:29:56] [INFO ] Computed 1680 invariants in 38 ms
[2024-05-27 01:29:57] [INFO ] Implicit Places using invariants in 1442 ms returned []
[2024-05-27 01:29:57] [INFO ] Invariant cache hit.
[2024-05-27 01:30:00] [INFO ] Implicit Places using invariants and state equation in 2575 ms returned [1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1682, 1683, 1684, 1685, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 4027 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1980/2910 places, 331/446 transitions.
Applied a total of 0 rules in 56 ms. Remains 1980 /1980 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4221 ms. Remains : 1980/2910 places, 331/446 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) p0), (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s3), p0:(LEQ s1834 (ADD s987 s988 s989 s990 s991 s992 s993 s994 s995 s996 s997 s998 s999 s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3122 reset in 2840 ms.
Product exploration explored 100000 steps with 3111 reset in 2790 ms.
Computed a total of 1980 stabilizing places and 331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1980 transition count 331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 9 factoid took 315 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p1)), (NOT p0), p0, true]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 331 rows 1980 cols
[2024-05-27 01:30:07] [INFO ] Computed 1652 invariants in 45 ms
[2024-05-27 01:30:08] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:30:08] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 313 ms returned sat
[2024-05-27 01:30:14] [INFO ] After 5533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 01:30:16] [INFO ] After 7753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16617 ms.
[2024-05-27 01:30:33] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 91 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-02 finished in 37208 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((F(p1)&&X(G(p2))))&&p0)))'
Support contains 88 out of 2910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2907 transition count 446
Applied a total of 3 rules in 157 ms. Remains 2907 /2910 variables (removed 3) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:30:34] [INFO ] Computed 2464 invariants in 284 ms
[2024-05-27 01:30:38] [INFO ] Implicit Places using invariants in 4288 ms returned []
[2024-05-27 01:30:38] [INFO ] Invariant cache hit.
[2024-05-27 01:30:45] [INFO ] Implicit Places using invariants and state equation in 7397 ms returned []
Implicit Place search using SMT with State Equation took 11688 ms to find 0 implicit places.
[2024-05-27 01:30:45] [INFO ] Invariant cache hit.
[2024-05-27 01:30:46] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2907/2910 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12926 ms. Remains : 2907/2910 places, 446/446 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(LEQ (ADD s2560 s2561 s2562 s2563 s2564 s2565 s2566 s2567 s2568 s2569 s2570 s2571 s2572 s2573 s2574 s2575 s2580 s2581 s2582 s2583 s2811 s2812 s2813 s28...], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-04 finished in 13163 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' '!(((p0 U p1)||X((G(p2)||F(p3)))))'
Support contains 61 out of 2910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2909 transition count 446
Applied a total of 1 rules in 174 ms. Remains 2909 /2910 variables (removed 1) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2024-05-27 01:30:46] [INFO ] Computed 2464 invariants in 54 ms
[2024-05-27 01:30:50] [INFO ] Implicit Places using invariants in 3917 ms returned []
[2024-05-27 01:30:50] [INFO ] Invariant cache hit.
[2024-05-27 01:30:59] [INFO ] Implicit Places using invariants and state equation in 8433 ms returned []
Implicit Place search using SMT with State Equation took 12357 ms to find 0 implicit places.
[2024-05-27 01:30:59] [INFO ] Invariant cache hit.
[2024-05-27 01:31:00] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2909/2910 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13592 ms. Remains : 2909/2910 places, 446/446 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p3:(GT 3 (ADD s116 s117 s118 s119 s120 s121 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s148 s149 s150 s151 s152 s153 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2102 ms.
Product exploration explored 100000 steps with 50000 reset in 2130 ms.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 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 p3 (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X p3)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 21 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-05 finished in 18501 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)))'
Support contains 871 out of 2910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2907 transition count 446
Applied a total of 3 rules in 78 ms. Remains 2907 /2910 variables (removed 3) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-27 01:31:05] [INFO ] Computed 2464 invariants in 351 ms
[2024-05-27 01:31:08] [INFO ] Implicit Places using invariants in 3297 ms returned []
[2024-05-27 01:31:08] [INFO ] Invariant cache hit.
[2024-05-27 01:31:16] [INFO ] Implicit Places using invariants and state equation in 7490 ms returned []
Implicit Place search using SMT with State Equation took 10788 ms to find 0 implicit places.
[2024-05-27 01:31:16] [INFO ] Invariant cache hit.
[2024-05-27 01:31:17] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2907/2910 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11883 ms. Remains : 2907/2910 places, 446/446 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s0 (ADD s1885 s1886 s1887 s1888 s1889 s1890 s1891 s1892 s1893 s1894 s1895 s1896 s1897 s1898 s1899 s1900 s1901 s1902 s1903 s1904 s1905 s1906 s1907 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-07 finished in 12034 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)))'
Support contains 1 out of 2910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2907 transition count 446
Applied a total of 3 rules in 147 ms. Remains 2907 /2910 variables (removed 3) and now considering 446/446 (removed 0) transitions.
[2024-05-27 01:31:17] [INFO ] Invariant cache hit.
[2024-05-27 01:31:21] [INFO ] Implicit Places using invariants in 4012 ms returned []
[2024-05-27 01:31:21] [INFO ] Invariant cache hit.
[2024-05-27 01:31:28] [INFO ] Implicit Places using invariants and state equation in 6962 ms returned []
Implicit Place search using SMT with State Equation took 10976 ms to find 0 implicit places.
[2024-05-27 01:31:28] [INFO ] Invariant cache hit.
[2024-05-27 01:31:29] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2907/2910 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12163 ms. Remains : 2907/2910 places, 446/446 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s199)], 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]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-08 finished in 12256 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(F(p0))||G(p1))))'
Support contains 5 out of 2910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Graph (complete) has 28544 edges and 2910 vertex of which 2066 are kept as prefixes of interest. Removing 844 places using SCC suffix rule.9 ms
Discarding 844 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2009 transition count 332
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2009 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
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 2007 transition count 330
Applied a total of 119 rules in 268 ms. Remains 2007 /2910 variables (removed 903) and now considering 330/446 (removed 116) transitions.
// Phase 1: matrix 330 rows 2007 cols
[2024-05-27 01:31:29] [INFO ] Computed 1680 invariants in 14 ms
[2024-05-27 01:31:31] [INFO ] Implicit Places using invariants in 2157 ms returned []
[2024-05-27 01:31:31] [INFO ] Invariant cache hit.
[2024-05-27 01:31:35] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 6049 ms to find 0 implicit places.
[2024-05-27 01:31:35] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-27 01:31:35] [INFO ] Invariant cache hit.
[2024-05-27 01:31:36] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2007/2910 places, 330/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7036 ms. Remains : 2007/2910 places, 330/446 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s87 s146), p0:(OR (LEQ 3 s63) (LEQ s1873 s1942))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3033 reset in 314 ms.
Product exploration explored 100000 steps with 3030 reset in 299 ms.
Computed a total of 2007 stabilizing places and 330 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2007 transition count 330
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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 300 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1109189 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{}
Probabilistic random walk after 1109189 steps, saw 140767 distinct states, run finished after 3002 ms. (steps per millisecond=369 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 01:31:40] [INFO ] Invariant cache hit.
[2024-05-27 01:31:41] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:31:41] [INFO ] [Nat]Absence check using 0 positive and 1680 generalized place invariants in 324 ms returned sat
[2024-05-27 01:31:42] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-27 01:31:42] [INFO ] After 653ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-27 01:31:42] [INFO ] After 1302ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 2007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2007/2007 places, 330/330 transitions.
Graph (complete) has 29148 edges and 2007 vertex of which 266 are kept as prefixes of interest. Removing 1741 places using SCC suffix rule.11 ms
Discarding 1741 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Drop transitions removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 56 places :
Implicit places reduction removed 56 places
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 210 transition count 95
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 204 place count 210 transition count 14
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 106 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 1 with 268 rules applied. Total rules applied 472 place count 23 transition count 14
Applied a total of 472 rules in 37 ms. Remains 23 /2007 variables (removed 1984) and now considering 14/330 (removed 316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 23/2007 places, 14/330 transitions.
Finished random walk after 27 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 2007 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2007/2007 places, 330/330 transitions.
Applied a total of 0 rules in 99 ms. Remains 2007 /2007 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2024-05-27 01:31:42] [INFO ] Invariant cache hit.
[2024-05-27 01:31:45] [INFO ] Implicit Places using invariants in 2266 ms returned []
[2024-05-27 01:31:45] [INFO ] Invariant cache hit.
[2024-05-27 01:31:49] [INFO ] Implicit Places using invariants and state equation in 4382 ms returned []
Implicit Place search using SMT with State Equation took 6653 ms to find 0 implicit places.
[2024-05-27 01:31:49] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-27 01:31:49] [INFO ] Invariant cache hit.
[2024-05-27 01:31:50] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7452 ms. Remains : 2007/2007 places, 330/330 transitions.
Computed a total of 2007 stabilizing places and 330 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2007 transition count 330
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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1049757 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049757 steps, saw 133371 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 01:31:53] [INFO ] Invariant cache hit.
[2024-05-27 01:31:54] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:31:54] [INFO ] [Nat]Absence check using 0 positive and 1680 generalized place invariants in 325 ms returned sat
[2024-05-27 01:31:55] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-27 01:31:55] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-27 01:31:55] [INFO ] After 1303ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 2007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2007/2007 places, 330/330 transitions.
Graph (complete) has 29148 edges and 2007 vertex of which 266 are kept as prefixes of interest. Removing 1741 places using SCC suffix rule.2 ms
Discarding 1741 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Drop transitions removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 56 places :
Implicit places reduction removed 56 places
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 210 transition count 95
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 204 place count 210 transition count 14
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 106 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 1 with 268 rules applied. Total rules applied 472 place count 23 transition count 14
Applied a total of 472 rules in 12 ms. Remains 23 /2007 variables (removed 1984) and now considering 14/330 (removed 316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 23/2007 places, 14/330 transitions.
Finished random walk after 15 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3022 reset in 289 ms.
Product exploration explored 100000 steps with 3024 reset in 305 ms.
Built C files in :
/tmp/ltsmin12279907145161922188
[2024-05-27 01:31:56] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2024-05-27 01:31:56] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:31:56] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2024-05-27 01:31:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:31:56] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2024-05-27 01:31:56] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:31:56] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12279907145161922188
Running compilation step : cd /tmp/ltsmin12279907145161922188;'/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 1471 ms.
Running link step : cd /tmp/ltsmin12279907145161922188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12279907145161922188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7408167037871469466.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 2007 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2007/2007 places, 330/330 transitions.
Applied a total of 0 rules in 91 ms. Remains 2007 /2007 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2024-05-27 01:32:11] [INFO ] Invariant cache hit.
[2024-05-27 01:32:14] [INFO ] Implicit Places using invariants in 2433 ms returned []
[2024-05-27 01:32:14] [INFO ] Invariant cache hit.
[2024-05-27 01:32:18] [INFO ] Implicit Places using invariants and state equation in 4445 ms returned []
Implicit Place search using SMT with State Equation took 6883 ms to find 0 implicit places.
[2024-05-27 01:32:18] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-27 01:32:18] [INFO ] Invariant cache hit.
[2024-05-27 01:32:19] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7662 ms. Remains : 2007/2007 places, 330/330 transitions.
Built C files in :
/tmp/ltsmin17296447362957426223
[2024-05-27 01:32:19] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2024-05-27 01:32:19] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:32:19] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2024-05-27 01:32:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:32:19] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2024-05-27 01:32:19] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:32:19] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17296447362957426223
Running compilation step : cd /tmp/ltsmin17296447362957426223;'/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 1409 ms.
Running link step : cd /tmp/ltsmin17296447362957426223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17296447362957426223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13690047256404411097.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:32:34] [INFO ] Flatten gal took : 59 ms
[2024-05-27 01:32:34] [INFO ] Flatten gal took : 57 ms
[2024-05-27 01:32:34] [INFO ] Time to serialize gal into /tmp/LTL10958274498404036065.gal : 14 ms
[2024-05-27 01:32:34] [INFO ] Time to serialize properties into /tmp/LTL14582597540809408171.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/LTL10958274498404036065.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3909050954625030164.hoa' '-atoms' '/tmp/LTL14582597540809408171.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/LTL14582597540809408171.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3909050954625030164.hoa
Detected timeout of ITS tools.
[2024-05-27 01:32:49] [INFO ] Flatten gal took : 55 ms
[2024-05-27 01:32:49] [INFO ] Flatten gal took : 48 ms
[2024-05-27 01:32:49] [INFO ] Time to serialize gal into /tmp/LTL6117462085027626932.gal : 8 ms
[2024-05-27 01:32:49] [INFO ] Time to serialize properties into /tmp/LTL2332366647587760615.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6117462085027626932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2332366647587760615.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 : !((F((G(F("((s3_0>=3)||(n6_23<=n2_15))")))||(G("(s2_6<=a1)")))))
Formula 0 simplified : G(FG!"((s3_0>=3)||(n6_23<=n2_15))" & F!"(s2_6<=a1)")
Detected timeout of ITS tools.
[2024-05-27 01:33:05] [INFO ] Flatten gal took : 47 ms
[2024-05-27 01:33:05] [INFO ] Applying decomposition
[2024-05-27 01:33:05] [INFO ] Flatten gal took : 44 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/graph795624888049085278.txt' '-o' '/tmp/graph795624888049085278.bin' '-w' '/tmp/graph795624888049085278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph795624888049085278.bin' '-l' '-1' '-v' '-w' '/tmp/graph795624888049085278.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:33:05] [INFO ] Decomposing Gal with order
[2024-05-27 01:33:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:33:05] [INFO ] Removed a total of 259 redundant transitions.
[2024-05-27 01:33:05] [INFO ] Flatten gal took : 116 ms
[2024-05-27 01:33:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 381 labels/synchronizations in 34 ms.
[2024-05-27 01:33:05] [INFO ] Time to serialize gal into /tmp/LTL16222946412095312830.gal : 11 ms
[2024-05-27 01:33:05] [INFO ] Time to serialize properties into /tmp/LTL110814448785510598.ltl : 79 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/LTL16222946412095312830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL110814448785510598.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 : !((F((G(F("((gi1.gi0.gi0.gu120.s3_0>=3)||(gu101.n6_23<=gu101.n2_15))")))||(G("(gu56.s2_6<=gu56.a1)")))))
Formula 0 simplified : G(FG!"((gi1.gi0.gi0.gu120.s3_0>=3)||(gu101.n6_23<=gu101.n2_15))" & F!"(gu56.s2_6<=gu56.a1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18218499097835462019
[2024-05-27 01:33:21] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18218499097835462019
Running compilation step : cd /tmp/ltsmin18218499097835462019;'/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 1205 ms.
Running link step : cd /tmp/ltsmin18218499097835462019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18218499097835462019;'/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' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-13 finished in 126606 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)))'
Support contains 2 out of 2910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2910/2910 places, 446/446 transitions.
Graph (complete) has 28544 edges and 2910 vertex of which 2065 are kept as prefixes of interest. Removing 845 places using SCC suffix rule.10 ms
Discarding 845 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 2038 transition count 390
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 2038 transition count 390
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 59 place count 2036 transition count 388
Applied a total of 59 rules in 288 ms. Remains 2036 /2910 variables (removed 874) and now considering 388/446 (removed 58) transitions.
// Phase 1: matrix 388 rows 2036 cols
[2024-05-27 01:33:36] [INFO ] Computed 1652 invariants in 13 ms
[2024-05-27 01:33:39] [INFO ] Implicit Places using invariants in 3299 ms returned []
[2024-05-27 01:33:39] [INFO ] Invariant cache hit.
[2024-05-27 01:33:44] [INFO ] Implicit Places using invariants and state equation in 5196 ms returned []
Implicit Place search using SMT with State Equation took 8500 ms to find 0 implicit places.
[2024-05-27 01:33:44] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-27 01:33:44] [INFO ] Invariant cache hit.
[2024-05-27 01:33:45] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2036/2910 places, 388/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9575 ms. Remains : 2036/2910 places, 388/446 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1910 s196)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6889 reset in 409 ms.
Product exploration explored 100000 steps with 6891 reset in 419 ms.
Computed a total of 2036 stabilizing places and 388 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 388
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), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-15 finished in 10845 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(F(p0))||G(p1))))'
[2024-05-27 01:33:47] [INFO ] Flatten gal took : 90 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17510281502966924054
[2024-05-27 01:33:47] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-27 01:33:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:33:47] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-27 01:33:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:33:47] [INFO ] Applying decomposition
[2024-05-27 01:33:47] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-27 01:33:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:33:47] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17510281502966924054
Running compilation step : cd /tmp/ltsmin17510281502966924054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-27 01:33:47] [INFO ] Flatten gal took : 86 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/graph12282910067692770312.txt' '-o' '/tmp/graph12282910067692770312.bin' '-w' '/tmp/graph12282910067692770312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12282910067692770312.bin' '-l' '-1' '-v' '-w' '/tmp/graph12282910067692770312.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:33:47] [INFO ] Decomposing Gal with order
[2024-05-27 01:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:33:47] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-27 01:33:47] [INFO ] Flatten gal took : 200 ms
[2024-05-27 01:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-27 01:33:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality9424787188942583901.gal : 14 ms
[2024-05-27 01:33:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality2786235251080153431.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/LTLCardinality9424787188942583901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2786235251080153431.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...297
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((gi0.gi0.gu22.s3_0>=3)||(gu62.n6_23<=gu62.n2_15))")))||(G("(gu37.s2_6<=gu37.a1)")))))
Formula 0 simplified : G(FG!"((gi0.gi0.gu22.s3_0>=3)||(gu62.n6_23<=gu62.n2_15))" & F!"(gu37.s2_6<=gu37.a1)")
Compilation finished in 2165 ms.
Running link step : cd /tmp/ltsmin17510281502966924054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17510281502966924054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-27 01:55:30] [INFO ] Flatten gal took : 212 ms
[2024-05-27 01:55:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality16183805947804763234.gal : 39 ms
[2024-05-27 01:55:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality10367767918473355107.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/LTLCardinality16183805947804763234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10367767918473355107.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 1 LTL properties
Checking formula 0 : !((F((G(F("((s3_0>=3)||(n6_23<=n2_15))")))||(G("(s2_6<=a1)")))))
Formula 0 simplified : G(FG!"((s3_0>=3)||(n6_23<=n2_15))" & F!"(s2_6<=a1)")
Detected timeout of ITS tools.
[2024-05-27 02:17:12] [INFO ] Flatten gal took : 162 ms
[2024-05-27 02:17:13] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-27 02:17:13] [INFO ] Transformed 2910 places.
[2024-05-27 02:17:13] [INFO ] Transformed 446 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 02:17:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality17009722670735768172.gal : 24 ms
[2024-05-27 02:17:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality6627714126177551453.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/LTLCardinality17009722670735768172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6627714126177551453.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F("((s3_0>=3)||(n6_23<=n2_15))")))||(G("(s2_6<=a1)")))))
Formula 0 simplified : G(FG!"((s3_0>=3)||(n6_23<=n2_15))" & F!"(s2_6<=a1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7719768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035560 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-171662361500062"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;