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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 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 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 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 72K 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-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716762249032

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-10
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 22:24:10] [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:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:24:10] [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:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:24:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 906 ms
[2024-05-26 22:24:11] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:24:11] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-26 22:24:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 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 10001 steps, including 550 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10003 steps, including 208 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:24:12] [INFO ] Computed 5 invariants in 10 ms
[2024-05-26 22:24:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 22:24:12] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-26 22:24:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 22:24:12] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2024-05-26 22:24:12] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-26 22:24:12] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 66 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 2 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 26/26 transitions.
Graph (complete) has 50 edges and 30 vertex of which 19 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 19 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 17 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 16 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 15 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 14 transition count 7
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 13 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 12 transition count 6
Applied a total of 22 rules in 12 ms. Remains 12 /30 variables (removed 18) and now considering 6/26 (removed 20) transitions.
// Phase 1: matrix 6 rows 12 cols
[2024-05-26 22:24:12] [INFO ] Computed 6 invariants in 0 ms
[2024-05-26 22:24:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 12/30 places, 6/26 transitions.
Finished random walk after 83 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-26 22:24:12] [INFO ] Flatten gal took : 34 ms
[2024-05-26 22:24:12] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:24:12] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 13 ms.
[2024-05-26 22:24:12] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 514 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 538 transition count 176
Applied a total of 12 rules in 5 ms. Remains 538 /550 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 538 cols
[2024-05-26 22:24:12] [INFO ] Computed 363 invariants in 15 ms
[2024-05-26 22:24:12] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-26 22:24:12] [INFO ] Invariant cache hit.
[2024-05-26 22:24:12] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-26 22:24:12] [INFO ] Invariant cache hit.
[2024-05-26 22:24:13] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 538/550 places, 176/176 transitions.
Support contains 514 out of 538 places after structural reductions.
[2024-05-26 22:24:13] [INFO ] Flatten gal took : 35 ms
[2024-05-26 22:24:13] [INFO ] Flatten gal took : 26 ms
[2024-05-26 22:24:13] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 382 out of 538 places (down from 514) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 23) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-26 22:24:13] [INFO ] Invariant cache hit.
[2024-05-26 22:24:13] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-26 22:24:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-26 22:24:14] [INFO ] [Nat]Absence check using 13 positive and 350 generalized place invariants in 42 ms returned sat
[2024-05-26 22:24:15] [INFO ] After 1342ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2024-05-26 22:24:16] [INFO ] After 2219ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :13
Attempting to minimize the solution found.
Minimization took 814 ms.
[2024-05-26 22:24:17] [INFO ] After 3431ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :13
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 89 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=29 )
Parikh walk visited 11 properties in 19 ms.
Support contains 24 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 261 are kept as prefixes of interest. Removing 277 places using SCC suffix rule.2 ms
Discarding 277 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
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 82 rules applied. Total rules applied 83 place count 250 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 249 transition count 83
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 84 place count 249 transition count 61
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 65 rules applied. Total rules applied 149 place count 206 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 149 place count 206 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 204 transition count 60
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 174 place count 193 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 192 transition count 48
Applied a total of 175 rules in 52 ms. Remains 192 /538 variables (removed 346) and now considering 48/176 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 192/538 places, 48/176 transitions.
Incomplete random walk after 10000 steps, including 384 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 192 cols
[2024-05-26 22:24:17] [INFO ] Computed 144 invariants in 11 ms
[2024-05-26 22:24:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 22:24:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-26 22:24:17] [INFO ] [Nat]Absence check using 12 positive and 132 generalized place invariants in 15 ms returned sat
[2024-05-26 22:24:17] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 22:24:17] [INFO ] After 156ms 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:24:17] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 538 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 538 transition count 176
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(X(X(F(p0))))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 525 transition count 176
Applied a total of 13 rules in 73 ms. Remains 525 /538 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2024-05-26 22:24:18] [INFO ] Computed 351 invariants in 16 ms
[2024-05-26 22:24:18] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-26 22:24:18] [INFO ] Invariant cache hit.
[2024-05-26 22:24:19] [INFO ] Implicit Places using invariants and state equation in 608 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 969 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/538 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1050 ms. Remains : 514/538 places, 176/176 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 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT (ADD s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474) s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-00 finished in 1366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(p2)))'
Support contains 265 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 536 transition count 176
Applied a total of 2 rules in 12 ms. Remains 536 /538 variables (removed 2) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2024-05-26 22:24:19] [INFO ] Computed 362 invariants in 15 ms
[2024-05-26 22:24:19] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-26 22:24:19] [INFO ] Invariant cache hit.
[2024-05-26 22:24:20] [INFO ] Implicit Places using invariants and state equation in 546 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 810 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 827 ms. Remains : 525/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ 2 (ADD s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485)), p1:(AND (LEQ 3 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-01 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 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 510 transition count 171
Applied a total of 5 rules in 55 ms. Remains 510 /538 variables (removed 28) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 510 cols
[2024-05-26 22:24:20] [INFO ] Computed 341 invariants in 11 ms
[2024-05-26 22:24:20] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-26 22:24:20] [INFO ] Invariant cache hit.
[2024-05-26 22:24:21] [INFO ] Implicit Places using invariants and state equation in 648 ms returned [409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 968 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/538 places, 171/176 transitions.
Applied a total of 0 rules in 34 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1057 ms. Remains : 488/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-02 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 2 s1)], 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 6784 reset in 290 ms.
Product exploration explored 100000 steps with 6777 reset in 200 ms.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 129 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 36 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 159 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
// Phase 1: matrix 171 rows 488 cols
[2024-05-26 22:24:22] [INFO ] Computed 320 invariants in 7 ms
[2024-05-26 22:24:22] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 111 ms returned sat
[2024-05-26 22:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:23] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-26 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:24:23] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 118 ms returned sat
[2024-05-26 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:23] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2024-05-26 22:24:23] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 9 ms.
[2024-05-26 22:24:23] [INFO ] Added : 1 causal constraints over 1 iterations in 105 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 20 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-26 22:24:23] [INFO ] Invariant cache hit.
[2024-05-26 22:24:24] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-26 22:24:24] [INFO ] Invariant cache hit.
[2024-05-26 22:24:24] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2024-05-26 22:24:24] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-26 22:24:24] [INFO ] Invariant cache hit.
[2024-05-26 22:24:24] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1012 ms. Remains : 488/488 places, 171/171 transitions.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 106 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 42 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 168 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-26 22:24:25] [INFO ] Invariant cache hit.
[2024-05-26 22:24:25] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 117 ms returned sat
[2024-05-26 22:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:26] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2024-05-26 22:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:24:26] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 115 ms returned sat
[2024-05-26 22:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:27] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2024-05-26 22:24:27] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 16 ms.
[2024-05-26 22:24:27] [INFO ] Added : 1 causal constraints over 1 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6774 reset in 155 ms.
Product exploration explored 100000 steps with 6770 reset in 174 ms.
Built C files in :
/tmp/ltsmin7732429182363452692
[2024-05-26 22:24:27] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2024-05-26 22:24:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:27] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2024-05-26 22:24:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:27] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2024-05-26 22:24:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:27] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7732429182363452692
Running compilation step : cd /tmp/ltsmin7732429182363452692;'/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 627 ms.
Running link step : cd /tmp/ltsmin7732429182363452692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7732429182363452692;'/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/stateBased6102748470431066195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 14 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-26 22:24:42] [INFO ] Invariant cache hit.
[2024-05-26 22:24:42] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-26 22:24:43] [INFO ] Invariant cache hit.
[2024-05-26 22:24:43] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-05-26 22:24:43] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-26 22:24:43] [INFO ] Invariant cache hit.
[2024-05-26 22:24:43] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 996 ms. Remains : 488/488 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin13894089068776905753
[2024-05-26 22:24:43] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2024-05-26 22:24:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:43] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2024-05-26 22:24:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:43] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2024-05-26 22:24:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:43] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13894089068776905753
Running compilation step : cd /tmp/ltsmin13894089068776905753;'/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 505 ms.
Running link step : cd /tmp/ltsmin13894089068776905753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13894089068776905753;'/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/stateBased2130455226578689406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:24:58] [INFO ] Flatten gal took : 19 ms
[2024-05-26 22:24:58] [INFO ] Flatten gal took : 19 ms
[2024-05-26 22:24:58] [INFO ] Time to serialize gal into /tmp/LTL1432878670788156512.gal : 5 ms
[2024-05-26 22:24:58] [INFO ] Time to serialize properties into /tmp/LTL5529330574917117329.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/LTL1432878670788156512.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9893756687585537825.hoa' '-atoms' '/tmp/LTL5529330574917117329.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/LTL5529330574917117329.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9893756687585537825.hoa
Detected timeout of ITS tools.
[2024-05-26 22:25:14] [INFO ] Flatten gal took : 19 ms
[2024-05-26 22:25:14] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:25:14] [INFO ] Time to serialize gal into /tmp/LTL381964312802330050.gal : 3 ms
[2024-05-26 22:25:14] [INFO ] Time to serialize properties into /tmp/LTL10848305333940381320.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/LTL381964312802330050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10848305333940381320.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("(SstopAbort_0>=2)"))))
Formula 0 simplified : GF!"(SstopAbort_0>=2)"
Detected timeout of ITS tools.
[2024-05-26 22:25:29] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:25:29] [INFO ] Applying decomposition
[2024-05-26 22:25:29] [INFO ] Flatten gal took : 15 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/graph11135812312504533224.txt' '-o' '/tmp/graph11135812312504533224.bin' '-w' '/tmp/graph11135812312504533224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11135812312504533224.bin' '-l' '-1' '-v' '-w' '/tmp/graph11135812312504533224.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:25:29] [INFO ] Decomposing Gal with order
[2024-05-26 22:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:25:29] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-26 22:25:29] [INFO ] Flatten gal took : 63 ms
[2024-05-26 22:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 20 ms.
[2024-05-26 22:25:29] [INFO ] Time to serialize gal into /tmp/LTL10027986647961418608.gal : 11 ms
[2024-05-26 22:25:29] [INFO ] Time to serialize properties into /tmp/LTL10539102770213060228.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/LTL10027986647961418608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10539102770213060228.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.SstopAbort_0>=2)"))))
Formula 0 simplified : GF!"(u0.SstopAbort_0>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15275595860896867649
[2024-05-26 22:25:44] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15275595860896867649
Running compilation step : cd /tmp/ltsmin15275595860896867649;'/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 396 ms.
Running link step : cd /tmp/ltsmin15275595860896867649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15275595860896867649;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-02 finished in 99129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 107 are kept as prefixes of interest. Removing 431 places using SCC suffix rule.4 ms
Discarding 431 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 107 transition count 78
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 107 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 106 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 106 transition count 77
Applied a total of 48 rules in 16 ms. Remains 106 /538 variables (removed 432) and now considering 77/176 (removed 99) transitions.
// Phase 1: matrix 77 rows 106 cols
[2024-05-26 22:25:59] [INFO ] Computed 30 invariants in 1 ms
[2024-05-26 22:25:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-26 22:25:59] [INFO ] Invariant cache hit.
[2024-05-26 22:25:59] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-26 22:25:59] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 22:25:59] [INFO ] Invariant cache hit.
[2024-05-26 22:25:59] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/538 places, 77/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 106/538 places, 77/176 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s104 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 3 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 324 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((G(p0) U X((p1||G(p2)))))))'
Support contains 13 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 7 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-26 22:25:59] [INFO ] Computed 350 invariants in 6 ms
[2024-05-26 22:26:00] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-26 22:26:00] [INFO ] Invariant cache hit.
[2024-05-26 22:26:00] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2024-05-26 22:26:00] [INFO ] Invariant cache hit.
[2024-05-26 22:26:00] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 524/538 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1008 ms. Remains : 524/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s521 (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451)), p1:(GT 1 (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451)), p2:(GT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6924 reset in 290 ms.
Product exploration explored 100000 steps with 6927 reset in 269 ms.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 548 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 752524 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{1=1, 2=1, 3=1, 4=1, 7=1, 10=1, 11=1}
Probabilistic random walk after 752524 steps, saw 103257 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :7
Running SMT prover for 5 properties.
[2024-05-26 22:26:06] [INFO ] Invariant cache hit.
[2024-05-26 22:26:06] [INFO ] [Real]Absence check using 0 positive and 350 generalized place invariants in 48 ms returned sat
[2024-05-26 22:26:06] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-26 22:26:06] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 49 ms returned sat
[2024-05-26 22:26:06] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G p0)]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 705 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-04 finished in 7902 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 132 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 523 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 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 520 transition count 171
Applied a total of 5 rules in 30 ms. Remains 520 /538 variables (removed 18) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2024-05-26 22:26:07] [INFO ] Computed 351 invariants in 6 ms
[2024-05-26 22:26:08] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-26 22:26:08] [INFO ] Invariant cache hit.
[2024-05-26 22:26:08] [INFO ] Implicit Places using invariants and state equation in 614 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 885 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/538 places, 171/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 929 ms. Remains : 498/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497) (ADD s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s...], 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 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-05 finished in 982 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||G(p1)))))'
Support contains 13 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 535 transition count 176
Applied a total of 3 rules in 8 ms. Remains 535 /538 variables (removed 3) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 535 cols
[2024-05-26 22:26:08] [INFO ] Computed 361 invariants in 4 ms
[2024-05-26 22:26:09] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-26 22:26:09] [INFO ] Invariant cache hit.
[2024-05-26 22:26:09] [INFO ] Implicit Places using invariants and state equation in 615 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 945 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 524/538 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 963 ms. Remains : 524/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s510), p0:(LEQ (ADD s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523) s508)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6914 reset in 196 ms.
Product exploration explored 100000 steps with 6925 reset in 203 ms.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 181 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 980554 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 980554 steps, saw 130847 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 524 cols
[2024-05-26 22:26:13] [INFO ] Computed 350 invariants in 3 ms
[2024-05-26 22:26:13] [INFO ] [Real]Absence check using 0 positive and 350 generalized place invariants in 47 ms returned sat
[2024-05-26 22:26:13] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 22:26:14] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 50 ms returned sat
[2024-05-26 22:26:14] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (NOT p1)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 13 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-09 finished in 5708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 34 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 10 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-26 22:26:14] [INFO ] Computed 350 invariants in 7 ms
[2024-05-26 22:26:14] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-26 22:26:14] [INFO ] Invariant cache hit.
[2024-05-26 22:26:15] [INFO ] Implicit Places using invariants and state equation in 504 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 827 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 843 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-10 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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT (ADD s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429) (ADD s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484)), p0:(GT (ADD s441 s442 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-10 finished in 1888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(F(p1)) U p2)))'
Support contains 45 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 9 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:26:16] [INFO ] Invariant cache hit.
[2024-05-26 22:26:16] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-26 22:26:16] [INFO ] Invariant cache hit.
[2024-05-26 22:26:17] [INFO ] Implicit Places using invariants and state equation in 532 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 851 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 868 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451) (ADD s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418)), p1:(LEQ (ADD s452 s453...], 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 399 ms.
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 p2) p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-13 finished in 1947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(X(X(G(p0))) U (p2&&G(p3)))))))'
Support contains 35 out of 538 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 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 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 511 transition count 172
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 511 transition count 172
Applied a total of 4 rules in 32 ms. Remains 511 /538 variables (removed 27) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 511 cols
[2024-05-26 22:26:18] [INFO ] Computed 341 invariants in 16 ms
[2024-05-26 22:26:18] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-26 22:26:18] [INFO ] Invariant cache hit.
[2024-05-26 22:26:19] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 875 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 489/538 places, 172/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 917 ms. Remains : 489/538 places, 172/176 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s0), p2:(LEQ (ADD s376 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386) (ADD s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375)), p3:(LEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6781 reset in 210 ms.
Product exploration explored 100000 steps with 6771 reset in 197 ms.
Computed a total of 489 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 172
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 p2 p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 630 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 677 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 172 rows 489 cols
[2024-05-26 22:26:20] [INFO ] Computed 320 invariants in 15 ms
[2024-05-26 22:26:20] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 22:26:20] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 41 ms returned sat
[2024-05-26 22:26:21] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 22:26:21] [INFO ] After 542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-26 22:26:21] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p3)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p2 p3))]
Knowledge based reduction with 10 factoid took 1077 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 35 out of 489 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 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 13 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-26 22:26:22] [INFO ] Invariant cache hit.
[2024-05-26 22:26:23] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-26 22:26:23] [INFO ] Invariant cache hit.
[2024-05-26 22:26:23] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-26 22:26:23] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-26 22:26:23] [INFO ] Invariant cache hit.
[2024-05-26 22:26:23] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 929 ms. Remains : 489/489 places, 172/172 transitions.
Computed a total of 489 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 172
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 p2 p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 550 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 677 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 22:26:24] [INFO ] Invariant cache hit.
[2024-05-26 22:26:24] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 22:26:24] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 42 ms returned sat
[2024-05-26 22:26:25] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 22:26:25] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-26 22:26:25] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p3)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p2 p3))]
Knowledge based reduction with 10 factoid took 1168 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 6783 reset in 169 ms.
Product exploration explored 100000 steps with 6773 reset in 179 ms.
Built C files in :
/tmp/ltsmin8125010644069099967
[2024-05-26 22:26:27] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2024-05-26 22:26:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:27] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2024-05-26 22:26:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:27] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2024-05-26 22:26:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:27] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8125010644069099967
Running compilation step : cd /tmp/ltsmin8125010644069099967;'/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 474 ms.
Running link step : cd /tmp/ltsmin8125010644069099967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8125010644069099967;'/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/stateBased12045756499597909857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 14 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-26 22:26:42] [INFO ] Invariant cache hit.
[2024-05-26 22:26:42] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-26 22:26:42] [INFO ] Invariant cache hit.
[2024-05-26 22:26:43] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-05-26 22:26:43] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-26 22:26:43] [INFO ] Invariant cache hit.
[2024-05-26 22:26:43] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 932 ms. Remains : 489/489 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin4383703844339753251
[2024-05-26 22:26:43] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2024-05-26 22:26:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:43] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2024-05-26 22:26:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:43] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2024-05-26 22:26:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:26:43] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4383703844339753251
Running compilation step : cd /tmp/ltsmin4383703844339753251;'/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 464 ms.
Running link step : cd /tmp/ltsmin4383703844339753251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4383703844339753251;'/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/stateBased11395765691402363548.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:26:58] [INFO ] Flatten gal took : 29 ms
[2024-05-26 22:26:58] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:26:58] [INFO ] Time to serialize gal into /tmp/LTL18313871075314958827.gal : 3 ms
[2024-05-26 22:26:58] [INFO ] Time to serialize properties into /tmp/LTL5466489601819864297.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/LTL18313871075314958827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17122760051200873450.hoa' '-atoms' '/tmp/LTL5466489601819864297.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/LTL5466489601819864297.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17122760051200873450.hoa
Detected timeout of ITS tools.
[2024-05-26 22:27:13] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:27:13] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:27:13] [INFO ] Time to serialize gal into /tmp/LTL1666327097992075911.gal : 2 ms
[2024-05-26 22:27:13] [INFO ] Time to serialize properties into /tmp/LTL16909363523269187099.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/LTL1666327097992075911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16909363523269187099.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 : !((G(F((("(((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+((s5_8+s5_9)+s5_10))>=3)")U("(malicious_reservoir_0>=1)"))||((X(X(G(...507
Formula 0 simplified : FG((!"(((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+((s5_8+s5_9)+s5_10))>=3)" R !"(malicious_reservoir_0>=1)") & (XXF!"(((...495
Detected timeout of ITS tools.
[2024-05-26 22:27:28] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:27:28] [INFO ] Applying decomposition
[2024-05-26 22:27:28] [INFO ] Flatten gal took : 12 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/graph17198900846695596753.txt' '-o' '/tmp/graph17198900846695596753.bin' '-w' '/tmp/graph17198900846695596753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17198900846695596753.bin' '-l' '-1' '-v' '-w' '/tmp/graph17198900846695596753.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:27:28] [INFO ] Decomposing Gal with order
[2024-05-26 22:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:27:28] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-26 22:27:28] [INFO ] Flatten gal took : 45 ms
[2024-05-26 22:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 16 ms.
[2024-05-26 22:27:29] [INFO ] Time to serialize gal into /tmp/LTL16068943567037695174.gal : 5 ms
[2024-05-26 22:27:29] [INFO ] Time to serialize properties into /tmp/LTL13917275326395969975.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/LTL16068943567037695174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13917275326395969975.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((("(((((gu24.s5_0+gu24.s5_1)+(gu24.s5_2+gu24.s5_3))+((gu24.s5_4+gu24.s5_5)+(gu24.s5_6+gu24.s5_7)))+((gu24.s5_8+gu24.s5_9)+gu24....770
Formula 0 simplified : FG((!"(((((gu24.s5_0+gu24.s5_1)+(gu24.s5_2+gu24.s5_3))+((gu24.s5_4+gu24.s5_5)+(gu24.s5_6+gu24.s5_7)))+((gu24.s5_8+gu24.s5_9)+gu24.s5...758
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2160398850329206340
[2024-05-26 22:27:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2160398850329206340
Running compilation step : cd /tmp/ltsmin2160398850329206340;'/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 409 ms.
Running link step : cd /tmp/ltsmin2160398850329206340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2160398850329206340;'/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 (LTLAPp1==true))||(X(X([]((LTLAPp0==true)))) U ((LTLAPp2==true)&&[]((LTLAPp3==true)))))))' '--buchi-type=spotba'
LTSmin run took 4969 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 91375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 10 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-26 22:27:49] [INFO ] Computed 350 invariants in 8 ms
[2024-05-26 22:27:49] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-26 22:27:49] [INFO ] Invariant cache hit.
[2024-05-26 22:27:50] [INFO ] Implicit Places using invariants and state equation in 557 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 902 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 917 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s386 s387 s388 s389 s390 s391 s392 s393 s394 s395 s396) s507)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-15 finished in 1843 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)))'
[2024-05-26 22:27:51] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4679717734873008478
[2024-05-26 22:27:51] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-26 22:27:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:27:51] [INFO ] Applying decomposition
[2024-05-26 22:27:51] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-26 22:27:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:27:51] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-26 22:27:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:27:51] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4679717734873008478
Running compilation step : cd /tmp/ltsmin4679717734873008478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 22:27:51] [INFO ] Flatten gal took : 20 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/graph8360721081754705967.txt' '-o' '/tmp/graph8360721081754705967.bin' '-w' '/tmp/graph8360721081754705967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8360721081754705967.bin' '-l' '-1' '-v' '-w' '/tmp/graph8360721081754705967.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:27:51] [INFO ] Decomposing Gal with order
[2024-05-26 22:27:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:27:51] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-26 22:27:51] [INFO ] Flatten gal took : 66 ms
[2024-05-26 22:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 10 ms.
[2024-05-26 22:27:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality5142660694391825359.gal : 6 ms
[2024-05-26 22:27:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality16341890341125535765.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/LTLCardinality5142660694391825359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16341890341125535765.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.SstopAbort_0>=2)"))))
Formula 0 simplified : GF!"(u0.SstopAbort_0>=2)"
Compilation finished in 564 ms.
Running link step : cd /tmp/ltsmin4679717734873008478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4679717734873008478;'/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)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 22:49:06] [INFO ] Applying decomposition
[2024-05-26 22:49:06] [INFO ] Flatten gal took : 153 ms
[2024-05-26 22:49:06] [INFO ] Decomposing Gal with order
[2024-05-26 22:49:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:49:07] [INFO ] Removed a total of 171 redundant transitions.
[2024-05-26 22:49:07] [INFO ] Flatten gal took : 186 ms
[2024-05-26 22:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 57 ms.
[2024-05-26 22:49:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality6730441357941846621.gal : 38 ms
[2024-05-26 22:49:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality17850097813816902100.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6730441357941846621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17850097813816902100.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(SstopAbort.SstopAbort_0>=2)"))))
Formula 0 simplified : GF!"(SstopAbort.SstopAbort_0>=2)"
Detected timeout of ITS tools.
[2024-05-26 23:10:21] [INFO ] Flatten gal took : 106 ms
[2024-05-26 23:10:22] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-26 23:10:22] [INFO ] Transformed 538 places.
[2024-05-26 23:10:22] [INFO ] Transformed 176 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 23:10:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality9790224355179320873.gal : 4 ms
[2024-05-26 23:10:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality12424640757275740864.ltl : 8 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/LTLCardinality9790224355179320873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12424640757275740864.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(SstopAbort_0>=2)"))))
Formula 0 simplified : GF!"(SstopAbort_0>=2)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Initializing POR dependencies: labels 177, guards 176
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.431: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.431: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.432: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.440: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.514: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.535: There are 178 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.535: State length is 539, there are 180 groups
pins2lts-mc-linux64( 0/ 8), 0.535: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.535: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.535: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.535: Visible groups: 0 / 180, labels: 1 / 178
pins2lts-mc-linux64( 0/ 8), 0.535: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.535: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.581: [Blue] ~17 levels ~960 states ~2864 transitions
pins2lts-mc-linux64( 0/ 8), 0.604: [Blue] ~17 levels ~1920 states ~4736 transitions
pins2lts-mc-linux64( 0/ 8), 0.649: [Blue] ~17 levels ~3840 states ~10128 transitions
pins2lts-mc-linux64( 3/ 8), 0.738: [Blue] ~19 levels ~7680 states ~21744 transitions
pins2lts-mc-linux64( 6/ 8), 0.922: [Blue] ~18 levels ~15360 states ~45944 transitions
pins2lts-mc-linux64( 3/ 8), 1.204: [Blue] ~29 levels ~30720 states ~87944 transitions
pins2lts-mc-linux64( 3/ 8), 1.763: [Blue] ~29 levels ~61440 states ~191600 transitions
pins2lts-mc-linux64( 3/ 8), 2.941: [Blue] ~29 levels ~122880 states ~416408 transitions
pins2lts-mc-linux64( 1/ 8), 5.631: [Blue] ~30 levels ~245760 states ~1004784 transitions
pins2lts-mc-linux64( 3/ 8), 10.596: [Blue] ~30 levels ~491520 states ~2138056 transitions
pins2lts-mc-linux64( 2/ 8), 21.147: [Blue] ~29 levels ~983040 states ~4913416 transitions
pins2lts-mc-linux64( 2/ 8), 41.772: [Blue] ~31 levels ~1966080 states ~10457144 transitions
pins2lts-mc-linux64( 2/ 8), 87.733: [Blue] ~32 levels ~3932160 states ~23278280 transitions
pins2lts-mc-linux64( 2/ 8), 168.891: [Blue] ~51 levels ~7864320 states ~45066016 transitions
pins2lts-mc-linux64( 7/ 8), 319.479: [Blue] ~51 levels ~15728640 states ~85602456 transitions
pins2lts-mc-linux64( 6/ 8), 637.448: [Blue] ~53 levels ~31457280 states ~171616992 transitions
pins2lts-mc-linux64( 6/ 8), 1293.450: [Blue] ~53 levels ~62914560 states ~356507392 transitions
pins2lts-mc-linux64( 6/ 8), 2775.769: [Blue] ~53 levels ~125829120 states ~780064904 transitions
pins2lts-mc-linux64( 7/ 8), 3235.087: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3235.108:
pins2lts-mc-linux64( 0/ 8), 3235.108: Explored 134443779 states 911358404 transitions, fanout: 6.779
pins2lts-mc-linux64( 0/ 8), 3235.108: Total exploration time 3234.550 sec (3234.530 sec minimum, 3234.544 sec on average)
pins2lts-mc-linux64( 0/ 8), 3235.108: States per second: 41565, Transitions per second: 281757
pins2lts-mc-linux64( 0/ 8), 3235.108:
pins2lts-mc-linux64( 0/ 8), 3235.108: State space has 134215364 states, 33735 are accepting
pins2lts-mc-linux64( 0/ 8), 3235.108: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3235.108: blue states: 134443779 (100.17%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3235.108: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3235.108: all-red states: 33735 (0.03%), bogus 44 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3235.108:
pins2lts-mc-linux64( 0/ 8), 3235.108: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 3235.108:
pins2lts-mc-linux64( 0/ 8), 3235.108: Queue width: 8B, total height: 433, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 3235.108: Tree memory: 1153.4MB, 9.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 3235.108: Tree fill ratio (roots/leafs): 99.0%/50.0%
pins2lts-mc-linux64( 0/ 8), 3235.108: Stored 177 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3235.112: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3235.127: Est. total memory use: 1153.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4679717734873008478;'/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)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4679717734873008478;'/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)))' '--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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4665220 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15926364 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-10"
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-10, 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-171662361300012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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