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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 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 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716762279033

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-COL-18
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 22:24:40] [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-26 22:24:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:24:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 22:24:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:24:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 707 ms
[2024-05-26 22:24:41] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:24:41] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-26 22:24:41] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10004 steps, including 367 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 166 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 204 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:24:42] [INFO ] Computed 5 invariants in 5 ms
[2024-05-26 22:24:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 22:24:42] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:12
[2024-05-26 22:24:42] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:12
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-26 22:24:42] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:12
[2024-05-26 22:24:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 22:24:42] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-26 22:24:43] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-26 22:24:43] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 13 properties in 29 ms.
[2024-05-26 22:24:43] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:24:43] [INFO ] Flatten gal took : 4 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:24:43] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 18 ms.
[2024-05-26 22:24:43] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 1339 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1397 transition count 296
Applied a total of 1 rules in 15 ms. Remains 1397 /1398 variables (removed 1) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1397 cols
[2024-05-26 22:24:43] [INFO ] Computed 1102 invariants in 61 ms
[2024-05-26 22:24:43] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-26 22:24:43] [INFO ] Invariant cache hit.
[2024-05-26 22:24:44] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
[2024-05-26 22:24:44] [INFO ] Invariant cache hit.
[2024-05-26 22:24:45] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1397/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1930 ms. Remains : 1397/1398 places, 296/296 transitions.
Support contains 1339 out of 1397 places after structural reductions.
[2024-05-26 22:24:45] [INFO ] Flatten gal took : 84 ms
[2024-05-26 22:24:45] [INFO ] Flatten gal took : 64 ms
[2024-05-26 22:24:45] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 1338 out of 1397 places (down from 1339) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 443 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) 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 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) 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 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) 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 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-26 22:24:46] [INFO ] Invariant cache hit.
[2024-05-26 22:24:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-26 22:24:47] [INFO ] [Real]Absence check using 3 positive and 1099 generalized place invariants in 187 ms returned sat
[2024-05-26 22:24:47] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-26 22:24:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-26 22:24:47] [INFO ] [Nat]Absence check using 3 positive and 1099 generalized place invariants in 171 ms returned sat
[2024-05-26 22:25:02] [INFO ] After 13734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-26 22:25:12] [INFO ] After 23692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-26 22:25:12] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Finished Parikh walk after 104 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=20 )
Parikh walk visited 19 properties in 40 ms.
Computed a total of 1397 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 transition count 296
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(X(G(p0))))'
Support contains 361 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 113 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:25:12] [INFO ] Computed 1062 invariants in 37 ms
[2024-05-26 22:25:13] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-05-26 22:25:14] [INFO ] Invariant cache hit.
[2024-05-26 22:25:16] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3539 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1397 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3690 ms. Remains : 1337/1397 places, 296/296 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 262 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s745 s746 s747 s748 s749 s750...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-00 finished in 4014 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||G(p1))))'
Support contains 76 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9603 edges and 1397 vertex of which 1355 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.16 ms
Discarding 42 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1354 transition count 293
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1354 transition count 293
Applied a total of 4 rules in 221 ms. Remains 1354 /1397 variables (removed 43) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1354 cols
[2024-05-26 22:25:16] [INFO ] Computed 1063 invariants in 34 ms
[2024-05-26 22:25:18] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2024-05-26 22:25:18] [INFO ] Invariant cache hit.
[2024-05-26 22:25:20] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned [1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3584 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1397 places, 293/296 transitions.
Applied a total of 0 rules in 55 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3861 ms. Remains : 1335/1397 places, 293/296 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 3 (ADD s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1138 s1139 s1140)), p0:(AND (LEQ 2 (ADD s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10756 reset in 493 ms.
Product exploration explored 100000 steps with 10775 reset in 407 ms.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 1335 cols
[2024-05-26 22:25:22] [INFO ] Computed 1044 invariants in 19 ms
[2024-05-26 22:25:22] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 22:25:22] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 168 ms returned sat
[2024-05-26 22:25:23] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 22:25:23] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-26 22:25:23] [INFO ] After 1331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND 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 : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-26 22:25:23] [INFO ] Invariant cache hit.
[2024-05-26 22:25:25] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1165 ms returned sat
[2024-05-26 22:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:25:29] [INFO ] [Real]Absence check using state equation in 4103 ms returned sat
[2024-05-26 22:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:25:31] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1281 ms returned sat
[2024-05-26 22:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:25:35] [INFO ] [Nat]Absence check using state equation in 4469 ms returned sat
[2024-05-26 22:25:35] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 25 ms.
[2024-05-26 22:25:35] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 52 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-26 22:25:36] [INFO ] Invariant cache hit.
[2024-05-26 22:25:37] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2024-05-26 22:25:37] [INFO ] Invariant cache hit.
[2024-05-26 22:25:39] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2024-05-26 22:25:39] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-26 22:25:39] [INFO ] Invariant cache hit.
[2024-05-26 22:25:39] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3828 ms. Remains : 1335/1335 places, 293/293 transitions.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 22:25:40] [INFO ] Invariant cache hit.
[2024-05-26 22:25:40] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 22:25:40] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 170 ms returned sat
[2024-05-26 22:25:41] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 22:25:41] [INFO ] After 905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2024-05-26 22:25:41] [INFO ] After 1382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-26 22:25:42] [INFO ] Invariant cache hit.
[2024-05-26 22:25:44] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1174 ms returned sat
[2024-05-26 22:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:25:48] [INFO ] [Real]Absence check using state equation in 4076 ms returned sat
[2024-05-26 22:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:25:49] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1239 ms returned sat
[2024-05-26 22:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:25:53] [INFO ] [Nat]Absence check using state equation in 4173 ms returned sat
[2024-05-26 22:25:53] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 23 ms.
[2024-05-26 22:25:54] [INFO ] Added : 0 causal constraints over 0 iterations in 114 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10807 reset in 393 ms.
Product exploration explored 100000 steps with 10865 reset in 404 ms.
Built C files in :
/tmp/ltsmin6515572932549596900
[2024-05-26 22:25:54] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-26 22:25:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:25:54] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-26 22:25:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:25:54] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-26 22:25:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:25:55] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6515572932549596900
Running compilation step : cd /tmp/ltsmin6515572932549596900;'/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 1145 ms.
Running link step : cd /tmp/ltsmin6515572932549596900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6515572932549596900;'/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/stateBased14865115417040721637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 55 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-26 22:26:10] [INFO ] Invariant cache hit.
[2024-05-26 22:26:11] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2024-05-26 22:26:11] [INFO ] Invariant cache hit.
[2024-05-26 22:26:13] [INFO ] Implicit Places using invariants and state equation in 2127 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2024-05-26 22:26:13] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-26 22:26:13] [INFO ] Invariant cache hit.
[2024-05-26 22:26:13] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3884 ms. Remains : 1335/1335 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin11337103855727931255
[2024-05-26 22:26:13] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-26 22:26:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:13] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-26 22:26:13] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:13] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-26 22:26:13] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:13] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11337103855727931255
Running compilation step : cd /tmp/ltsmin11337103855727931255;'/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 1110 ms.
Running link step : cd /tmp/ltsmin11337103855727931255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11337103855727931255;'/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/stateBased4315753390132802321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:26:29] [INFO ] Flatten gal took : 46 ms
[2024-05-26 22:26:29] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:26:29] [INFO ] Time to serialize gal into /tmp/LTL14086795840577576982.gal : 10 ms
[2024-05-26 22:26:29] [INFO ] Time to serialize properties into /tmp/LTL13945526703314105100.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/LTL14086795840577576982.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15664267602694939797.hoa' '-atoms' '/tmp/LTL13945526703314105100.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...320
Loading property file /tmp/LTL13945526703314105100.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15664267602694939797.hoa
Detected timeout of ITS tools.
[2024-05-26 22:26:44] [INFO ] Flatten gal took : 62 ms
[2024-05-26 22:26:44] [INFO ] Flatten gal took : 37 ms
[2024-05-26 22:26:44] [INFO ] Time to serialize gal into /tmp/LTL8153443422213045400.gal : 7 ms
[2024-05-26 22:26:44] [INFO ] Time to serialize properties into /tmp/LTL8647525719130280330.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/LTL8153443422213045400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8647525719130280330.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("((((((n3_0+n3_1)+(n3_2+n3_3))+((n3_4+n3_5)+(n3_6+n3_7)))+(((n3_8+n3_9)+(n3_10+n3_11))+((n3_12+n3_13)+(n3_14+n3_15))))+((n3_16...711
Formula 0 simplified : G(!"(((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+((n1_16+n...705
Detected timeout of ITS tools.
[2024-05-26 22:26:59] [INFO ] Flatten gal took : 69 ms
[2024-05-26 22:26:59] [INFO ] Applying decomposition
[2024-05-26 22:26:59] [INFO ] Flatten gal took : 31 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/graph8064275809799001084.txt' '-o' '/tmp/graph8064275809799001084.bin' '-w' '/tmp/graph8064275809799001084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8064275809799001084.bin' '-l' '-1' '-v' '-w' '/tmp/graph8064275809799001084.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:26:59] [INFO ] Decomposing Gal with order
[2024-05-26 22:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:26:59] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-26 22:26:59] [INFO ] Flatten gal took : 181 ms
[2024-05-26 22:27:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 317 labels/synchronizations in 120 ms.
[2024-05-26 22:27:00] [INFO ] Time to serialize gal into /tmp/LTL10244699639820047221.gal : 15 ms
[2024-05-26 22:27:00] [INFO ] Time to serialize properties into /tmp/LTL2449935520039454651.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/LTL10244699639820047221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2449935520039454651.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 : !((F((G("((((((gu15.n3_0+gu15.n3_1)+(gu15.n3_2+gu15.n3_3))+((gu15.n3_4+gu15.n3_5)+(gu15.n3_6+gu15.n3_7)))+(((gu15.n3_8+gu15.n3_9)+(gu1...1091
Formula 0 simplified : G(!"(((((((gu28.n1_0+gu28.n1_1)+(gu28.n1_2+gu28.n1_3))+((gu28.n1_4+gu28.n1_5)+(gu28.n1_6+gu28.n1_7)))+(((gu28.n1_8+gu28.n1_9)+(gu28....1085
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14594582768888006146
[2024-05-26 22:27:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14594582768888006146
Running compilation step : cd /tmp/ltsmin14594582768888006146;'/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 867 ms.
Running link step : cd /tmp/ltsmin14594582768888006146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14594582768888006146;'/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-COL-18-LTLCardinality-02 finished in 134051 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 20 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9603 edges and 1397 vertex of which 1336 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.7 ms
Discarding 61 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 1334 transition count 292
Applied a total of 3 rules in 107 ms. Remains 1334 /1397 variables (removed 63) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-05-26 22:27:30] [INFO ] Computed 1044 invariants in 18 ms
[2024-05-26 22:27:32] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2024-05-26 22:27:32] [INFO ] Invariant cache hit.
[2024-05-26 22:27:34] [INFO ] Implicit Places using invariants and state equation in 2303 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3711 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1397 places, 292/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3866 ms. Remains : 1296/1397 places, 292/296 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-03 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 s1294 (ADD s1160 s1161 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178))], 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 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-03 finished in 3937 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 X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Support contains 59 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1376 transition count 296
Applied a total of 21 rules in 41 ms. Remains 1376 /1397 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1376 cols
[2024-05-26 22:27:34] [INFO ] Computed 1081 invariants in 20 ms
[2024-05-26 22:27:36] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2024-05-26 22:27:36] [INFO ] Invariant cache hit.
[2024-05-26 22:27:38] [INFO ] Implicit Places using invariants and state equation in 2410 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3772 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1397 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3846 ms. Remains : 1357/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 8}, { cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 9}]], initial=0, aps=[p0:(LEQ 1 s1356), p2:(LEQ (ADD s1255 s1256 s1257 s1258 s1259 s1260 s1261 s1262 s1263 s1264 s1265 s1266 s1267 s1268 s1269 s1270 s1271 s1272 s1273) s1354), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4420 reset in 306 ms.
Product exploration explored 100000 steps with 4419 reset in 284 ms.
Computed a total of 1357 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1357 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 674 steps, run visited all 1 properties in 10 ms. (steps per millisecond=67 )
Probabilistic random walk after 674 steps, saw 654 distinct states, run finished after 10 ms. (steps per millisecond=67 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1357 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1357/1357 places, 296/296 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 4 place count 1355 transition count 294
Applied a total of 4 rules in 98 ms. Remains 1355 /1357 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2024-05-26 22:27:40] [INFO ] Computed 1062 invariants in 37 ms
[2024-05-26 22:27:41] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-05-26 22:27:41] [INFO ] Invariant cache hit.
[2024-05-26 22:27:44] [INFO ] Implicit Places using invariants and state equation in 2392 ms returned []
Implicit Place search using SMT with State Equation took 3653 ms to find 0 implicit places.
[2024-05-26 22:27:44] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-26 22:27:44] [INFO ] Invariant cache hit.
[2024-05-26 22:27:44] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1355/1357 places, 294/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4244 ms. Remains : 1355/1357 places, 294/296 transitions.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 6 ms. (steps per millisecond=108 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 6 ms. (steps per millisecond=108 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4418 reset in 252 ms.
Product exploration explored 100000 steps with 4420 reset in 266 ms.
Built C files in :
/tmp/ltsmin255351644910905714
[2024-05-26 22:27:46] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-26 22:27:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:27:46] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-26 22:27:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:27:46] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-26 22:27:46] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:27:46] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin255351644910905714
Running compilation step : cd /tmp/ltsmin255351644910905714;'/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 1091 ms.
Running link step : cd /tmp/ltsmin255351644910905714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin255351644910905714;'/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/stateBased10342636993600719371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Graph (complete) has 9428 edges and 1355 vertex of which 1315 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 49 ms. Remains 1315 /1355 variables (removed 40) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-26 22:28:01] [INFO ] Computed 1026 invariants in 189 ms
[2024-05-26 22:28:02] [INFO ] Implicit Places using invariants in 1367 ms returned []
[2024-05-26 22:28:02] [INFO ] Invariant cache hit.
[2024-05-26 22:28:05] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2024-05-26 22:28:05] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-26 22:28:05] [INFO ] Invariant cache hit.
[2024-05-26 22:28:05] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1355 places, 292/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4277 ms. Remains : 1315/1355 places, 292/294 transitions.
Built C files in :
/tmp/ltsmin11388191147299487994
[2024-05-26 22:28:05] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-26 22:28:05] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:28:05] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-26 22:28:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:28:05] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-26 22:28:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:28:05] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11388191147299487994
Running compilation step : cd /tmp/ltsmin11388191147299487994;'/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 1081 ms.
Running link step : cd /tmp/ltsmin11388191147299487994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11388191147299487994;'/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/stateBased1241720753813625496.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:28:20] [INFO ] Flatten gal took : 40 ms
[2024-05-26 22:28:20] [INFO ] Flatten gal took : 34 ms
[2024-05-26 22:28:20] [INFO ] Time to serialize gal into /tmp/LTL1764692399288110043.gal : 5 ms
[2024-05-26 22:28:20] [INFO ] Time to serialize properties into /tmp/LTL12785320415481342975.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/LTL1764692399288110043.gal' '-t' 'CGAL' '-hoa' '/tmp/aut431371516879485305.hoa' '-atoms' '/tmp/LTL12785320415481342975.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/LTL12785320415481342975.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut431371516879485305.hoa
Detected timeout of ITS tools.
[2024-05-26 22:28:35] [INFO ] Flatten gal took : 31 ms
[2024-05-26 22:28:35] [INFO ] Flatten gal took : 34 ms
[2024-05-26 22:28:35] [INFO ] Time to serialize gal into /tmp/LTL7320398830490772401.gal : 5 ms
[2024-05-26 22:28:35] [INFO ] Time to serialize properties into /tmp/LTL13595963312105504801.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/LTL7320398830490772401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13595963312105504801.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 : !((("(AstopOK_0>=1)")U(X(X(G(("(AstopOK_0>=1)")||(X(G((F(G("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6...623
Formula 0 simplified : !"(AstopOK_0>=1)" R XXF(!"(AstopOK_0>=1)" & XF(GF!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_...607
Detected timeout of ITS tools.
[2024-05-26 22:28:51] [INFO ] Flatten gal took : 41 ms
[2024-05-26 22:28:51] [INFO ] Applying decomposition
[2024-05-26 22:28:51] [INFO ] Flatten gal took : 45 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/graph3685058985620456539.txt' '-o' '/tmp/graph3685058985620456539.bin' '-w' '/tmp/graph3685058985620456539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3685058985620456539.bin' '-l' '-1' '-v' '-w' '/tmp/graph3685058985620456539.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:28:51] [INFO ] Decomposing Gal with order
[2024-05-26 22:28:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:28:51] [INFO ] Removed a total of 233 redundant transitions.
[2024-05-26 22:28:51] [INFO ] Flatten gal took : 102 ms
[2024-05-26 22:28:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 29 ms.
[2024-05-26 22:28:51] [INFO ] Time to serialize gal into /tmp/LTL6162993342669209247.gal : 9 ms
[2024-05-26 22:28:51] [INFO ] Time to serialize properties into /tmp/LTL2476154405317740261.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/LTL6162993342669209247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2476154405317740261.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 : !((("(gi1.gi0.gi15.gu98.AstopOK_0>=1)")U(X(X(G(("(gi1.gi0.gi15.gu98.AstopOK_0>=1)")||(X(G((F(G("((((((gu97.s6_0+gu97.s6_1)+(gu97.s6_2+...949
Formula 0 simplified : !"(gi1.gi0.gi15.gu98.AstopOK_0>=1)" R XXF(!"(gi1.gi0.gi15.gu98.AstopOK_0>=1)" & XF(GF!"((((((gu97.s6_0+gu97.s6_1)+(gu97.s6_2+gu97.s6...933
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17285824747852502315
[2024-05-26 22:29:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17285824747852502315
Running compilation step : cd /tmp/ltsmin17285824747852502315;'/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 973 ms.
Running link step : cd /tmp/ltsmin17285824747852502315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17285824747852502315;'/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) U X(X([](((LTLAPp0==true)||X([]((<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 107132 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))||(F(!p0)&&(p1||F((G(F(p2))||(p3&&X(F(p2))))))))))'
Support contains 77 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1376 transition count 296
Applied a total of 21 rules in 43 ms. Remains 1376 /1397 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1376 cols
[2024-05-26 22:29:21] [INFO ] Computed 1082 invariants in 7 ms
[2024-05-26 22:29:23] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2024-05-26 22:29:23] [INFO ] Invariant cache hit.
[2024-05-26 22:29:25] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 3450 ms to find 0 implicit places.
[2024-05-26 22:29:25] [INFO ] Invariant cache hit.
[2024-05-26 22:29:25] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1376/1397 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3963 ms. Remains : 1376/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 243 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s1), p3:(GT (ADD s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102 s1103) (ADD s1256 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 4243 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)&&X(p1)))||(F(p1)&&F(p2))))'
Support contains 420 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 23 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:29:26] [INFO ] Computed 1062 invariants in 25 ms
[2024-05-26 22:29:26] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-05-26 22:29:26] [INFO ] Invariant cache hit.
[2024-05-26 22:29:28] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2462 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1397 places, 296/296 transitions.
Applied a total of 0 rules in 20 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2505 ms. Remains : 1337/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s0 (ADD s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s1115 s1116 s1117 s1118 s1119 s1120 s1121)), p2:(LEQ s1333 (ADD s3...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7254 reset in 381 ms.
Product exploration explored 100000 steps with 7216 reset in 406 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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) p2 p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 413 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 492 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
// Phase 1: matrix 296 rows 1337 cols
[2024-05-26 22:29:30] [INFO ] Computed 1044 invariants in 75 ms
[2024-05-26 22:29:32] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1219 ms returned sat
[2024-05-26 22:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:29:36] [INFO ] [Real]Absence check using state equation in 4391 ms returned sat
[2024-05-26 22:29:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:29:38] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1165 ms returned sat
[2024-05-26 22:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:29:46] [INFO ] [Nat]Absence check using state equation in 7791 ms returned sat
[2024-05-26 22:29:46] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 44 ms.
[2024-05-26 22:29:47] [INFO ] Added : 122 causal constraints over 25 iterations in 1561 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 20 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 294
Applied a total of 3 rules in 56 ms. Remains 1317 /1337 variables (removed 20) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1317 cols
[2024-05-26 22:29:48] [INFO ] Computed 1026 invariants in 70 ms
[2024-05-26 22:29:48] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-05-26 22:29:48] [INFO ] Invariant cache hit.
[2024-05-26 22:29:50] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2024-05-26 22:29:50] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-26 22:29:50] [INFO ] Invariant cache hit.
[2024-05-26 22:29:50] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1317/1337 places, 294/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2721 ms. Remains : 1317/1337 places, 294/296 transitions.
Computed a total of 1317 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1317 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
[2024-05-26 22:29:51] [INFO ] Invariant cache hit.
[2024-05-26 22:29:52] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 920 ms returned sat
[2024-05-26 22:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:29:55] [INFO ] [Real]Absence check using state equation in 3387 ms returned sat
[2024-05-26 22:29:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:29:57] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 939 ms returned sat
[2024-05-26 22:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:30:01] [INFO ] [Nat]Absence check using state equation in 4122 ms returned sat
[2024-05-26 22:30:01] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 61 transitions) in 26 ms.
[2024-05-26 22:30:01] [INFO ] Added : 11 causal constraints over 3 iterations in 250 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7221 reset in 350 ms.
Product exploration explored 100000 steps with 7251 reset in 367 ms.
Built C files in :
/tmp/ltsmin17821370456257460251
[2024-05-26 22:30:02] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-26 22:30:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:30:02] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-26 22:30:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:30:02] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-26 22:30:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:30:02] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17821370456257460251
Running compilation step : cd /tmp/ltsmin17821370456257460251;'/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 1089 ms.
Running link step : cd /tmp/ltsmin17821370456257460251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17821370456257460251;'/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/stateBased15647856955332334512.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1317/1317 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1316 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1315 transition count 292
Applied a total of 2 rules in 70 ms. Remains 1315 /1317 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-26 22:30:17] [INFO ] Computed 1026 invariants in 78 ms
[2024-05-26 22:30:19] [INFO ] Implicit Places using invariants in 1361 ms returned []
[2024-05-26 22:30:19] [INFO ] Invariant cache hit.
[2024-05-26 22:30:21] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3637 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1317 places, 292/294 transitions.
Applied a total of 0 rules in 41 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3748 ms. Remains : 1296/1317 places, 292/294 transitions.
Built C files in :
/tmp/ltsmin17100802055964797692
[2024-05-26 22:30:21] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-26 22:30:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:30:21] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-26 22:30:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:30:21] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-26 22:30:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:30:21] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17100802055964797692
Running compilation step : cd /tmp/ltsmin17100802055964797692;'/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 1091 ms.
Running link step : cd /tmp/ltsmin17100802055964797692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17100802055964797692;'/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/stateBased17835419612289967416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:30:36] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:30:36] [INFO ] Flatten gal took : 33 ms
[2024-05-26 22:30:36] [INFO ] Time to serialize gal into /tmp/LTL18303603221003635773.gal : 4 ms
[2024-05-26 22:30:36] [INFO ] Time to serialize properties into /tmp/LTL1856403581052010212.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/LTL18303603221003635773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12363280325250249028.hoa' '-atoms' '/tmp/LTL1856403581052010212.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/LTL1856403581052010212.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12363280325250249028.hoa
Detected timeout of ITS tools.
[2024-05-26 22:30:51] [INFO ] Flatten gal took : 29 ms
[2024-05-26 22:30:51] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:30:51] [INFO ] Time to serialize gal into /tmp/LTL9857900056538472150.gal : 4 ms
[2024-05-26 22:30:51] [INFO ] Time to serialize properties into /tmp/LTL14330226664435711034.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/LTL9857900056538472150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14330226664435711034.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((F("((((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+(((c1_8+c1_9)+(c1_10+c1_11))+((c1_12+c1_13)+(c1_14+c1_15))))+((c1_1...3821
Formula 0 simplified : X(G!"((((((c1_0+c1_1)+(c1_2+c1_3))+((c1_4+c1_5)+(c1_6+c1_7)))+(((c1_8+c1_9)+(c1_10+c1_11))+((c1_12+c1_13)+(c1_14+c1_15))))+((c1_16+c...3807
Detected timeout of ITS tools.
[2024-05-26 22:31:06] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:31:06] [INFO ] Applying decomposition
[2024-05-26 22:31:06] [INFO ] Flatten gal took : 29 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/graph3843574728122057500.txt' '-o' '/tmp/graph3843574728122057500.bin' '-w' '/tmp/graph3843574728122057500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3843574728122057500.bin' '-l' '-1' '-v' '-w' '/tmp/graph3843574728122057500.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:31:07] [INFO ] Decomposing Gal with order
[2024-05-26 22:31:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:31:07] [INFO ] Removed a total of 209 redundant transitions.
[2024-05-26 22:31:07] [INFO ] Flatten gal took : 82 ms
[2024-05-26 22:31:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 23 ms.
[2024-05-26 22:31:07] [INFO ] Time to serialize gal into /tmp/LTL2068910683056482533.gal : 10 ms
[2024-05-26 22:31:07] [INFO ] Time to serialize properties into /tmp/LTL1447552426097362467.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/LTL2068910683056482533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1447552426097362467.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((F("((((((gi0.gi0.gu30.c1_0+gi0.gi0.gu30.c1_1)+(gi0.gi0.gu30.c1_2+gi0.gi0.gu30.c1_3))+((gi0.gi0.gu30.c1_4+gi0.gi0.gu30.c1_5)+(gi...6605
Formula 0 simplified : X(G!"((((((gi0.gi0.gu30.c1_0+gi0.gi0.gu30.c1_1)+(gi0.gi0.gu30.c1_2+gi0.gi0.gu30.c1_3))+((gi0.gi0.gu30.c1_4+gi0.gi0.gu30.c1_5)+(gi0.g...6591
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17491134294279682354
[2024-05-26 22:31:22] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17491134294279682354
Running compilation step : cd /tmp/ltsmin17491134294279682354;'/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 945 ms.
Running link step : cd /tmp/ltsmin17491134294279682354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17491134294279682354;'/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))&&X((LTLAPp1==true))))||(<>((LTLAPp1==true))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-08 finished in 131515 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 20 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9603 edges and 1397 vertex of which 119 are kept as prefixes of interest. Removing 1278 places using SCC suffix rule.2 ms
Discarding 1278 places :
Also discarding 118 output transitions
Drop transitions removed 118 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 119 transition count 84
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 1 with 2 rules applied. Total rules applied 97 place count 118 transition count 83
Applied a total of 97 rules in 9 ms. Remains 118 /1397 variables (removed 1279) and now considering 83/296 (removed 213) transitions.
// Phase 1: matrix 83 rows 118 cols
[2024-05-26 22:31:37] [INFO ] Computed 36 invariants in 1 ms
[2024-05-26 22:31:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 22:31:37] [INFO ] Invariant cache hit.
[2024-05-26 22:31:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-26 22:31:37] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-26 22:31:37] [INFO ] Invariant cache hit.
[2024-05-26 22:31:37] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1397 places, 83/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 118/1397 places, 83/296 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19) s117)], 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 4317 reset in 259 ms.
Product exploration explored 100000 steps with 4316 reset in 265 ms.
Computed a total of 118 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 83
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 3469 steps, including 135 resets, run visited all 1 properties in 14 ms. (steps per millisecond=247 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 20 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 83/83 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-26 22:31:38] [INFO ] Invariant cache hit.
[2024-05-26 22:31:38] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 22:31:38] [INFO ] Invariant cache hit.
[2024-05-26 22:31:38] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-26 22:31:38] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-26 22:31:38] [INFO ] Invariant cache hit.
[2024-05-26 22:31:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 118/118 places, 83/83 transitions.
Computed a total of 118 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 83
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 393 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 675 steps, run visited all 1 properties in 5 ms. (steps per millisecond=135 )
Probabilistic random walk after 675 steps, saw 656 distinct states, run finished after 5 ms. (steps per millisecond=135 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4317 reset in 254 ms.
Product exploration explored 100000 steps with 4316 reset in 268 ms.
Built C files in :
/tmp/ltsmin6487700272577201468
[2024-05-26 22:31:40] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-26 22:31:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:40] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-26 22:31:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:40] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-26 22:31:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6487700272577201468
Running compilation step : cd /tmp/ltsmin6487700272577201468;'/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 201 ms.
Running link step : cd /tmp/ltsmin6487700272577201468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6487700272577201468;'/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/stateBased13293234101313785378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-26 22:31:55] [INFO ] Invariant cache hit.
[2024-05-26 22:31:55] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-26 22:31:55] [INFO ] Invariant cache hit.
[2024-05-26 22:31:55] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-26 22:31:55] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-26 22:31:55] [INFO ] Invariant cache hit.
[2024-05-26 22:31:55] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 118/118 places, 83/83 transitions.
Built C files in :
/tmp/ltsmin18074282817897715276
[2024-05-26 22:31:55] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-26 22:31:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:55] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-26 22:31:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:55] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-26 22:31:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18074282817897715276
Running compilation step : cd /tmp/ltsmin18074282817897715276;'/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 205 ms.
Running link step : cd /tmp/ltsmin18074282817897715276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18074282817897715276;'/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/stateBased1532443069098671101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:32:10] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:32:10] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:32:10] [INFO ] Time to serialize gal into /tmp/LTL10299335367174153198.gal : 1 ms
[2024-05-26 22:32:10] [INFO ] Time to serialize properties into /tmp/LTL8636015420128359728.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/LTL10299335367174153198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16844644131673680650.hoa' '-atoms' '/tmp/LTL8636015420128359728.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/LTL8636015420128359728.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16844644131673680650.hoa
Detected timeout of ITS tools.
[2024-05-26 22:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:32:25] [INFO ] Time to serialize gal into /tmp/LTL6366194653679485773.gal : 0 ms
[2024-05-26 22:32:25] [INFO ] Time to serialize properties into /tmp/LTL2958644570224256429.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/LTL6366194653679485773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2958644570224256429.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("((((((n4_0+n4_1)+(n4_2+n4_3))+((n4_4+n4_5)+(n4_6+n4_7)))+(((n4_8+n4_9)+(n4_10+n4_11))+((n4_12+n4_13)+(n4_14+n4_15))))+((n4_16+...185
Formula 0 simplified : GF!"((((((n4_0+n4_1)+(n4_2+n4_3))+((n4_4+n4_5)+(n4_6+n4_7)))+(((n4_8+n4_9)+(n4_10+n4_11))+((n4_12+n4_13)+(n4_14+n4_15))))+((n4_16+n4...179
Detected timeout of ITS tools.
[2024-05-26 22:32:40] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:32:40] [INFO ] Applying decomposition
[2024-05-26 22:32:40] [INFO ] Flatten gal took : 3 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/graph12408975476550074341.txt' '-o' '/tmp/graph12408975476550074341.bin' '-w' '/tmp/graph12408975476550074341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12408975476550074341.bin' '-l' '-1' '-v' '-w' '/tmp/graph12408975476550074341.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:32:40] [INFO ] Decomposing Gal with order
[2024-05-26 22:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:32:40] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-26 22:32:40] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 3 ms.
[2024-05-26 22:32:40] [INFO ] Time to serialize gal into /tmp/LTL9991535996122680598.gal : 1 ms
[2024-05-26 22:32:40] [INFO ] Time to serialize properties into /tmp/LTL6946030226971946291.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/LTL9991535996122680598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6946030226971946291.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("((((((gu1.n4_0+gu1.n4_1)+(gu1.n4_2+gu1.n4_3))+((gu1.n4_4+gu1.n4_5)+(gu1.n4_6+gu1.n4_7)))+(((gu1.n4_8+gu1.n4_9)+(gu1.n4_10+gu1....265
Formula 0 simplified : GF!"((((((gu1.n4_0+gu1.n4_1)+(gu1.n4_2+gu1.n4_3))+((gu1.n4_4+gu1.n4_5)+(gu1.n4_6+gu1.n4_7)))+(((gu1.n4_8+gu1.n4_9)+(gu1.n4_10+gu1.n4...259
Reverse transition relation is NOT exact ! Due to transitions gu0.t94, gi2.gi11.gu31.t134, gi2.gi13.gu34.t137, gi2.t294_t136, t95, t96, t97, t98, t99, t100...345
Computing Next relation with stutter on 1.70579e+08 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
912 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.15078,233616,1,0,536,844057,160,413,7454,1.04896e+06,926
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 73538 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||F((p1&&X(p2)&&F(!p2))))))'
Support contains 382 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1357 transition count 296
Applied a total of 40 rules in 18 ms. Remains 1357 /1397 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-26 22:32:51] [INFO ] Computed 1063 invariants in 56 ms
[2024-05-26 22:32:52] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2024-05-26 22:32:52] [INFO ] Invariant cache hit.
[2024-05-26 22:32:55] [INFO ] Implicit Places using invariants and state equation in 2840 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 4075 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1397 places, 296/296 transitions.
Applied a total of 0 rules in 20 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4113 ms. Remains : 1338/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), true, (NOT p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 s0), p1:(LEQ s1 (ADD s1161 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178 s1179)), p2:(GT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 4298 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))'
Support contains 19 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9603 edges and 1397 vertex of which 1336 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.4 ms
Discarding 61 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 1333 transition count 291
Applied a total of 5 rules in 87 ms. Remains 1333 /1397 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-26 22:32:55] [INFO ] Computed 1044 invariants in 26 ms
[2024-05-26 22:32:56] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2024-05-26 22:32:56] [INFO ] Invariant cache hit.
[2024-05-26 22:32:59] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3878 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1397 places, 291/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4009 ms. Remains : 1295/1397 places, 291/296 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1217 s1218 s1219 s1220 s1221 s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1230 s1231 s1232 s1233 s1234 s1235))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-12 finished in 4075 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 741 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 12 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:32:59] [INFO ] Computed 1062 invariants in 22 ms
[2024-05-26 22:33:00] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-26 22:33:00] [INFO ] Invariant cache hit.
[2024-05-26 22:33:01] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2063 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1397 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2088 ms. Remains : 1337/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102) (ADD s362 s363 s364 s365 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-13 finished in 2252 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((X(F(p1))||p0))))'
Support contains 38 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9603 edges and 1397 vertex of which 1336 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.4 ms
Discarding 61 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 1333 transition count 291
Applied a total of 5 rules in 88 ms. Remains 1333 /1397 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-26 22:33:01] [INFO ] Computed 1044 invariants in 18 ms
[2024-05-26 22:33:03] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2024-05-26 22:33:03] [INFO ] Invariant cache hit.
[2024-05-26 22:33:05] [INFO ] Implicit Places using invariants and state equation in 2370 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3674 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1397 places, 291/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3803 ms. Remains : 1295/1397 places, 291/296 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 (ADD s1274 s1275 s1276 s1277 s1278 s1279 s1280 s1281 s1282 s1283 s1284 s1285 s1286 s1287 s1288 s1289 s1290 s1291 s1292)) (LEQ 2 (ADD s1198 s...], 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 4202 reset in 391 ms.
Product exploration explored 100000 steps with 4211 reset in 378 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 256 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 300 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 291 rows 1295 cols
[2024-05-26 22:33:07] [INFO ] Computed 1008 invariants in 143 ms
[2024-05-26 22:33:08] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 689 ms returned sat
[2024-05-26 22:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:33:10] [INFO ] [Real]Absence check using state equation in 1991 ms returned sat
[2024-05-26 22:33:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:33:11] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 677 ms returned sat
[2024-05-26 22:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:33:14] [INFO ] [Nat]Absence check using state equation in 2996 ms returned sat
[2024-05-26 22:33:14] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 26 ms.
[2024-05-26 22:33:14] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 38 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 46 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-05-26 22:33:14] [INFO ] Invariant cache hit.
[2024-05-26 22:33:16] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2024-05-26 22:33:16] [INFO ] Invariant cache hit.
[2024-05-26 22:33:18] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
[2024-05-26 22:33:18] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-26 22:33:18] [INFO ] Invariant cache hit.
[2024-05-26 22:33:18] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3989 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 266 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 305 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 p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-26 22:33:19] [INFO ] Invariant cache hit.
[2024-05-26 22:33:21] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 735 ms returned sat
[2024-05-26 22:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:33:23] [INFO ] [Real]Absence check using state equation in 2245 ms returned sat
[2024-05-26 22:33:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:33:24] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 704 ms returned sat
[2024-05-26 22:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:33:26] [INFO ] [Nat]Absence check using state equation in 2493 ms returned sat
[2024-05-26 22:33:27] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 23 ms.
[2024-05-26 22:33:27] [INFO ] Added : 0 causal constraints over 0 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4208 reset in 352 ms.
Product exploration explored 100000 steps with 4214 reset in 364 ms.
Built C files in :
/tmp/ltsmin10074582386512414904
[2024-05-26 22:33:27] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2024-05-26 22:33:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:33:27] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2024-05-26 22:33:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:33:27] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2024-05-26 22:33:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:33:27] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10074582386512414904
Running compilation step : cd /tmp/ltsmin10074582386512414904;'/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 1103 ms.
Running link step : cd /tmp/ltsmin10074582386512414904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10074582386512414904;'/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/stateBased11581014846638356971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 38 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 44 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-05-26 22:33:43] [INFO ] Invariant cache hit.
[2024-05-26 22:33:44] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-05-26 22:33:44] [INFO ] Invariant cache hit.
[2024-05-26 22:33:46] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2024-05-26 22:33:46] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-26 22:33:46] [INFO ] Invariant cache hit.
[2024-05-26 22:33:47] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3983 ms. Remains : 1295/1295 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin9855387440061701241
[2024-05-26 22:33:47] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2024-05-26 22:33:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:33:47] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2024-05-26 22:33:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:33:47] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2024-05-26 22:33:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:33:47] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9855387440061701241
Running compilation step : cd /tmp/ltsmin9855387440061701241;'/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 1095 ms.
Running link step : cd /tmp/ltsmin9855387440061701241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9855387440061701241;'/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/stateBased61029670685635755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:34:02] [INFO ] Flatten gal took : 25 ms
[2024-05-26 22:34:02] [INFO ] Flatten gal took : 25 ms
[2024-05-26 22:34:02] [INFO ] Time to serialize gal into /tmp/LTL18083663605926831650.gal : 4 ms
[2024-05-26 22:34:02] [INFO ] Time to serialize properties into /tmp/LTL2886345477471941683.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/LTL18083663605926831650.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5604791065354782842.hoa' '-atoms' '/tmp/LTL2886345477471941683.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/LTL2886345477471941683.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5604791065354782842.hoa
Detected timeout of ITS tools.
[2024-05-26 22:34:17] [INFO ] Flatten gal took : 24 ms
[2024-05-26 22:34:17] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:34:17] [INFO ] Time to serialize gal into /tmp/LTL841780607497085914.gal : 8 ms
[2024-05-26 22:34:17] [INFO ] Time to serialize properties into /tmp/LTL1856355521437569045.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/LTL841780607497085914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1856355521437569045.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((s6_1...484
Formula 0 simplified : G(F!"(((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((s6_16+...474
Detected timeout of ITS tools.
[2024-05-26 22:34:32] [INFO ] Flatten gal took : 35 ms
[2024-05-26 22:34:32] [INFO ] Applying decomposition
[2024-05-26 22:34:32] [INFO ] Flatten gal took : 25 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/graph7737322696053597352.txt' '-o' '/tmp/graph7737322696053597352.bin' '-w' '/tmp/graph7737322696053597352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7737322696053597352.bin' '-l' '-1' '-v' '-w' '/tmp/graph7737322696053597352.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:34:32] [INFO ] Decomposing Gal with order
[2024-05-26 22:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:34:32] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-26 22:34:32] [INFO ] Flatten gal took : 52 ms
[2024-05-26 22:34:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 17 ms.
[2024-05-26 22:34:32] [INFO ] Time to serialize gal into /tmp/LTL15175973321441308469.gal : 7 ms
[2024-05-26 22:34:32] [INFO ] Time to serialize properties into /tmp/LTL1345932570100836739.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/LTL15175973321441308469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1345932570100836739.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 : !((F(G(("(((((((gu64.s6_0+gu64.s6_1)+(gu64.s6_2+gu64.s6_3))+((gu64.s6_4+gu64.s6_5)+(gu64.s6_6+gu64.s6_7)))+(((gu64.s6_8+gu64.s6_9)+(gu...769
Formula 0 simplified : G(F!"(((((((gu64.s6_0+gu64.s6_1)+(gu64.s6_2+gu64.s6_3))+((gu64.s6_4+gu64.s6_5)+(gu64.s6_6+gu64.s6_7)))+(((gu64.s6_8+gu64.s6_9)+(gu64...759
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6002685613253317849
[2024-05-26 22:34:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6002685613253317849
Running compilation step : cd /tmp/ltsmin6002685613253317849;'/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 921 ms.
Running link step : cd /tmp/ltsmin6002685613253317849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6002685613253317849;'/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(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-14 finished in 121270 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((G(p0) U p1)))'
Support contains 382 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1357 transition count 296
Applied a total of 40 rules in 18 ms. Remains 1357 /1397 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-26 22:35:02] [INFO ] Computed 1063 invariants in 25 ms
[2024-05-26 22:35:03] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-26 22:35:03] [INFO ] Invariant cache hit.
[2024-05-26 22:35:06] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3076 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1397 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3114 ms. Remains : 1338/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s1 s1337), p0:(LEQ (ADD s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1138 s1139 s1140 s1141) (ADD s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 723 ms.
Product exploration explored 100000 steps with 50000 reset in 731 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (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))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-15 finished in 5114 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||G(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' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-18-LTLCardinality-04
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 59 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9603 edges and 1397 vertex of which 1376 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.6 ms
Discarding 21 places :
Also discarding 0 output 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 1374 transition count 294
Applied a total of 5 rules in 85 ms. Remains 1374 /1397 variables (removed 23) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1374 cols
[2024-05-26 22:35:08] [INFO ] Computed 1081 invariants in 13 ms
[2024-05-26 22:35:10] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-05-26 22:35:10] [INFO ] Invariant cache hit.
[2024-05-26 22:35:12] [INFO ] Implicit Places using invariants and state equation in 2378 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3639 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1355/1397 places, 294/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1355 /1355 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3766 ms. Remains : 1355/1397 places, 294/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 8}, { cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 9}]], initial=0, aps=[p0:(LEQ 1 s1354), p2:(LEQ (ADD s1255 s1256 s1257 s1258 s1259 s1260 s1261 s1262 s1263 s1264 s1265 s1266 s1267 s1268 s1269 s1270 s1271 s1272 s1273) s1352), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4418 reset in 260 ms.
Product exploration explored 100000 steps with 4418 reset in 277 ms.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 440 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 5 ms. (steps per millisecond=130 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1355 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Applied a total of 0 rules in 45 ms. Remains 1355 /1355 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2024-05-26 22:35:14] [INFO ] Computed 1062 invariants in 28 ms
[2024-05-26 22:35:15] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2024-05-26 22:35:15] [INFO ] Invariant cache hit.
[2024-05-26 22:35:17] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 3547 ms to find 0 implicit places.
[2024-05-26 22:35:17] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-26 22:35:17] [INFO ] Invariant cache hit.
[2024-05-26 22:35:18] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4054 ms. Remains : 1355/1355 places, 294/294 transitions.
Computed a total of 1355 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 294
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 441 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 43 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 653 steps, run visited all 1 properties in 5 ms. (steps per millisecond=130 )
Probabilistic random walk after 653 steps, saw 634 distinct states, run finished after 6 ms. (steps per millisecond=108 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4426 reset in 244 ms.
Product exploration explored 100000 steps with 4422 reset in 260 ms.
Built C files in :
/tmp/ltsmin6437444478105022160
[2024-05-26 22:35:19] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-26 22:35:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:35:19] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-26 22:35:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:35:19] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-26 22:35:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:35:19] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6437444478105022160
Running compilation step : cd /tmp/ltsmin6437444478105022160;'/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 1129 ms.
Running link step : cd /tmp/ltsmin6437444478105022160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6437444478105022160;'/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/stateBased2647321213289638892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 294/294 transitions.
Graph (complete) has 9428 edges and 1355 vertex of which 1315 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 47 ms. Remains 1315 /1355 variables (removed 40) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2024-05-26 22:35:34] [INFO ] Computed 1026 invariants in 79 ms
[2024-05-26 22:35:35] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2024-05-26 22:35:35] [INFO ] Invariant cache hit.
[2024-05-26 22:35:38] [INFO ] Implicit Places using invariants and state equation in 2352 ms returned []
Implicit Place search using SMT with State Equation took 3625 ms to find 0 implicit places.
[2024-05-26 22:35:38] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-26 22:35:38] [INFO ] Invariant cache hit.
[2024-05-26 22:35:38] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1355 places, 292/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4131 ms. Remains : 1315/1355 places, 292/294 transitions.
Built C files in :
/tmp/ltsmin11557309756177933168
[2024-05-26 22:35:38] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-26 22:35:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:35:38] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-26 22:35:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:35:38] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-26 22:35:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:35:38] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11557309756177933168
Running compilation step : cd /tmp/ltsmin11557309756177933168;'/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 1040 ms.
Running link step : cd /tmp/ltsmin11557309756177933168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11557309756177933168;'/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/stateBased13658369783179608375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:35:53] [INFO ] Flatten gal took : 26 ms
[2024-05-26 22:35:53] [INFO ] Flatten gal took : 26 ms
[2024-05-26 22:35:53] [INFO ] Time to serialize gal into /tmp/LTL8343175177297171645.gal : 4 ms
[2024-05-26 22:35:53] [INFO ] Time to serialize properties into /tmp/LTL5763571623695376551.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/LTL8343175177297171645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14416401907263474439.hoa' '-atoms' '/tmp/LTL5763571623695376551.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/LTL5763571623695376551.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14416401907263474439.hoa
Detected timeout of ITS tools.
[2024-05-26 22:36:08] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:36:08] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:36:08] [INFO ] Time to serialize gal into /tmp/LTL5787245394004797816.gal : 4 ms
[2024-05-26 22:36:08] [INFO ] Time to serialize properties into /tmp/LTL5777365391647773092.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/LTL5787245394004797816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5777365391647773092.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 : !((("(AstopOK_0>=1)")U(X(X(G(("(AstopOK_0>=1)")||(X(G((F(G("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6...623
Formula 0 simplified : !"(AstopOK_0>=1)" R XXF(!"(AstopOK_0>=1)" & XF(GF!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_...607
Detected timeout of ITS tools.
[2024-05-26 22:36:23] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:36:23] [INFO ] Applying decomposition
[2024-05-26 22:36:24] [INFO ] Flatten gal took : 28 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/graph6263723387945385904.txt' '-o' '/tmp/graph6263723387945385904.bin' '-w' '/tmp/graph6263723387945385904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6263723387945385904.bin' '-l' '-1' '-v' '-w' '/tmp/graph6263723387945385904.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:36:24] [INFO ] Decomposing Gal with order
[2024-05-26 22:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:36:24] [INFO ] Removed a total of 235 redundant transitions.
[2024-05-26 22:36:24] [INFO ] Flatten gal took : 53 ms
[2024-05-26 22:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 26 ms.
[2024-05-26 22:36:24] [INFO ] Time to serialize gal into /tmp/LTL17335998379499325139.gal : 9 ms
[2024-05-26 22:36:24] [INFO ] Time to serialize properties into /tmp/LTL11318445932239690821.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/LTL17335998379499325139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11318445932239690821.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 : !((("(gi1.gi0.gu98.AstopOK_0>=1)")U(X(X(G(("(gi1.gi0.gu98.AstopOK_0>=1)")||(X(G((F(G("((((((gu96.s6_0+gu96.s6_1)+(gu96.s6_2+gu96.s6_3)...1019
Formula 0 simplified : !"(gi1.gi0.gu98.AstopOK_0>=1)" R XXF(!"(gi1.gi0.gu98.AstopOK_0>=1)" & XF(GF!"((((((gu96.s6_0+gu96.s6_1)+(gu96.s6_2+gu96.s6_3))+((gu9...1003
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12018368437097558997
[2024-05-26 22:36:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12018368437097558997
Running compilation step : cd /tmp/ltsmin12018368437097558997;'/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 975 ms.
Running link step : cd /tmp/ltsmin12018368437097558997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12018368437097558997;'/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) U X(X([](((LTLAPp0==true)||X([]((<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 106317 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)&&X(p1)))||(F(p1)&&F(p2))))'
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((X(F(p1))||p0))))'
[2024-05-26 22:36:54] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7309973907446311832
[2024-05-26 22:36:54] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-26 22:36:54] [INFO ] Applying decomposition
[2024-05-26 22:36:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:36:54] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-26 22:36:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:36:54] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-26 22:36:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:36:54] [INFO ] Flatten gal took : 29 ms
[2024-05-26 22:36:54] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7309973907446311832
Running compilation step : cd /tmp/ltsmin7309973907446311832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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/graph705903052589483447.txt' '-o' '/tmp/graph705903052589483447.bin' '-w' '/tmp/graph705903052589483447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph705903052589483447.bin' '-l' '-1' '-v' '-w' '/tmp/graph705903052589483447.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:36:54] [INFO ] Decomposing Gal with order
[2024-05-26 22:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:36:55] [INFO ] Removed a total of 169 redundant transitions.
[2024-05-26 22:36:55] [INFO ] Flatten gal took : 46 ms
[2024-05-26 22:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 3 ms.
[2024-05-26 22:36:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality13320968502368369761.gal : 6 ms
[2024-05-26 22:36:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality1393219235131764817.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/LTLCardinality13320968502368369761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1393219235131764817.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...298
Read 4 LTL properties
Checking formula 0 : !((F(("(((((((gu4.n1_0+gu4.n1_1)+(gu4.n1_2+gu4.n1_3))+((gu4.n1_4+gu4.n1_5)+(gu4.n1_6+gu4.n1_7)))+(((gu4.n1_8+gu4.n1_9)+(gu4.n1_10+gu4....1053
Formula 0 simplified : G(!"(((((((gu4.n1_0+gu4.n1_1)+(gu4.n1_2+gu4.n1_3))+((gu4.n1_4+gu4.n1_5)+(gu4.n1_6+gu4.n1_7)))+(((gu4.n1_8+gu4.n1_9)+(gu4.n1_10+gu4.n...1047
Compilation finished in 1137 ms.
Running link step : cd /tmp/ltsmin7309973907446311832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7309973907446311832;'/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'
LTSmin run took 79880 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7309973907446311832;'/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) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: LTL layer: formula: ((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))
pins2lts-mc-linux64( 5/ 8), 0.022: "((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.022: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.189: There are 307 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.189: State length is 1398, there are 320 groups
pins2lts-mc-linux64( 0/ 8), 0.189: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.189: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.189: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.189: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.283: [Blue] ~22 levels ~960 states ~4232 transitions
pins2lts-mc-linux64( 0/ 8), 0.333: [Blue] ~22 levels ~1920 states ~8360 transitions
pins2lts-mc-linux64( 6/ 8), 0.398: [Blue] ~23 levels ~3840 states ~16096 transitions
pins2lts-mc-linux64( 6/ 8), 0.528: [Blue] ~23 levels ~7680 states ~34936 transitions
pins2lts-mc-linux64( 4/ 8), 0.758: [Blue] ~27 levels ~15360 states ~62464 transitions
pins2lts-mc-linux64( 7/ 8), 1.176: [Blue] ~25 levels ~30720 states ~136776 transitions
pins2lts-mc-linux64( 4/ 8), 1.925: [Blue] ~27 levels ~61440 states ~293224 transitions
pins2lts-mc-linux64( 7/ 8), 3.374: [Blue] ~25 levels ~122880 states ~609408 transitions
pins2lts-mc-linux64( 5/ 8), 6.156: [Blue] ~28 levels ~245760 states ~1295632 transitions
pins2lts-mc-linux64( 7/ 8), 11.338: [Blue] ~25 levels ~491520 states ~2726568 transitions
pins2lts-mc-linux64( 7/ 8), 21.036: [Blue] ~25 levels ~983040 states ~5841568 transitions
pins2lts-mc-linux64( 4/ 8), 40.115: [Blue] ~27 levels ~1966080 states ~12697792 transitions
pins2lts-mc-linux64( 7/ 8), 78.501: [Blue] ~26 levels ~3932160 states ~26247408 transitions
pins2lts-mc-linux64( 7/ 8), 157.934: [Blue] ~26 levels ~7864320 states ~55751104 transitions
pins2lts-mc-linux64( 0/ 8), 210.218: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 210.308:
pins2lts-mc-linux64( 0/ 8), 210.308: Explored 9218679 states 68776812 transitions, fanout: 7.461
pins2lts-mc-linux64( 0/ 8), 210.308: Total exploration time 210.100 sec (210.010 sec minimum, 210.051 sec on average)
pins2lts-mc-linux64( 0/ 8), 210.308: States per second: 43878, Transitions per second: 327353
pins2lts-mc-linux64( 0/ 8), 210.308:
pins2lts-mc-linux64( 0/ 8), 210.308: State space has 9219672 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 210.308: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 210.308: blue states: 9218679 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 210.308: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 210.308: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 210.308:
pins2lts-mc-linux64( 0/ 8), 210.308: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 210.308:
pins2lts-mc-linux64( 0/ 8), 210.308: Queue width: 8B, total height: 211, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 210.308: Tree memory: 326.3MB, 37.1 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 210.308: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 210.308: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 210.308: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 210.308: Est. total memory use: 326.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7309973907446311832;'/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) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7309973907446311832;'/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) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==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-26 23:01:11] [INFO ] Applying decomposition
[2024-05-26 23:01:11] [INFO ] Flatten gal took : 350 ms
[2024-05-26 23:01:11] [INFO ] Decomposing Gal with order
[2024-05-26 23:01:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:01:12] [INFO ] Removed a total of 263 redundant transitions.
[2024-05-26 23:01:12] [INFO ] Flatten gal took : 394 ms
[2024-05-26 23:01:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 107 ms.
[2024-05-26 23:01:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality6191376720515622839.gal : 41 ms
[2024-05-26 23:01:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality11456324289292239378.ltl : 5 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/LTLCardinality6191376720515622839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11456324289292239378.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...298
Read 3 LTL properties
Checking formula 0 : !((("(gAstopOK.AstopOK_0>=1)")U(X(X(G(("(gAstopOK.AstopOK_0>=1)")||(X(G((F(G("((((((gtsid0.s6_0+gtsid1.s6_1)+(gtsid2.s6_2+gtsid3.s6_3)...1071
Formula 0 simplified : !"(gAstopOK.AstopOK_0>=1)" R XXF(!"(gAstopOK.AstopOK_0>=1)" & XF(GF!"((((((gtsid0.s6_0+gtsid1.s6_1)+(gtsid2.s6_2+gtsid3.s6_3))+((gts...1055
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 137340 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11592004 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-COL-18"
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-COL-18, 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-171662361300017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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