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.r219-smll-171649597800047.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 HirschbergSinclair-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 13 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 03:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 173K May 18 16:42 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 HirschbergSinclair-PT-15-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716639135671

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=HirschbergSinclair-PT-15
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 12:12:18] [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-25 12:12:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:12:19] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-05-25 12:12:19] [INFO ] Transformed 330 places.
[2024-05-25 12:12:19] [INFO ] Transformed 296 transitions.
[2024-05-25 12:12:19] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Support contains 59 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 316 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 21 place count 309 transition count 289
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 309 transition count 289
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 303 transition count 283
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 303 transition count 283
Applied a total of 40 rules in 226 ms. Remains 303 /330 variables (removed 27) and now considering 283/296 (removed 13) transitions.
// Phase 1: matrix 283 rows 303 cols
[2024-05-25 12:12:20] [INFO ] Computed 20 invariants in 34 ms
[2024-05-25 12:12:20] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-25 12:12:20] [INFO ] Invariant cache hit.
[2024-05-25 12:12:21] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-25 12:12:21] [INFO ] Invariant cache hit.
[2024-05-25 12:12:22] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/330 places, 283/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2467 ms. Remains : 303/330 places, 283/296 transitions.
Support contains 59 out of 303 places after structural reductions.
[2024-05-25 12:12:22] [INFO ] Flatten gal took : 95 ms
[2024-05-25 12:12:22] [INFO ] Flatten gal took : 54 ms
[2024-05-25 12:12:22] [INFO ] Input system was already deterministic with 283 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 43) seen :26
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-25 12:12:23] [INFO ] Invariant cache hit.
[2024-05-25 12:12:24] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-25 12:12:24] [INFO ] [Real]Absence check using 17 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 12:12:24] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:13
[2024-05-25 12:12:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-25 12:12:24] [INFO ] [Nat]Absence check using 17 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 12:12:24] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :2
[2024-05-25 12:12:24] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 7 ms to minimize.
[2024-05-25 12:12:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-05-25 12:12:24] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-05-25 12:12:25] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-25 12:12:25] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2024-05-25 12:12:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 505 ms
[2024-05-25 12:12:25] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-25 12:12:25] [INFO ] After 1316ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :2
Fused 17 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 298 transition count 171
Reduce places removed 108 places and 0 transitions.
Graph (complete) has 322 edges and 190 vertex of which 163 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 112 rules applied. Total rules applied 225 place count 163 transition count 168
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 255 place count 160 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 258 place count 157 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 261 place count 157 transition count 138
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 268 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 264 place count 154 transition count 137
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 266 place count 154 transition count 135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 267 place count 153 transition count 134
Iterating global reduction 6 with 1 rules applied. Total rules applied 268 place count 153 transition count 134
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 281 place count 153 transition count 121
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 294 place count 140 transition count 121
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 308 place count 126 transition count 107
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 17 rules applied. Total rules applied 325 place count 123 transition count 93
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 339 place count 109 transition count 93
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 7 Pre rules applied. Total rules applied 339 place count 109 transition count 86
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 353 place count 102 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 357 place count 100 transition count 84
Applied a total of 357 rules in 112 ms. Remains 100 /303 variables (removed 203) and now considering 84/283 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 100/303 places, 84/283 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 100 cols
[2024-05-25 12:12:25] [INFO ] Computed 16 invariants in 4 ms
[2024-05-25 12:12:25] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:12:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 12:12:25] [INFO ] [Nat]Absence check using 1 positive and 15 generalized place invariants in 25 ms returned sat
[2024-05-25 12:12:26] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:12:26] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 12:12:26] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 84/84 transitions.
Graph (complete) has 172 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Graph (complete) has 107 edges and 82 vertex of which 70 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 42 rules applied. Total rules applied 52 place count 70 transition count 40
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 81 place count 44 transition count 37
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 81 place count 44 transition count 30
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 95 place count 37 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 36 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 35 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 34 transition count 28
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 99 place count 34 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 105 place count 31 transition count 25
Applied a total of 105 rules in 22 ms. Remains 31 /100 variables (removed 69) and now considering 25/84 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 31/100 places, 25/84 transitions.
Incomplete random walk after 10000 steps, including 384 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 152 steps, run visited all 1 properties in 14 ms. (steps per millisecond=10 )
Probabilistic random walk after 152 steps, saw 67 distinct states, run finished after 15 ms. (steps per millisecond=10 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 303 stabilizing places and 283 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 303 transition count 283
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 43 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-25 12:12:26] [INFO ] Computed 19 invariants in 4 ms
[2024-05-25 12:12:27] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-25 12:12:27] [INFO ] Invariant cache hit.
[2024-05-25 12:12:28] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2024-05-25 12:12:28] [INFO ] Invariant cache hit.
[2024-05-25 12:12:28] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1621 ms. Remains : 287/303 places, 268/283 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 395 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-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}]], initial=2, aps=[p0:(AND (LEQ s1 s123) (LEQ 1 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 346 steps with 1 reset in 14 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-00 finished in 2116 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 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 287 transition count 146
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 165 transition count 146
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 156 transition count 137
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 156 transition count 137
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 156 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 155 transition count 136
Applied a total of 265 rules in 42 ms. Remains 155 /303 variables (removed 148) and now considering 136/283 (removed 147) transitions.
// Phase 1: matrix 136 rows 155 cols
[2024-05-25 12:12:28] [INFO ] Computed 19 invariants in 3 ms
[2024-05-25 12:12:29] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-25 12:12:29] [INFO ] Invariant cache hit.
[2024-05-25 12:12:29] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-05-25 12:12:29] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 12:12:29] [INFO ] Invariant cache hit.
[2024-05-25 12:12:29] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/303 places, 136/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 155/303 places, 136/283 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-01 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 1 s50)], 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 663 reset in 496 ms.
Product exploration explored 100000 steps with 662 reset in 410 ms.
Computed a total of 155 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-01 finished in 2136 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((F(p0)&&X((p1&&G(p2))))))'
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 295 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 295 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 289 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 289 transition count 270
Applied a total of 27 rules in 38 ms. Remains 289 /303 variables (removed 14) and now considering 270/283 (removed 13) transitions.
// Phase 1: matrix 270 rows 289 cols
[2024-05-25 12:12:30] [INFO ] Computed 19 invariants in 5 ms
[2024-05-25 12:12:31] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-25 12:12:31] [INFO ] Invariant cache hit.
[2024-05-25 12:12:32] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2024-05-25 12:12:32] [INFO ] Invariant cache hit.
[2024-05-25 12:12:32] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/303 places, 270/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1617 ms. Remains : 289/303 places, 270/283 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s131 s270), p1:(OR (LEQ s131 s270) (LEQ s85 s266)), p2:(LEQ s87 s162)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 338 reset in 260 ms.
Product exploration explored 100000 steps with 338 reset in 265 ms.
Computed a total of 289 stabilizing places and 270 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 270
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (OR (NOT p1) (NOT p2)))), (X p0), (X (AND p1 p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 589 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-03 finished in 3203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p0))))'
Support contains 0 out of 303 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 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 288 transition count 155
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 174 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 173 transition count 154
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 240 place count 164 transition count 145
Iterating global reduction 3 with 9 rules applied. Total rules applied 249 place count 164 transition count 145
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 164 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 163 transition count 144
Applied a total of 251 rules in 29 ms. Remains 163 /303 variables (removed 140) and now considering 144/283 (removed 139) transitions.
// Phase 1: matrix 144 rows 163 cols
[2024-05-25 12:12:34] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 12:12:34] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-25 12:12:34] [INFO ] Invariant cache hit.
[2024-05-25 12:12:34] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-25 12:12:34] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-25 12:12:34] [INFO ] Invariant cache hit.
[2024-05-25 12:12:35] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/303 places, 144/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 930 ms. Remains : 163/303 places, 144/283 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 23 ms :[false]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-05 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-05 TRUE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-05 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p1)||(G(p2) U X(p3))))))'
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 18 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-25 12:12:35] [INFO ] Computed 19 invariants in 4 ms
[2024-05-25 12:12:35] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-25 12:12:35] [INFO ] Invariant cache hit.
[2024-05-25 12:12:36] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2024-05-25 12:12:36] [INFO ] Invariant cache hit.
[2024-05-25 12:12:36] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s183), p2:(GT s73 s244), p1:(LEQ s178 s211), p3:(LEQ 1 s113)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1180 reset in 288 ms.
Product exploration explored 100000 steps with 1225 reset in 558 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 1495 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 159 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 1588 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2024-05-25 12:12:41] [INFO ] Invariant cache hit.
[2024-05-25 12:12:41] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 52 ms returned sat
[2024-05-25 12:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:12:42] [INFO ] [Real]Absence check using state equation in 1497 ms returned sat
[2024-05-25 12:12:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:12:43] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 37 ms returned sat
[2024-05-25 12:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:12:43] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-05-25 12:12:43] [INFO ] Computed and/alt/rep : 177/605/177 causal constraints (skipped 76 transitions) in 35 ms.
[2024-05-25 12:12:44] [INFO ] Added : 97 causal constraints over 20 iterations in 845 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 287 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 : 287/287 places, 268/268 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 272 transition count 145
Reduce places removed 108 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 112 rules applied. Total rules applied 220 place count 164 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 224 place count 160 transition count 141
Applied a total of 224 rules in 26 ms. Remains 160 /287 variables (removed 127) and now considering 141/268 (removed 127) transitions.
// Phase 1: matrix 141 rows 160 cols
[2024-05-25 12:12:44] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 12:12:44] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-25 12:12:44] [INFO ] Invariant cache hit.
[2024-05-25 12:12:45] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-25 12:12:45] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-25 12:12:45] [INFO ] Invariant cache hit.
[2024-05-25 12:12:45] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/287 places, 141/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 160/287 places, 141/268 transitions.
Computed a total of 160 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 160 transition count 141
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-25 12:12:46] [INFO ] Invariant cache hit.
[2024-05-25 12:12:46] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2024-05-25 12:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:12:47] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2024-05-25 12:12:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:12:47] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 21 ms returned sat
[2024-05-25 12:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:12:47] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-25 12:12:47] [INFO ] Computed and/alt/rep : 112/117/112 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-25 12:12:48] [INFO ] Added : 50 causal constraints over 10 iterations in 218 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1265 reset in 332 ms.
Product exploration explored 100000 steps with 1265 reset in 364 ms.
Built C files in :
/tmp/ltsmin6575015047216314629
[2024-05-25 12:12:48] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2024-05-25 12:12:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:12:48] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2024-05-25 12:12:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:12:48] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2024-05-25 12:12:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:12:48] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6575015047216314629
Running compilation step : cd /tmp/ltsmin6575015047216314629;'/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 659 ms.
Running link step : cd /tmp/ltsmin6575015047216314629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin6575015047216314629;'/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/stateBased11912773849477462580.hoa' '--buchi-type=spotba'
LTSmin run took 2196 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-06 finished in 16678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U (p0 U p1))||p2))&&!(p0 U p3)))'
Support contains 7 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 274
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 286 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 286 transition count 266
Applied a total of 34 rules in 17 ms. Remains 286 /303 variables (removed 17) and now considering 266/283 (removed 17) transitions.
// Phase 1: matrix 266 rows 286 cols
[2024-05-25 12:12:51] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 12:12:51] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 12:12:51] [INFO ] Invariant cache hit.
[2024-05-25 12:12:52] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2024-05-25 12:12:52] [INFO ] Invariant cache hit.
[2024-05-25 12:12:52] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/303 places, 266/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1122 ms. Remains : 286/303 places, 266/283 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR p3 (AND p1 (NOT p2))), true, p3, (AND p1 (NOT p2)), p1]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s131), p0:(LEQ s30 s197), p2:(GT s268 s52), p1:(LEQ s2 s67)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 128 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-07 finished in 1362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(((p1 U p0)||F(!p1))))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 288 transition count 148
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 167 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 252 place count 158 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 261 place count 158 transition count 139
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 158 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 263 place count 157 transition count 138
Applied a total of 263 rules in 33 ms. Remains 157 /303 variables (removed 146) and now considering 138/283 (removed 145) transitions.
// Phase 1: matrix 138 rows 157 cols
[2024-05-25 12:12:53] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 12:12:53] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-25 12:12:53] [INFO ] Invariant cache hit.
[2024-05-25 12:12:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 12:12:53] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-25 12:12:53] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-25 12:12:53] [INFO ] Invariant cache hit.
[2024-05-25 12:12:54] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/303 places, 138/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 908 ms. Remains : 157/303 places, 138/283 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s9), p1:(GT s85 s73)], 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 871 reset in 232 ms.
Product exploration explored 100000 steps with 883 reset in 289 ms.
Computed a total of 157 stabilizing places and 138 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 138
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)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-08 finished in 1688 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((X(p0)&&(p0||F(p1)))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 293 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 293 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 285 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 285 transition count 266
Applied a total of 35 rules in 18 ms. Remains 285 /303 variables (removed 18) and now considering 266/283 (removed 17) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-05-25 12:12:54] [INFO ] Computed 19 invariants in 3 ms
[2024-05-25 12:12:55] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-25 12:12:55] [INFO ] Invariant cache hit.
[2024-05-25 12:12:55] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2024-05-25 12:12:55] [INFO ] Invariant cache hit.
[2024-05-25 12:12:55] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/303 places, 266/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1092 ms. Remains : 285/303 places, 266/283 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ s262 s13), p1:(LEQ 1 s59)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 663 ms.
Product exploration explored 100000 steps with 50000 reset in 525 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-10 finished in 2603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 293 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 293 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 286 transition count 267
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 286 transition count 267
Applied a total of 33 rules in 15 ms. Remains 286 /303 variables (removed 17) and now considering 267/283 (removed 16) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-05-25 12:12:57] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 12:12:57] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-25 12:12:57] [INFO ] Invariant cache hit.
[2024-05-25 12:12:58] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2024-05-25 12:12:58] [INFO ] Invariant cache hit.
[2024-05-25 12:12:58] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/303 places, 267/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1083 ms. Remains : 286/303 places, 267/283 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s84)], 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 1762 reset in 280 ms.
Product exploration explored 100000 steps with 1774 reset in 296 ms.
Computed a total of 286 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 267
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-25 12:12:59] [INFO ] Invariant cache hit.
[2024-05-25 12:13:00] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 47 ms returned sat
[2024-05-25 12:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:13:01] [INFO ] [Real]Absence check using state equation in 1731 ms returned sat
[2024-05-25 12:13:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:13:02] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 51 ms returned sat
[2024-05-25 12:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:13:02] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2024-05-25 12:13:02] [INFO ] Computed and/alt/rep : 176/605/176 causal constraints (skipped 76 transitions) in 36 ms.
[2024-05-25 12:13:04] [INFO ] Added : 165 causal constraints over 33 iterations in 1723 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 267/267 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 271 transition count 138
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 157 transition count 138
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 2 with 2 rules applied. Total rules applied 230 place count 156 transition count 137
Applied a total of 230 rules in 25 ms. Remains 156 /286 variables (removed 130) and now considering 137/267 (removed 130) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-05-25 12:13:04] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 12:13:04] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-25 12:13:04] [INFO ] Invariant cache hit.
[2024-05-25 12:13:04] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-25 12:13:04] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 12:13:04] [INFO ] Invariant cache hit.
[2024-05-25 12:13:04] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/286 places, 137/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 851 ms. Remains : 156/286 places, 137/267 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
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 (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-05-25 12:13:05] [INFO ] Invariant cache hit.
[2024-05-25 12:13:05] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 29 ms returned sat
[2024-05-25 12:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:13:06] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-25 12:13:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:13:06] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 31 ms returned sat
[2024-05-25 12:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:13:06] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-25 12:13:06] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-25 12:13:07] [INFO ] Added : 58 causal constraints over 12 iterations in 339 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3273 reset in 495 ms.
Product exploration explored 100000 steps with 3320 reset in 387 ms.
Built C files in :
/tmp/ltsmin12400854837046418941
[2024-05-25 12:13:07] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-25 12:13:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:13:07] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-25 12:13:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:13:07] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-25 12:13:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:13:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12400854837046418941
Running compilation step : cd /tmp/ltsmin12400854837046418941;'/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 398 ms.
Running link step : cd /tmp/ltsmin12400854837046418941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12400854837046418941;'/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/stateBased5420637857394486655.hoa' '--buchi-type=spotba'
LTSmin run took 789 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-11 finished in 11814 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((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||((F(p2) U G(F(p2)))&&X((p0 U (p1||G(p0))))))))))'
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 24 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-25 12:13:09] [INFO ] Computed 19 invariants in 3 ms
[2024-05-25 12:13:09] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-25 12:13:09] [INFO ] Invariant cache hit.
[2024-05-25 12:13:10] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2024-05-25 12:13:10] [INFO ] Invariant cache hit.
[2024-05-25 12:13:10] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1418 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 1 s126), p1:(AND (GT s271 s49) (GT 1 s126)), p2:(GT s261 s125)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 366 reset in 269 ms.
Product exploration explored 100000 steps with 366 reset in 301 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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) (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 18 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 995 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:13:13] [INFO ] Invariant cache hit.
[2024-05-25 12:13:13] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 12:13:13] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 43 ms returned sat
[2024-05-25 12:13:14] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p2)) p1)), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))]
Knowledge based reduction with 11 factoid took 1488 ms. Reduced automaton from 18 states, 53 edges and 3 AP (stutter insensitive) to 15 states, 42 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 754 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 796 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 268/268 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 272 transition count 141
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 160 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 159 transition count 140
Applied a total of 226 rules in 20 ms. Remains 159 /287 variables (removed 128) and now considering 140/268 (removed 128) transitions.
// Phase 1: matrix 140 rows 159 cols
[2024-05-25 12:13:17] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 12:13:17] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-25 12:13:17] [INFO ] Invariant cache hit.
[2024-05-25 12:13:17] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-25 12:13:17] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 12:13:17] [INFO ] Invariant cache hit.
[2024-05-25 12:13:18] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/287 places, 140/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 934 ms. Remains : 159/287 places, 140/268 transitions.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
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) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 3078 ms. Reduced automaton from 15 states, 42 edges and 3 AP (stutter insensitive) to 15 states, 42 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 603 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:13:22] [INFO ] Invariant cache hit.
[2024-05-25 12:13:22] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 12:13:22] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 34 ms returned sat
[2024-05-25 12:13:22] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (OR (NOT p0) p1)), (F (AND p0 (NOT p2) p1)), (F (AND p0 p2 (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 35 factoid took 23618 ms. Reduced automaton from 15 states, 42 edges and 3 AP (stutter insensitive) to 15 states, 42 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 724 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 741 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 760 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 794 reset in 288 ms.
Product exploration explored 100000 steps with 796 reset in 349 ms.
Built C files in :
/tmp/ltsmin18019763036349561412
[2024-05-25 12:13:48] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2024-05-25 12:13:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:13:48] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2024-05-25 12:13:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:13:48] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2024-05-25 12:13:48] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:13:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18019763036349561412
Running compilation step : cd /tmp/ltsmin18019763036349561412;'/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 675 ms.
Running link step : cd /tmp/ltsmin18019763036349561412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin18019763036349561412;'/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/stateBased15338984449570994930.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-25 12:14:04] [INFO ] Invariant cache hit.
[2024-05-25 12:14:04] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-25 12:14:04] [INFO ] Invariant cache hit.
[2024-05-25 12:14:04] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-05-25 12:14:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:14:04] [INFO ] Invariant cache hit.
[2024-05-25 12:14:04] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 159/159 places, 140/140 transitions.
Built C files in :
/tmp/ltsmin6575938572693607114
[2024-05-25 12:14:04] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2024-05-25 12:14:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:14:04] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2024-05-25 12:14:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:14:04] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2024-05-25 12:14:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:14:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6575938572693607114
Running compilation step : cd /tmp/ltsmin6575938572693607114;'/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 477 ms.
Running link step : cd /tmp/ltsmin6575938572693607114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6575938572693607114;'/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/stateBased12813164451517529187.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 12:14:20] [INFO ] Flatten gal took : 13 ms
[2024-05-25 12:14:20] [INFO ] Flatten gal took : 33 ms
[2024-05-25 12:14:20] [INFO ] Time to serialize gal into /tmp/LTL16407521773992375923.gal : 3 ms
[2024-05-25 12:14:20] [INFO ] Time to serialize properties into /tmp/LTL14575365501924280477.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16407521773992375923.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3263883948983689942.hoa' '-atoms' '/tmp/LTL14575365501924280477.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/LTL14575365501924280477.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3263883948983689942.hoa
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t23.t24, t29.t30, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t56.t57, t60.t61...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2024-05-25 12:14:35] [INFO ] Flatten gal took : 15 ms
[2024-05-25 12:14:35] [INFO ] Flatten gal took : 15 ms
[2024-05-25 12:14:35] [INFO ] Time to serialize gal into /tmp/LTL2781673819715986221.gal : 4 ms
[2024-05-25 12:14:35] [INFO ] Time to serialize properties into /tmp/LTL6527862599874016721.ltl : 7 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/LTL2781673819715986221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6527862599874016721.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t23.t24, t29.t30, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t56.t57, t60.t61...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2024-05-25 12:14:50] [INFO ] Flatten gal took : 16 ms
[2024-05-25 12:14:50] [INFO ] Applying decomposition
[2024-05-25 12:14:50] [INFO ] Flatten gal took : 17 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/graph5256009501180733631.txt' '-o' '/tmp/graph5256009501180733631.bin' '-w' '/tmp/graph5256009501180733631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5256009501180733631.bin' '-l' '-1' '-v' '-w' '/tmp/graph5256009501180733631.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:14:50] [INFO ] Decomposing Gal with order
[2024-05-25 12:14:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:14:50] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-25 12:14:50] [INFO ] Flatten gal took : 105 ms
[2024-05-25 12:14:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 16 ms.
[2024-05-25 12:14:50] [INFO ] Time to serialize gal into /tmp/LTL18440785229260951550.gal : 10 ms
[2024-05-25 12:14:50] [INFO ] Time to serialize properties into /tmp/LTL8788162320342161854.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/LTL18440785229260951550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8788162320342161854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(gi2.gi1.gi0.gu24.reply_15_2_to_right_13<1)")U((G("(gi2.gi1.gi0.gu24.reply_15_2_to_right_13<1)"))||("((gu5.rcv_left_electi...852
Formula 0 simplified : XXG(F(!"((gu5.rcv_left_election_15_4_14_14>gu5.rcv_left_election_5_0_1_6)&&(gi2.gi1.gi0.gu24.reply_15_2_to_right_13<1))" & !"(gi2.gi...433
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.t64_t65, gi2.gi1.gi0.t76_t77, gi2.gi1.gi1.t17_t18, gi2.gi1.t23_t24, gi2.gi1.t234_t235...419
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2622601870231209391
[2024-05-25 12:15:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2622601870231209391
Running compilation step : cd /tmp/ltsmin2622601870231209391;'/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 377 ms.
Running link step : cd /tmp/ltsmin2622601870231209391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2622601870231209391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 131849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 287 transition count 268
Applied a total of 31 rules in 31 ms. Remains 287 /303 variables (removed 16) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-25 12:15:21] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 12:15:21] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-25 12:15:21] [INFO ] Invariant cache hit.
[2024-05-25 12:15:22] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2024-05-25 12:15:22] [INFO ] Invariant cache hit.
[2024-05-25 12:15:22] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/303 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1480 ms. Remains : 287/303 places, 268/283 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s203 s81)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 489 ms.
Product exploration explored 100000 steps with 33333 reset in 586 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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 (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 3 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-13 finished in 2851 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((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||((F(p2) U G(F(p2)))&&X((p0 U (p1||G(p0))))))))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-15-LTLCardinality-12
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 303/303 places, 283/283 transitions.
Graph (complete) has 567 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 287 transition count 150
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 169 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 168 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 160 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 160 transition count 141
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 256 place count 160 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 159 transition count 140
Applied a total of 257 rules in 33 ms. Remains 159 /303 variables (removed 144) and now considering 140/283 (removed 143) transitions.
// Phase 1: matrix 140 rows 159 cols
[2024-05-25 12:15:24] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 12:15:24] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-25 12:15:24] [INFO ] Invariant cache hit.
[2024-05-25 12:15:25] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-05-25 12:15:25] [INFO ] Invariant cache hit.
[2024-05-25 12:15:25] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 159/303 places, 140/283 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1079 ms. Remains : 159/303 places, 140/283 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 1 s67), p1:(AND (GT s143 s25) (GT 1 s67)), p2:(GT s137 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 716 reset in 287 ms.
Product exploration explored 100000 steps with 718 reset in 190 ms.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
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) (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 454 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 18 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1040 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:15:28] [INFO ] Invariant cache hit.
[2024-05-25 12:15:28] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 12:15:28] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 24 ms returned sat
[2024-05-25 12:15:28] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p2)) p1)), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))]
Knowledge based reduction with 11 factoid took 1675 ms. Reduced automaton from 18 states, 53 edges and 3 AP (stutter insensitive) to 15 states, 42 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 764 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 845 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-25 12:15:31] [INFO ] Invariant cache hit.
[2024-05-25 12:15:31] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-25 12:15:31] [INFO ] Invariant cache hit.
[2024-05-25 12:15:32] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2024-05-25 12:15:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 12:15:32] [INFO ] Invariant cache hit.
[2024-05-25 12:15:32] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 159/159 places, 140/140 transitions.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
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) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 3382 ms. Reduced automaton from 15 states, 42 edges and 3 AP (stutter insensitive) to 15 states, 42 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 854 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 12:15:37] [INFO ] Invariant cache hit.
[2024-05-25 12:15:37] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 12:15:37] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 32 ms returned sat
[2024-05-25 12:15:37] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (OR (NOT p0) p1)), (F (AND p0 (NOT p2) p1)), (F (AND p0 p2 (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 35 factoid took 22375 ms. Reduced automaton from 15 states, 42 edges and 3 AP (stutter insensitive) to 15 states, 42 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 685 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 775 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 763 ms :[false, (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), false, false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 788 reset in 191 ms.
Product exploration explored 100000 steps with 797 reset in 350 ms.
Built C files in :
/tmp/ltsmin6304120243027650819
[2024-05-25 12:16:02] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2024-05-25 12:16:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:16:02] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2024-05-25 12:16:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:16:02] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2024-05-25 12:16:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:16:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6304120243027650819
Running compilation step : cd /tmp/ltsmin6304120243027650819;'/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 652 ms.
Running link step : cd /tmp/ltsmin6304120243027650819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6304120243027650819;'/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/stateBased855969119831221392.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-25 12:16:18] [INFO ] Invariant cache hit.
[2024-05-25 12:16:18] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-25 12:16:18] [INFO ] Invariant cache hit.
[2024-05-25 12:16:18] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-25 12:16:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 12:16:18] [INFO ] Invariant cache hit.
[2024-05-25 12:16:18] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 725 ms. Remains : 159/159 places, 140/140 transitions.
Built C files in :
/tmp/ltsmin15840118823543681311
[2024-05-25 12:16:18] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2024-05-25 12:16:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:16:18] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2024-05-25 12:16:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:16:18] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2024-05-25 12:16:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:16:18] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15840118823543681311
Running compilation step : cd /tmp/ltsmin15840118823543681311;'/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 411 ms.
Running link step : cd /tmp/ltsmin15840118823543681311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15840118823543681311;'/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/stateBased14022619143255492348.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 12:16:33] [INFO ] Flatten gal took : 13 ms
[2024-05-25 12:16:33] [INFO ] Flatten gal took : 9 ms
[2024-05-25 12:16:33] [INFO ] Time to serialize gal into /tmp/LTL17466368640940540043.gal : 2 ms
[2024-05-25 12:16:33] [INFO ] Time to serialize properties into /tmp/LTL16296533509988956216.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17466368640940540043.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10616666200917968292.hoa' '-atoms' '/tmp/LTL16296533509988956216.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16296533509988956216.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10616666200917968292.hoa
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t23.t24, t29.t30, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t56.t57, t60.t61...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2024-05-25 12:16:48] [INFO ] Flatten gal took : 9 ms
[2024-05-25 12:16:49] [INFO ] Flatten gal took : 8 ms
[2024-05-25 12:16:49] [INFO ] Time to serialize gal into /tmp/LTL11992692597363786991.gal : 7 ms
[2024-05-25 12:16:49] [INFO ] Time to serialize properties into /tmp/LTL16210867860443483975.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/LTL11992692597363786991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16210867860443483975.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 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t23.t24, t29.t30, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t56.t57, t60.t61...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2024-05-25 12:17:04] [INFO ] Flatten gal took : 7 ms
[2024-05-25 12:17:04] [INFO ] Applying decomposition
[2024-05-25 12:17:04] [INFO ] Flatten gal took : 7 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/graph13931032248759848019.txt' '-o' '/tmp/graph13931032248759848019.bin' '-w' '/tmp/graph13931032248759848019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13931032248759848019.bin' '-l' '-1' '-v' '-w' '/tmp/graph13931032248759848019.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:17:04] [INFO ] Decomposing Gal with order
[2024-05-25 12:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:17:04] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-25 12:17:04] [INFO ] Flatten gal took : 21 ms
[2024-05-25 12:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-25 12:17:04] [INFO ] Time to serialize gal into /tmp/LTL8579296964306211920.gal : 3 ms
[2024-05-25 12:17:04] [INFO ] Time to serialize properties into /tmp/LTL11089642039592398971.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/LTL8579296964306211920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11089642039592398971.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(gi2.gi0.gi1.gu26.reply_15_2_to_right_13<1)")U((G("(gi2.gi0.gi1.gu26.reply_15_2_to_right_13<1)"))||("((gu7.rcv_left_electi...852
Formula 0 simplified : XXG(F(!"((gu7.rcv_left_election_15_4_14_14>gu7.rcv_left_election_5_0_1_6)&&(gi2.gi0.gi1.gu26.reply_15_2_to_right_13<1))" & !"(gi2.gi...433
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.gi4.t23_t24, gi2.gi0.t29_t30, gi2.gi0.t64_t65, gi2.gi0.t70_t71, gi2.gi0.t76_t77, gi2....411
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12160115090938501323
[2024-05-25 12:17:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12160115090938501323
Running compilation step : cd /tmp/ltsmin12160115090938501323;'/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 348 ms.
Running link step : cd /tmp/ltsmin12160115090938501323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12160115090938501323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 130435 ms.
[2024-05-25 12:17:34] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15935312754622507131
[2024-05-25 12:17:34] [INFO ] Computing symmetric may disable matrix : 283 transitions.
[2024-05-25 12:17:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:17:34] [INFO ] Computing symmetric may enable matrix : 283 transitions.
[2024-05-25 12:17:34] [INFO ] Applying decomposition
[2024-05-25 12:17:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:17:34] [INFO ] Flatten gal took : 21 ms
[2024-05-25 12:17:34] [INFO ] Computing Do-Not-Accords matrix : 283 transitions.
[2024-05-25 12:17:34] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:17:34] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15935312754622507131
Running compilation step : cd /tmp/ltsmin15935312754622507131;'/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'
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/graph1812363264950984832.txt' '-o' '/tmp/graph1812363264950984832.bin' '-w' '/tmp/graph1812363264950984832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1812363264950984832.bin' '-l' '-1' '-v' '-w' '/tmp/graph1812363264950984832.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:17:34] [INFO ] Decomposing Gal with order
[2024-05-25 12:17:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:17:34] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-25 12:17:34] [INFO ] Flatten gal took : 29 ms
[2024-05-25 12:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-25 12:17:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality15551251074993628505.gal : 5 ms
[2024-05-25 12:17:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11811925097553418621.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/LTLCardinality15551251074993628505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11811925097553418621.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(gi0.gi0.gi1.gi3.gu28.reply_15_2_to_right_13<1)")U((G("(gi0.gi0.gi1.gi3.gu28.reply_15_2_to_right_13<1)"))||("((gu17.rcv_le...894
Formula 0 simplified : XXG(F(!"((gu17.rcv_left_election_15_4_14_14>gu17.rcv_left_election_5_0_1_6)&&(gi0.gi0.gi1.gi3.gu28.reply_15_2_to_right_13<1))" & !"(...453
Compilation finished in 876 ms.
Running link step : cd /tmp/ltsmin15935312754622507131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15935312754622507131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gi0.gu5.t42, gi0.gi0.gi0.gi0.gu5.t46, gi0.gi0.gi0.gi0.gu6.t44, gi0.gi0.gi0.gi0.gu...1144
Computing Next relation with stutter on 5.42376e+11 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: LTL layer: formula: X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))
pins2lts-mc-linux64( 1/ 8), 0.010: "X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.106: There are 287 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.106: State length is 304, there are 299 groups
pins2lts-mc-linux64( 0/ 8), 0.106: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.106: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.106: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.106: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.476: [Blue] ~120 levels ~960 states ~8360 transitions
pins2lts-mc-linux64( 0/ 8), 0.557: [Blue] ~240 levels ~1920 states ~10944 transitions
pins2lts-mc-linux64( 7/ 8), 0.679: [Blue] ~287 levels ~3840 states ~13832 transitions
pins2lts-mc-linux64( 1/ 8), 0.823: [Blue] ~291 levels ~7680 states ~20672 transitions
pins2lts-mc-linux64( 3/ 8), 1.122: [Blue] ~275 levels ~15360 states ~43312 transitions
pins2lts-mc-linux64( 5/ 8), 1.904: [Blue] ~296 levels ~30720 states ~75680 transitions
pins2lts-mc-linux64( 2/ 8), 2.494: [Blue] ~297 levels ~61440 states ~157864 transitions
pins2lts-mc-linux64( 6/ 8), 3.543: [Blue] ~295 levels ~122880 states ~346736 transitions
pins2lts-mc-linux64( 6/ 8), 5.533: [Blue] ~295 levels ~245760 states ~807240 transitions
pins2lts-mc-linux64( 6/ 8), 9.455: [Blue] ~295 levels ~491520 states ~1834160 transitions
pins2lts-mc-linux64( 6/ 8), 14.806: [Blue] ~295 levels ~983040 states ~3750824 transitions
pins2lts-mc-linux64( 6/ 8), 23.606: [Blue] ~295 levels ~1966080 states ~8270464 transitions
pins2lts-mc-linux64( 6/ 8), 40.849: [Blue] ~295 levels ~3932160 states ~17300872 transitions
pins2lts-mc-linux64( 6/ 8), 74.658: [Blue] ~295 levels ~7864320 states ~36218984 transitions
pins2lts-mc-linux64( 6/ 8), 143.155: [Blue] ~295 levels ~15728640 states ~76370376 transitions
pins2lts-mc-linux64( 6/ 8), 286.384: [Blue] ~295 levels ~31457280 states ~164756744 transitions
pins2lts-mc-linux64( 1/ 8), 568.719: [Blue] ~295 levels ~62914560 states ~328613448 transitions
pins2lts-mc-linux64( 1/ 8), 792.072: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 792.103:
pins2lts-mc-linux64( 0/ 8), 792.103: Explored 80313066 states 450097212 transitions, fanout: 5.604
pins2lts-mc-linux64( 0/ 8), 792.103: Total exploration time 791.970 sec (791.940 sec minimum, 791.958 sec on average)
pins2lts-mc-linux64( 0/ 8), 792.103: States per second: 101409, Transitions per second: 568326
pins2lts-mc-linux64( 0/ 8), 792.103:
pins2lts-mc-linux64( 0/ 8), 792.103: State space has 79353107 states, 21478 are accepting
pins2lts-mc-linux64( 0/ 8), 792.103: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 792.103: blue states: 80313066 (101.21%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 792.103: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 792.103: all-red states: 513444 (0.65%), bogus 2325 (0.00%)
pins2lts-mc-linux64( 0/ 8), 792.103:
pins2lts-mc-linux64( 0/ 8), 792.103: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 792.103:
pins2lts-mc-linux64( 0/ 8), 792.103: Queue width: 8B, total height: 2365, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 792.103: Tree memory: 861.4MB, 11.4 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 792.103: Tree fill ratio (roots/leafs): 59.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 792.103: Stored 285 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 792.104: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 792.104: Est. total memory use: 861.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15935312754622507131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15935312754622507131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((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)
Detected timeout of ITS tools.
[2024-05-25 12:39:19] [INFO ] Flatten gal took : 14 ms
[2024-05-25 12:39:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality15432357687823105069.gal : 3 ms
[2024-05-25 12:39:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality12764890016825990678.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15432357687823105069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12764890016825990678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t22, t24, t28, t30...379
Computing Next relation with stutter on 5.42376e+11 deadlock states
Detected timeout of ITS tools.
[2024-05-25 13:01:05] [INFO ] Flatten gal took : 24 ms
[2024-05-25 13:01:05] [INFO ] Input system was already deterministic with 283 transitions.
[2024-05-25 13:01:05] [INFO ] Transformed 303 places.
[2024-05-25 13:01:05] [INFO ] Transformed 283 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 13:01:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality13929408232752838363.gal : 3 ms
[2024-05-25 13:01:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality5433421307006001584.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/LTLCardinality13929408232752838363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5433421307006001584.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 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t22, t24, t28, t30...379
Computing Next relation with stutter on 5.42376e+11 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10584468 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039808 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="HirschbergSinclair-PT-15"
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 HirschbergSinclair-PT-15, 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 r219-smll-171649597800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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