fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872800356
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyElection-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16179.728 2048133.00 7303146.00 2302.40 FFFFFFFTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872800356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.8K May 30 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 30 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 30 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 30 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 30 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 12M May 29 12:20 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 StigmergyElection-PT-08b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654866007664

Running Version 202205111006
[2022-06-10 13:00:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 13:00:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 13:00:11] [INFO ] Load time of PNML (sax parser for PT used): 1430 ms
[2022-06-10 13:00:11] [INFO ] Transformed 1107 places.
[2022-06-10 13:00:11] [INFO ] Transformed 14564 transitions.
[2022-06-10 13:00:11] [INFO ] Found NUPN structural information;
[2022-06-10 13:00:11] [INFO ] Parsed PT model containing 1107 places and 14564 transitions in 1812 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-08b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 138 place count 969 transition count 14426
Iterating global reduction 0 with 138 rules applied. Total rules applied 276 place count 969 transition count 14426
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 349 place count 896 transition count 14353
Iterating global reduction 0 with 73 rules applied. Total rules applied 422 place count 896 transition count 14353
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 438 place count 880 transition count 14337
Iterating global reduction 0 with 16 rules applied. Total rules applied 454 place count 880 transition count 14337
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 462 place count 872 transition count 14329
Iterating global reduction 0 with 8 rules applied. Total rules applied 470 place count 872 transition count 14329
Applied a total of 470 rules in 989 ms. Remains 872 /1107 variables (removed 235) and now considering 14329/14564 (removed 235) transitions.
// Phase 1: matrix 14329 rows 872 cols
[2022-06-10 13:00:13] [INFO ] Computed 9 place invariants in 490 ms
[2022-06-10 13:00:14] [INFO ] Implicit Places using invariants in 1097 ms returned []
Implicit Place search using SMT only with invariants took 1140 ms to find 0 implicit places.
// Phase 1: matrix 14329 rows 872 cols
[2022-06-10 13:00:14] [INFO ] Computed 9 place invariants in 393 ms
[2022-06-10 13:00:29] [INFO ] Dead Transitions using invariants and state equation in 15809 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/1107 places, 14329/14564 transitions.
Finished structural reductions, in 1 iterations. Remains : 872/1107 places, 14329/14564 transitions.
Support contains 50 out of 872 places after structural reductions.
[2022-06-10 13:00:32] [INFO ] Flatten gal took : 2249 ms
[2022-06-10 13:00:34] [INFO ] Flatten gal took : 1852 ms
[2022-06-10 13:00:38] [INFO ] Input system was already deterministic with 14329 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 1075 ms. (steps per millisecond=9 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 43032 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43032 steps, saw 11722 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 14329 rows 872 cols
[2022-06-10 13:00:43] [INFO ] Computed 9 place invariants in 234 ms
[2022-06-10 13:00:45] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2022-06-10 13:00:55] [INFO ] After 10258ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:22
[2022-06-10 13:01:00] [INFO ] After 15330ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:22
Attempting to minimize the solution found.
Minimization took 2855 ms.
[2022-06-10 13:01:03] [INFO ] After 19330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:22
[2022-06-10 13:01:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2022-06-10 13:01:25] [INFO ] After 20540ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2022-06-10 13:01:28] [INFO ] After 23526ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 13:01:28] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 24 properties in 631 ms.
Support contains 9 out of 872 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 885 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 11 ms
Free SCC test removed 112 places
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2186 edges and 760 vertex of which 752 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.95 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 528 transitions
Trivial Post-agglo rules discarded 528 transitions
Performed 528 trivial Post agglomeration. Transition count delta: 528
Iterating post reduction 0 with 536 rules applied. Total rules applied 538 place count 752 transition count 13641
Reduce places removed 528 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 544 rules applied. Total rules applied 1082 place count 224 transition count 13625
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 1091 place count 216 transition count 13624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1092 place count 215 transition count 13624
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1092 place count 215 transition count 13583
Deduced a syphon composed of 41 places in 12 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1174 place count 174 transition count 13583
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1175 place count 174 transition count 13582
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 4 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1257 place count 133 transition count 13541
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1272 place count 133 transition count 13526
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 1302 place count 103 transition count 1205
Iterating global reduction 6 with 30 rules applied. Total rules applied 1332 place count 103 transition count 1205
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1347 place count 103 transition count 1190
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1354 place count 96 transition count 1183
Iterating global reduction 7 with 7 rules applied. Total rules applied 1361 place count 96 transition count 1183
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1379 place count 87 transition count 1174
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1385 place count 84 transition count 1182
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1393 place count 84 transition count 1174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1395 place count 83 transition count 1180
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1403 place count 83 transition count 1172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1405 place count 82 transition count 1178
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1413 place count 82 transition count 1170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1415 place count 81 transition count 1176
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1423 place count 81 transition count 1168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1425 place count 80 transition count 1174
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1433 place count 80 transition count 1166
Free-agglomeration rule applied 43 times.
Iterating global reduction 7 with 43 rules applied. Total rules applied 1476 place count 80 transition count 1123
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1524 place count 37 transition count 1118
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1532 place count 29 transition count 1110
Iterating global reduction 8 with 8 rules applied. Total rules applied 1540 place count 29 transition count 1110
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 8 with 127 rules applied. Total rules applied 1667 place count 29 transition count 983
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1669 place count 29 transition count 981
Applied a total of 1669 rules in 5580 ms. Remains 29 /872 variables (removed 843) and now considering 981/14329 (removed 13348) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/872 places, 981/14329 transitions.
Finished random walk after 1244 steps, including 0 resets, run visited all 2 properties in 92 ms. (steps per millisecond=13 )
FORMULA StigmergyElection-PT-08b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA StigmergyElection-PT-08b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 120 stabilizing places and 128 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
Support contains 11 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 871 transition count 14328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 871 transition count 14328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 870 transition count 14327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 870 transition count 14327
Applied a total of 4 rules in 509 ms. Remains 870 /872 variables (removed 2) and now considering 14327/14329 (removed 2) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:01:36] [INFO ] Computed 9 place invariants in 375 ms
[2022-06-10 13:01:40] [INFO ] Implicit Places using invariants in 4280 ms returned []
Implicit Place search using SMT only with invariants took 4293 ms to find 0 implicit places.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:01:41] [INFO ] Computed 9 place invariants in 404 ms
[2022-06-10 13:01:55] [INFO ] Dead Transitions using invariants and state equation in 14465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/872 places, 14327/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 870/872 places, 14327/14329 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s47 1) (EQ s131 1) (EQ s237 1) (EQ s343 1) (EQ s471 1) (EQ s577 1) (EQ s683 1) (EQ s789 1)), p0:(AND (EQ s25 1) (EQ s131 1) (EQ s237 1) (EQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 18 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-02 finished in 19670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 887 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 5 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 515 transitions
Trivial Post-agglo rules discarded 515 transitions
Performed 515 trivial Post agglomeration. Transition count delta: 515
Iterating post reduction 0 with 515 rules applied. Total rules applied 516 place count 759 transition count 13685
Reduce places removed 515 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 531 rules applied. Total rules applied 1047 place count 244 transition count 13669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1055 place count 236 transition count 13669
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1055 place count 236 transition count 13636
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1121 place count 203 transition count 13636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1128 place count 196 transition count 13629
Iterating global reduction 3 with 7 rules applied. Total rules applied 1135 place count 196 transition count 13629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 5 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1213 place count 157 transition count 13590
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1240 place count 130 transition count 2644
Iterating global reduction 3 with 27 rules applied. Total rules applied 1267 place count 130 transition count 2644
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1278 place count 130 transition count 2633
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1286 place count 122 transition count 2617
Iterating global reduction 4 with 8 rules applied. Total rules applied 1294 place count 122 transition count 2617
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1302 place count 114 transition count 2601
Iterating global reduction 4 with 8 rules applied. Total rules applied 1310 place count 114 transition count 2601
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1334 place count 102 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1335 place count 101 transition count 2592
Iterating global reduction 4 with 1 rules applied. Total rules applied 1336 place count 101 transition count 2592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1337 place count 101 transition count 2591
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1345 place count 101 transition count 2583
Applied a total of 1345 rules in 2934 ms. Remains 101 /872 variables (removed 771) and now considering 2583/14329 (removed 11746) transitions.
[2022-06-10 13:01:58] [INFO ] Flow matrix only has 2574 transitions (discarded 9 similar events)
// Phase 1: matrix 2574 rows 101 cols
[2022-06-10 13:01:58] [INFO ] Computed 2 place invariants in 35 ms
[2022-06-10 13:01:59] [INFO ] Implicit Places using invariants in 673 ms returned []
[2022-06-10 13:01:59] [INFO ] Flow matrix only has 2574 transitions (discarded 9 similar events)
// Phase 1: matrix 2574 rows 101 cols
[2022-06-10 13:01:59] [INFO ] Computed 2 place invariants in 31 ms
[2022-06-10 13:02:00] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-10 13:02:02] [INFO ] Implicit Places using invariants and state equation in 2984 ms returned []
Implicit Place search using SMT with State Equation took 3663 ms to find 0 implicit places.
[2022-06-10 13:02:02] [INFO ] Redundant transitions in 382 ms returned []
[2022-06-10 13:02:02] [INFO ] Flow matrix only has 2574 transitions (discarded 9 similar events)
// Phase 1: matrix 2574 rows 101 cols
[2022-06-10 13:02:02] [INFO ] Computed 2 place invariants in 21 ms
[2022-06-10 13:02:04] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/872 places, 2583/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/872 places, 2583/14329 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s19 1) (EQ s30 1) (EQ s42 1) (EQ s56 1) (EQ s68 1) (EQ s80 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-04 finished in 8468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(X(G(p0)))))||X(F(p1))))'
Support contains 16 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 871 transition count 14328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 871 transition count 14328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 870 transition count 14327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 870 transition count 14327
Applied a total of 4 rules in 347 ms. Remains 870 /872 variables (removed 2) and now considering 14327/14329 (removed 2) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:02:04] [INFO ] Computed 9 place invariants in 339 ms
[2022-06-10 13:02:08] [INFO ] Implicit Places using invariants in 3733 ms returned []
Implicit Place search using SMT only with invariants took 3738 ms to find 0 implicit places.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:02:08] [INFO ] Computed 9 place invariants in 273 ms
[2022-06-10 13:02:21] [INFO ] Dead Transitions using invariants and state equation in 13384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/872 places, 14327/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 870/872 places, 14327/14329 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (EQ s47 1) (EQ s131 1) (EQ s248 1) (EQ s343 1) (EQ s471 1) (EQ s577 1) (EQ s683 1) (EQ s789 1)), p0:(OR (EQ s72 0) (EQ s167 0) (EQ s284 0) (EQ s39...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 727 reset in 1315 ms.
Product exploration explored 100000 steps with 726 reset in 1276 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 43893 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43893 steps, saw 11878 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:02:29] [INFO ] Computed 9 place invariants in 285 ms
[2022-06-10 13:02:29] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2022-06-10 13:02:37] [INFO ] After 7651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-10 13:02:38] [INFO ] After 8508ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 490 ms.
[2022-06-10 13:02:38] [INFO ] After 9291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-06-10 13:02:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-06-10 13:02:47] [INFO ] After 8846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 13:02:50] [INFO ] After 11208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1176 ms.
[2022-06-10 13:02:51] [INFO ] After 12657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 176 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=44 )
Parikh walk visited 3 properties in 20 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 115 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:02:52] [INFO ] Computed 9 place invariants in 291 ms
[2022-06-10 13:02:55] [INFO ] Implicit Places using invariants in 3778 ms returned []
Implicit Place search using SMT only with invariants took 3781 ms to find 0 implicit places.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:02:56] [INFO ] Computed 9 place invariants in 280 ms
[2022-06-10 13:03:07] [INFO ] Dead Transitions using invariants and state equation in 12095 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 870/870 places, 14327/14327 transitions.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 42938 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42938 steps, saw 11708 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:03:12] [INFO ] Computed 9 place invariants in 273 ms
[2022-06-10 13:03:12] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-10 13:03:21] [INFO ] After 8456ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-10 13:03:22] [INFO ] After 9406ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 394 ms.
[2022-06-10 13:03:22] [INFO ] After 10035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-06-10 13:03:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-06-10 13:03:32] [INFO ] After 9543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 13:03:35] [INFO ] After 12134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1259 ms.
[2022-06-10 13:03:36] [INFO ] After 13693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 30 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 724 reset in 1185 ms.
Product exploration explored 100000 steps with 724 reset in 998 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 877 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 2 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 505 rules applied. Total rules applied 506 place count 758 transition count 14199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 514 place count 758 transition count 14191
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 514 place count 758 transition count 14199
Deduced a syphon composed of 521 places in 15 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 530 place count 758 transition count 14199
Discarding 430 places :
Symmetric choice reduction at 2 with 430 rule applications. Total rules 960 place count 328 transition count 13769
Deduced a syphon composed of 98 places in 12 ms
Iterating global reduction 2 with 430 rules applied. Total rules applied 1390 place count 328 transition count 13769
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 8 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 1455 place count 328 transition count 13769
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1534 place count 249 transition count 5410
Deduced a syphon composed of 106 places in 2 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1613 place count 249 transition count 5410
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1619 place count 249 transition count 5404
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1641 place count 227 transition count 5374
Deduced a syphon composed of 92 places in 2 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 1663 place count 227 transition count 5374
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1671 place count 219 transition count 5366
Deduced a syphon composed of 92 places in 2 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1679 place count 219 transition count 5366
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1690 place count 219 transition count 5419
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1709 place count 200 transition count 5381
Deduced a syphon composed of 84 places in 2 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 1728 place count 200 transition count 5381
Deduced a syphon composed of 84 places in 1 ms
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 1748 place count 200 transition count 5361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 85 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1749 place count 200 transition count 5374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1750 place count 199 transition count 5372
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1751 place count 199 transition count 5372
Deduced a syphon composed of 84 places in 1 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1755 place count 199 transition count 5368
Deduced a syphon composed of 84 places in 1 ms
Applied a total of 1755 rules in 5334 ms. Remains 199 /870 variables (removed 671) and now considering 5368/14327 (removed 8959) transitions.
[2022-06-10 13:03:45] [INFO ] Redundant transitions in 730 ms returned []
[2022-06-10 13:03:45] [INFO ] Flow matrix only has 5359 transitions (discarded 9 similar events)
// Phase 1: matrix 5359 rows 199 cols
[2022-06-10 13:03:46] [INFO ] Computed 2 place invariants in 70 ms
[2022-06-10 13:03:51] [INFO ] Dead Transitions using invariants and state equation in 5179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/870 places, 5368/14327 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/870 places, 5368/14327 transitions.
Product exploration explored 100000 steps with 4764 reset in 2089 ms.
Product exploration explored 100000 steps with 4762 reset in 1705 ms.
Built C files in :
/tmp/ltsmin7597239301863649152
[2022-06-10 13:03:55] [INFO ] Built C files in 417ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7597239301863649152
Running compilation step : cd /tmp/ltsmin7597239301863649152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7597239301863649152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7597239301863649152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 120 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:03:58] [INFO ] Computed 9 place invariants in 310 ms
[2022-06-10 13:04:02] [INFO ] Implicit Places using invariants in 3913 ms returned []
Implicit Place search using SMT only with invariants took 3917 ms to find 0 implicit places.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:04:02] [INFO ] Computed 9 place invariants in 300 ms
[2022-06-10 13:04:16] [INFO ] Dead Transitions using invariants and state equation in 14370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 870/870 places, 14327/14327 transitions.
Built C files in :
/tmp/ltsmin16188865259218488149
[2022-06-10 13:04:17] [INFO ] Built C files in 287ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16188865259218488149
Running compilation step : cd /tmp/ltsmin16188865259218488149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16188865259218488149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16188865259218488149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-10 13:04:24] [INFO ] Flatten gal took : 1662 ms
[2022-06-10 13:04:25] [INFO ] Flatten gal took : 1583 ms
[2022-06-10 13:04:26] [INFO ] Time to serialize gal into /tmp/LTL7723124439065485657.gal : 461 ms
[2022-06-10 13:04:26] [INFO ] Time to serialize properties into /tmp/LTL17897687907013957797.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7723124439065485657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17897687907013957797.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7723124...267
Read 1 LTL properties
Checking formula 0 : !(((G(X(X(X(G("((((p90==0)||(p213==0))||((p360==0)||(p495==0)))||(((p618==0)||(p778==0))||((p888==0)||(p1035==0))))"))))))||(X(F("((((...257
Formula 0 simplified : !(GXXXG"((((p90==0)||(p213==0))||((p360==0)||(p495==0)))||(((p618==0)||(p778==0))||((p888==0)||(p1035==0))))" | XF"((((p56==1)&&(p16...240
Detected timeout of ITS tools.
[2022-06-10 13:04:43] [INFO ] Flatten gal took : 1828 ms
[2022-06-10 13:04:43] [INFO ] Applying decomposition
[2022-06-10 13:04:45] [INFO ] Flatten gal took : 1601 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15469118256101349039.txt' '-o' '/tmp/graph15469118256101349039.bin' '-w' '/tmp/graph15469118256101349039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15469118256101349039.bin' '-l' '-1' '-v' '-w' '/tmp/graph15469118256101349039.weights' '-q' '0' '-e' '0.001'
[2022-06-10 13:04:51] [INFO ] Decomposing Gal with order
[2022-06-10 13:04:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 13:04:57] [INFO ] Removed a total of 107155 redundant transitions.
[2022-06-10 13:04:57] [INFO ] Flatten gal took : 4094 ms
[2022-06-10 13:04:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 1687 ms.
[2022-06-10 13:05:00] [INFO ] Time to serialize gal into /tmp/LTL9722668085846392844.gal : 176 ms
[2022-06-10 13:05:00] [INFO ] Time to serialize properties into /tmp/LTL15887792632252584707.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9722668085846392844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15887792632252584707.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9722668...246
Read 1 LTL properties
Checking formula 0 : !(((G(X(X(X(G("((((i2.u15.p90==0)||(i11.u70.p213==0))||((i2.u94.p360==0)||(i2.u151.p495==0)))||(((i11.u208.p618==0)||(i7.u234.p778==0)...381
Formula 0 simplified : !(GXXXG"((((i2.u15.p90==0)||(i11.u70.p213==0))||((i2.u94.p360==0)||(i2.u151.p495==0)))||(((i11.u208.p618==0)||(i7.u234.p778==0))||((...364
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9871717712654478140
[2022-06-10 13:05:15] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9871717712654478140
Running compilation step : cd /tmp/ltsmin9871717712654478140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9871717712654478140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9871717712654478140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyElection-PT-08b-LTLFireability-05 finished in 194308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p0))||X(p1)))||X(X(G(X(p2))))))'
Support contains 17 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Applied a total of 0 rules in 156 ms. Remains 872 /872 variables (removed 0) and now considering 14329/14329 (removed 0) transitions.
// Phase 1: matrix 14329 rows 872 cols
[2022-06-10 13:05:18] [INFO ] Computed 9 place invariants in 322 ms
[2022-06-10 13:05:22] [INFO ] Implicit Places using invariants in 4098 ms returned []
Implicit Place search using SMT only with invariants took 4100 ms to find 0 implicit places.
// Phase 1: matrix 14329 rows 872 cols
[2022-06-10 13:05:23] [INFO ] Computed 9 place invariants in 301 ms
[2022-06-10 13:05:35] [INFO ] Dead Transitions using invariants and state equation in 13058 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 872/872 places, 14329/14329 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (AND (EQ s63 1) (EQ s191 1) (EQ s286 1) (EQ s381 1) (EQ s487 1) (EQ s615 1) (EQ s699 1) (EQ s816 1)) (AND (EQ s25 1) (EQ s144 1) (EQ s239 1) (EQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-06 finished in 17669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))||p1)))'
Support contains 16 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 871 transition count 14328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 871 transition count 14328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 870 transition count 14327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 870 transition count 14327
Applied a total of 4 rules in 478 ms. Remains 870 /872 variables (removed 2) and now considering 14327/14329 (removed 2) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:05:37] [INFO ] Computed 9 place invariants in 460 ms
[2022-06-10 13:05:40] [INFO ] Implicit Places using invariants in 4240 ms returned []
Implicit Place search using SMT only with invariants took 4241 ms to find 0 implicit places.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:05:41] [INFO ] Computed 9 place invariants in 343 ms
[2022-06-10 13:05:53] [INFO ] Dead Transitions using invariants and state equation in 12310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/872 places, 14327/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 870/872 places, 14327/14329 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s36 1) (EQ s153 1) (EQ s259 1) (EQ s343 1) (EQ s471 1) (EQ s577 1) (EQ s672 1) (EQ s789 1)), p0:(AND (EQ s72 1) (EQ s178 1) (EQ s295 1) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-08 finished in 17312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 15 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 880 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 3 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 509 place count 759 transition count 13692
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 524 rules applied. Total rules applied 1033 place count 251 transition count 13676
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1041 place count 243 transition count 13676
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1041 place count 243 transition count 13643
Deduced a syphon composed of 33 places in 15 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1107 place count 210 transition count 13643
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1114 place count 203 transition count 13636
Iterating global reduction 3 with 7 rules applied. Total rules applied 1121 place count 203 transition count 13636
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 11 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1199 place count 164 transition count 13597
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1223 place count 140 transition count 7268
Iterating global reduction 3 with 24 rules applied. Total rules applied 1247 place count 140 transition count 7268
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1255 place count 140 transition count 7260
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1263 place count 132 transition count 7244
Iterating global reduction 4 with 8 rules applied. Total rules applied 1271 place count 132 transition count 7244
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1279 place count 124 transition count 7228
Iterating global reduction 4 with 8 rules applied. Total rules applied 1287 place count 124 transition count 7228
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1311 place count 112 transition count 7235
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1312 place count 111 transition count 7219
Iterating global reduction 4 with 1 rules applied. Total rules applied 1313 place count 111 transition count 7219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1314 place count 111 transition count 7218
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1322 place count 111 transition count 7210
Applied a total of 1322 rules in 4381 ms. Remains 111 /872 variables (removed 761) and now considering 7210/14329 (removed 7119) transitions.
[2022-06-10 13:05:57] [INFO ] Flow matrix only has 7201 transitions (discarded 9 similar events)
// Phase 1: matrix 7201 rows 111 cols
[2022-06-10 13:05:57] [INFO ] Computed 2 place invariants in 122 ms
[2022-06-10 13:05:59] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2022-06-10 13:05:59] [INFO ] Flow matrix only has 7201 transitions (discarded 9 similar events)
// Phase 1: matrix 7201 rows 111 cols
[2022-06-10 13:05:59] [INFO ] Computed 2 place invariants in 124 ms
[2022-06-10 13:06:00] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 2675 ms to find 0 implicit places.
[2022-06-10 13:06:02] [INFO ] Redundant transitions in 1797 ms returned []
[2022-06-10 13:06:02] [INFO ] Flow matrix only has 7201 transitions (discarded 9 similar events)
// Phase 1: matrix 7201 rows 111 cols
[2022-06-10 13:06:02] [INFO ] Computed 2 place invariants in 130 ms
[2022-06-10 13:06:07] [INFO ] Dead Transitions using invariants and state equation in 5174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/872 places, 7210/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/872 places, 7210/14329 transitions.
Stuttering acceptance computed with spot in 645 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s21 1) (EQ s34 1) (EQ s46 1) (EQ s60 1) (EQ s74 1) (EQ s85 1) (EQ s101 1)), p1:(AND (EQ s5 1) (EQ s18 1) (EQ s31 1) (EQ s44 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-10 finished in 14786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(X((p0 U X(p1)))))&&F(p2)&&p3))))'
Support contains 23 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 871 transition count 14328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 871 transition count 14328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 870 transition count 14327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 870 transition count 14327
Applied a total of 4 rules in 618 ms. Remains 870 /872 variables (removed 2) and now considering 14327/14329 (removed 2) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:06:09] [INFO ] Computed 9 place invariants in 511 ms
[2022-06-10 13:06:12] [INFO ] Implicit Places using invariants in 3734 ms returned []
Implicit Place search using SMT only with invariants took 3740 ms to find 0 implicit places.
// Phase 1: matrix 14327 rows 870 cols
[2022-06-10 13:06:13] [INFO ] Computed 9 place invariants in 414 ms
[2022-06-10 13:06:25] [INFO ] Dead Transitions using invariants and state equation in 12681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/872 places, 14327/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 870/872 places, 14327/14329 transitions.
Stuttering acceptance computed with spot in 1740 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=p3, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND p3 (NOT p0)), acceptance={0} source=4 dest: 10}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=4 dest: 11}, { cond=(AND p3 p0), acceptance={0} source=4 dest: 12}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 11}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={0} source=6 dest: 8}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=6 dest: 11}, { cond=(AND p3 p0), acceptance={0} source=6 dest: 12}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=6 dest: 13}, { cond=(AND p3 (NOT p0)), acceptance={0} source=6 dest: 15}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=7 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0} source=7 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 10}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=8 dest: 11}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=10 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={0} source=10 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=12 dest: 8}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=12 dest: 13}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 14}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=12 dest: 15}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=13 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=13 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 7}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=13 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=13 dest: 9}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 10}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=13 dest: 11}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=13 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=14 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=14 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=15 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=15 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=15 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=15 dest: 8}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=15 dest: 12}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=15 dest: 13}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=15 dest: 15}]], initial=0, aps=[p3:(OR (EQ s47 0) (EQ s153 0) (EQ s259 0) (EQ s365 0) (EQ s471 0) (EQ s577 0) (EQ s672 0) (EQ s789 0)), p2:(AND (EQ s72 1) (EQ s167 1) (EQ s295 1) (EQ s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-11 finished in 18987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(((!X(X(!F(p0))) U p1)&&p2))))))'
Support contains 17 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 878 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 2 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 507 place count 759 transition count 13694
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 522 rules applied. Total rules applied 1029 place count 253 transition count 13678
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1037 place count 245 transition count 13678
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1037 place count 245 transition count 13645
Deduced a syphon composed of 33 places in 36 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1103 place count 212 transition count 13645
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1110 place count 205 transition count 13638
Iterating global reduction 3 with 7 rules applied. Total rules applied 1117 place count 205 transition count 13638
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1195 place count 166 transition count 13599
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1220 place count 141 transition count 5083
Iterating global reduction 3 with 25 rules applied. Total rules applied 1245 place count 141 transition count 5083
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1254 place count 141 transition count 5074
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1262 place count 133 transition count 5058
Iterating global reduction 4 with 8 rules applied. Total rules applied 1270 place count 133 transition count 5058
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1278 place count 125 transition count 5042
Iterating global reduction 4 with 8 rules applied. Total rules applied 1286 place count 125 transition count 5042
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1310 place count 113 transition count 5049
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1311 place count 112 transition count 5033
Iterating global reduction 4 with 1 rules applied. Total rules applied 1312 place count 112 transition count 5033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1313 place count 112 transition count 5032
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1321 place count 112 transition count 5024
Applied a total of 1321 rules in 3561 ms. Remains 112 /872 variables (removed 760) and now considering 5024/14329 (removed 9305) transitions.
[2022-06-10 13:06:30] [INFO ] Flow matrix only has 5015 transitions (discarded 9 similar events)
// Phase 1: matrix 5015 rows 112 cols
[2022-06-10 13:06:30] [INFO ] Computed 2 place invariants in 68 ms
[2022-06-10 13:06:31] [INFO ] Implicit Places using invariants in 825 ms returned []
[2022-06-10 13:06:31] [INFO ] Flow matrix only has 5015 transitions (discarded 9 similar events)
// Phase 1: matrix 5015 rows 112 cols
[2022-06-10 13:06:31] [INFO ] Computed 2 place invariants in 66 ms
[2022-06-10 13:06:33] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2376 ms to find 0 implicit places.
[2022-06-10 13:06:34] [INFO ] Redundant transitions in 1101 ms returned []
[2022-06-10 13:06:34] [INFO ] Flow matrix only has 5015 transitions (discarded 9 similar events)
// Phase 1: matrix 5015 rows 112 cols
[2022-06-10 13:06:34] [INFO ] Computed 2 place invariants in 75 ms
[2022-06-10 13:06:37] [INFO ] Dead Transitions using invariants and state equation in 3402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/872 places, 5024/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/872 places, 5024/14329 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s6 0) (EQ s18 0) (EQ s34 0) (EQ s49 0) (EQ s63 0) (EQ s74 0) (EQ s91 0) (EQ s104 0)), p1:(AND (EQ s6 1) (EQ s20 1) (EQ s32 1) (EQ s45 1) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-12 finished in 10778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(F(p1))||p1))))'
Support contains 16 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 879 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 2 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 507 rules applied. Total rules applied 508 place count 759 transition count 13693
Reduce places removed 507 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 523 rules applied. Total rules applied 1031 place count 252 transition count 13677
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1039 place count 244 transition count 13677
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1039 place count 244 transition count 13644
Deduced a syphon composed of 33 places in 10 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1105 place count 211 transition count 13644
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1112 place count 204 transition count 13637
Iterating global reduction 3 with 7 rules applied. Total rules applied 1119 place count 204 transition count 13637
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 11 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1197 place count 165 transition count 13598
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1218 place count 144 transition count 5312
Iterating global reduction 3 with 21 rules applied. Total rules applied 1239 place count 144 transition count 5312
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1244 place count 144 transition count 5307
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1252 place count 136 transition count 5291
Iterating global reduction 4 with 8 rules applied. Total rules applied 1260 place count 136 transition count 5291
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1268 place count 128 transition count 5275
Iterating global reduction 4 with 8 rules applied. Total rules applied 1276 place count 128 transition count 5275
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1300 place count 116 transition count 5282
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1301 place count 115 transition count 5266
Iterating global reduction 4 with 1 rules applied. Total rules applied 1302 place count 115 transition count 5266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1303 place count 115 transition count 5265
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1311 place count 115 transition count 5257
Applied a total of 1311 rules in 3380 ms. Remains 115 /872 variables (removed 757) and now considering 5257/14329 (removed 9072) transitions.
[2022-06-10 13:06:41] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
// Phase 1: matrix 5248 rows 115 cols
[2022-06-10 13:06:41] [INFO ] Computed 2 place invariants in 69 ms
[2022-06-10 13:06:42] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2022-06-10 13:06:42] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
// Phase 1: matrix 5248 rows 115 cols
[2022-06-10 13:06:42] [INFO ] Computed 2 place invariants in 86 ms
[2022-06-10 13:06:45] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 3976 ms to find 0 implicit places.
[2022-06-10 13:06:46] [INFO ] Redundant transitions in 1364 ms returned []
[2022-06-10 13:06:46] [INFO ] Flow matrix only has 5248 transitions (discarded 9 similar events)
// Phase 1: matrix 5248 rows 115 cols
[2022-06-10 13:06:46] [INFO ] Computed 2 place invariants in 72 ms
[2022-06-10 13:06:50] [INFO ] Dead Transitions using invariants and state equation in 3764 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/872 places, 5257/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/872 places, 5257/14329 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s20 1) (EQ s33 1) (EQ s48 1) (EQ s62 1) (EQ s75 1) (EQ s91 1) (EQ s103 1)), p1:(AND (EQ s8 1) (EQ s23 1) (EQ s37 1) (EQ s52 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-14 finished in 12898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F((G(X(p0))&&G(p1)))))))'
Support contains 11 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 14329/14329 transitions.
Graph (trivial) has 884 edges and 872 vertex of which 136 / 872 are part of one of the 24 SCC in 2 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 513 place count 759 transition count 13688
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 528 rules applied. Total rules applied 1041 place count 247 transition count 13672
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1049 place count 239 transition count 13672
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1049 place count 239 transition count 13639
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1115 place count 206 transition count 13639
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1122 place count 199 transition count 13632
Iterating global reduction 3 with 7 rules applied. Total rules applied 1129 place count 199 transition count 13632
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 8 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1207 place count 160 transition count 13593
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1233 place count 134 transition count 3619
Iterating global reduction 3 with 26 rules applied. Total rules applied 1259 place count 134 transition count 3619
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1269 place count 134 transition count 3609
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1277 place count 126 transition count 3593
Iterating global reduction 4 with 8 rules applied. Total rules applied 1285 place count 126 transition count 3593
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1293 place count 118 transition count 3577
Iterating global reduction 4 with 8 rules applied. Total rules applied 1301 place count 118 transition count 3577
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1325 place count 106 transition count 3584
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1326 place count 105 transition count 3568
Iterating global reduction 4 with 1 rules applied. Total rules applied 1327 place count 105 transition count 3568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1328 place count 105 transition count 3567
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1336 place count 105 transition count 3559
Applied a total of 1336 rules in 2994 ms. Remains 105 /872 variables (removed 767) and now considering 3559/14329 (removed 10770) transitions.
[2022-06-10 13:06:53] [INFO ] Flow matrix only has 3550 transitions (discarded 9 similar events)
// Phase 1: matrix 3550 rows 105 cols
[2022-06-10 13:06:53] [INFO ] Computed 2 place invariants in 41 ms
[2022-06-10 13:06:54] [INFO ] Implicit Places using invariants in 930 ms returned []
[2022-06-10 13:06:54] [INFO ] Flow matrix only has 3550 transitions (discarded 9 similar events)
// Phase 1: matrix 3550 rows 105 cols
[2022-06-10 13:06:54] [INFO ] Computed 2 place invariants in 57 ms
[2022-06-10 13:06:55] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-10 13:06:59] [INFO ] Implicit Places using invariants and state equation in 4433 ms returned []
Implicit Place search using SMT with State Equation took 5367 ms to find 0 implicit places.
[2022-06-10 13:06:59] [INFO ] Redundant transitions in 380 ms returned []
[2022-06-10 13:06:59] [INFO ] Flow matrix only has 3550 transitions (discarded 9 similar events)
// Phase 1: matrix 3550 rows 105 cols
[2022-06-10 13:06:59] [INFO ] Computed 2 place invariants in 40 ms
[2022-06-10 13:07:02] [INFO ] Dead Transitions using invariants and state equation in 2417 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/872 places, 3559/14329 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/872 places, 3559/14329 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={1} source=0 dest: 1}, { cond=p1, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s19 0) (EQ s29 0) (EQ s43 0) (EQ s55 0) (EQ s70 0) (EQ s81 0) (EQ s96 0)), p0:(AND (EQ s5 1) (EQ s19 1) (EQ s29 1) (EQ s40 1) (EQ s55...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22706 steps with 1463 reset in 389 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-15 finished in 11750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(X(G(p0)))))||X(F(p1))))'
[2022-06-10 13:07:04] [INFO ] Flatten gal took : 1804 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2867004506637721029
[2022-06-10 13:07:06] [INFO ] Too many transitions (14329) to apply POR reductions. Disabling POR matrices.
[2022-06-10 13:07:06] [INFO ] Built C files in 804ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2867004506637721029
Running compilation step : cd /tmp/ltsmin2867004506637721029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-10 13:07:08] [INFO ] Applying decomposition
[2022-06-10 13:07:11] [INFO ] Flatten gal took : 2553 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9730183855366070703.txt' '-o' '/tmp/graph9730183855366070703.bin' '-w' '/tmp/graph9730183855366070703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9730183855366070703.bin' '-l' '-1' '-v' '-w' '/tmp/graph9730183855366070703.weights' '-q' '0' '-e' '0.001'
[2022-06-10 13:07:19] [INFO ] Decomposing Gal with order
[2022-06-10 13:07:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 13:07:25] [INFO ] Removed a total of 107148 redundant transitions.
[2022-06-10 13:07:26] [INFO ] Flatten gal took : 3945 ms
[2022-06-10 13:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 1985 ms.
[2022-06-10 13:07:29] [INFO ] Time to serialize gal into /tmp/LTLFireability1184980983433964232.gal : 1144 ms
[2022-06-10 13:07:29] [INFO ] Time to serialize properties into /tmp/LTLFireability4698088302170687642.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1184980983433964232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4698088302170687642.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !(((G(X(X(X(G("((((i24.u3.p90==0)||(i5.u68.p213==0))||((i1.u102.p360==0)||(i1.u137.p495==0)))||(((i5.u202.p618==0)||(i1.u225.p778==0))...383
Formula 0 simplified : !(GXXXG"((((i24.u3.p90==0)||(i5.u68.p213==0))||((i1.u102.p360==0)||(i1.u137.p495==0)))||(((i5.u202.p618==0)||(i1.u225.p778==0))||((i...366
Compilation finished in 368335 ms.
Running link step : cd /tmp/ltsmin2867004506637721029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 363 ms.
Running LTSmin : cd /tmp/ltsmin2867004506637721029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X(X(X([]((LTLAPp0==true))))))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-10 13:29:59] [INFO ] Applying decomposition
[2022-06-10 13:30:03] [INFO ] Flatten gal took : 4602 ms
[2022-06-10 13:30:08] [INFO ] Decomposing Gal with order
[2022-06-10 13:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 13:30:24] [INFO ] Removed a total of 107021 redundant transitions.
[2022-06-10 13:30:24] [INFO ] Flatten gal took : 11119 ms
[2022-06-10 13:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 1297 ms.
[2022-06-10 13:30:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8517330217619285397.gal : 6 ms
[2022-06-10 13:30:27] [INFO ] Time to serialize properties into /tmp/LTLFireability18347222562090203963.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8517330217619285397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18347222562090203963.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((G(X(X(X(G("((((i0.i0.i0.i0.i0.i0.i0.u8.p90==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p213==0))||((i0.i0.i0.i0.i0.i0.u10.p360==0)||(i0.i0.i0.i0...527
Formula 0 simplified : !(GXXXG"((((i0.i0.i0.i0.i0.i0.i0.u8.p90==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p213==0))||((i0.i0.i0.i0.i0.i0.u10.p360==0)||(i0.i0.i0.i0.i0.u...510
Reverse transition relation is NOT exact ! Due to transitions t907, i0.u15.t91, i0.u15.t100, i0.u15.t134, i0.u15.t135, i0.u15.t136, i0.u15.t169, i0.u15.t17...1631
Computing Next relation with stutter on 5.5553e+07 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
8402 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,84.1277,1057700,1,0,768890,1.94181e+06,13275,1.94577e+06,4826,8.54778e+06,522589
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyElection-PT-08b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2045607 ms.

BK_STOP 1654868055797

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="StigmergyElection-PT-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872800356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08b.tgz
mv StigmergyElection-PT-08b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;