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-165463872700274.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-03b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 30 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.5K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 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 117K 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-03b-CTLFireability-00
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-01
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-02
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-03
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-04
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-05
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-06
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-07
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-08
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-09
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-10
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-11
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-12
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-13
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-14
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654840955160

Running Version 202205111006
[2022-06-10 06:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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 06:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 06:02:37] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-06-10 06:02:37] [INFO ] Transformed 427 places.
[2022-06-10 06:02:37] [INFO ] Transformed 518 transitions.
[2022-06-10 06:02:37] [INFO ] Found NUPN structural information;
[2022-06-10 06:02:37] [INFO ] Parsed PT model containing 427 places and 518 transitions in 451 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 92 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 386 transition count 477
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 386 transition count 477
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 101 place count 367 transition count 458
Iterating global reduction 0 with 19 rules applied. Total rules applied 120 place count 367 transition count 458
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 363 transition count 454
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 363 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 362 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 362 transition count 453
Applied a total of 130 rules in 192 ms. Remains 362 /427 variables (removed 65) and now considering 453/518 (removed 65) transitions.
// Phase 1: matrix 453 rows 362 cols
[2022-06-10 06:02:38] [INFO ] Computed 4 place invariants in 31 ms
[2022-06-10 06:02:38] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 453 rows 362 cols
[2022-06-10 06:02:38] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-10 06:02:39] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
// Phase 1: matrix 453 rows 362 cols
[2022-06-10 06:02:39] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:02:39] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/427 places, 453/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 362/427 places, 453/518 transitions.
Support contains 92 out of 362 places after structural reductions.
[2022-06-10 06:02:40] [INFO ] Flatten gal took : 137 ms
[2022-06-10 06:02:40] [INFO ] Flatten gal took : 58 ms
[2022-06-10 06:02:40] [INFO ] Input system was already deterministic with 453 transitions.
Support contains 90 out of 362 places (down from 92) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 951 ms. (steps per millisecond=10 ) properties (out of 65) seen :32
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) 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 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 453 rows 362 cols
[2022-06-10 06:02:41] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:02:42] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-06-10 06:02:43] [INFO ] After 487ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:29
[2022-06-10 06:02:43] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 8 ms to minimize.
[2022-06-10 06:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2022-06-10 06:02:43] [INFO ] After 817ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2022-06-10 06:02:43] [INFO ] After 1391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2022-06-10 06:02:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:02:45] [INFO ] After 1149ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :29
[2022-06-10 06:02:45] [INFO ] Deduced a trap composed of 206 places in 245 ms of which 3 ms to minimize.
[2022-06-10 06:02:45] [INFO ] Deduced a trap composed of 172 places in 223 ms of which 2 ms to minimize.
[2022-06-10 06:02:46] [INFO ] Deduced a trap composed of 171 places in 230 ms of which 3 ms to minimize.
[2022-06-10 06:02:46] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 2 ms to minimize.
[2022-06-10 06:02:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1035 ms
[2022-06-10 06:02:46] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 1 ms to minimize.
[2022-06-10 06:02:46] [INFO ] Deduced a trap composed of 174 places in 144 ms of which 1 ms to minimize.
[2022-06-10 06:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2022-06-10 06:02:47] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 2 ms to minimize.
[2022-06-10 06:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-06-10 06:02:47] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2022-06-10 06:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-06-10 06:02:48] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 1 ms to minimize.
[2022-06-10 06:02:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 192 ms
[2022-06-10 06:02:48] [INFO ] After 4233ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :27
Attempting to minimize the solution found.
Minimization took 681 ms.
[2022-06-10 06:02:49] [INFO ] After 5649ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :27
Fused 30 Parikh solutions to 27 different solutions.
Parikh walk visited 22 properties in 311 ms.
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 359 edges and 362 vertex of which 39 / 362 are part of one of the 6 SCC in 17 ms
Free SCC test removed 33 places
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 540 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 227 rules applied. Total rules applied 229 place count 328 transition count 183
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 232 rules applied. Total rules applied 461 place count 102 transition count 177
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 466 place count 99 transition count 175
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 470 place count 97 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 471 place count 96 transition count 173
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 471 place count 96 transition count 160
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 497 place count 83 transition count 160
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 502 place count 78 transition count 155
Iterating global reduction 5 with 5 rules applied. Total rules applied 507 place count 78 transition count 155
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 509 place count 76 transition count 145
Iterating global reduction 5 with 2 rules applied. Total rules applied 511 place count 76 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 512 place count 76 transition count 144
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 544 place count 60 transition count 128
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 549 place count 60 transition count 123
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 560 place count 49 transition count 83
Iterating global reduction 7 with 11 rules applied. Total rules applied 571 place count 49 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 577 place count 49 transition count 77
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 579 place count 47 transition count 75
Iterating global reduction 8 with 2 rules applied. Total rules applied 581 place count 47 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 589 place count 43 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 599 place count 38 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 600 place count 38 transition count 78
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 604 place count 38 transition count 74
Free-agglomeration rule applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 621 place count 38 transition count 57
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 643 place count 21 transition count 52
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 645 place count 19 transition count 50
Iterating global reduction 10 with 2 rules applied. Total rules applied 647 place count 19 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 650 place count 19 transition count 47
Applied a total of 650 rules in 79 ms. Remains 19 /362 variables (removed 343) and now considering 47/453 (removed 406) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/362 places, 47/453 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 47 rows 19 cols
[2022-06-10 06:02:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:02:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-10 06:02:50] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 06:02:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-10 06:02:50] [INFO ] After 11ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 06:02:50] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 06:02:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-10 06:02:50] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 06:02:50] [INFO ] After 10ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 06:02:50] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-10 06:02:50] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2022-06-10 06:02:50] [INFO ] Flatten gal took : 33 ms
[2022-06-10 06:02:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-03b-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 06:02:50] [INFO ] Flatten gal took : 32 ms
[2022-06-10 06:02:50] [INFO ] Input system was already deterministic with 453 transitions.
Support contains 78 out of 362 places (down from 82) after GAL structural reductions.
Computed a total of 48 stabilizing places and 51 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 343 transition count 434
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 343 transition count 434
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 335 transition count 426
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 335 transition count 426
Applied a total of 54 rules in 37 ms. Remains 335 /362 variables (removed 27) and now considering 426/453 (removed 27) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:02:50] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:02:50] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:02:50] [INFO ] Computed 4 place invariants in 11 ms
[2022-06-10 06:02:50] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:02:50] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 06:02:51] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/362 places, 426/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/362 places, 426/453 transitions.
[2022-06-10 06:02:51] [INFO ] Flatten gal took : 40 ms
[2022-06-10 06:02:51] [INFO ] Flatten gal took : 36 ms
[2022-06-10 06:02:51] [INFO ] Input system was already deterministic with 426 transitions.
[2022-06-10 06:02:51] [INFO ] Flatten gal took : 32 ms
[2022-06-10 06:02:51] [INFO ] Flatten gal took : 29 ms
[2022-06-10 06:02:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3913928458438420690.gal : 18 ms
[2022-06-10 06:02:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2057084711066267348.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3913928458438420690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2057084711066267348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04368e+07,1.92458,53848,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(AX(AX((p294==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U !(EX(!(!(EX(!((p294==1)))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2022-06-10 06:03:21] [INFO ] Flatten gal took : 22 ms
[2022-06-10 06:03:21] [INFO ] Applying decomposition
[2022-06-10 06:03:21] [INFO ] Flatten gal took : 19 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/graph10600013960853958493.txt' '-o' '/tmp/graph10600013960853958493.bin' '-w' '/tmp/graph10600013960853958493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10600013960853958493.bin' '-l' '-1' '-v' '-w' '/tmp/graph10600013960853958493.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:03:21] [INFO ] Decomposing Gal with order
[2022-06-10 06:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:03:22] [INFO ] Removed a total of 340 redundant transitions.
[2022-06-10 06:03:22] [INFO ] Flatten gal took : 106 ms
[2022-06-10 06:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2022-06-10 06:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1334083849129174657.gal : 13 ms
[2022-06-10 06:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1086858076191056076.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1334083849129174657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1086858076191056076.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04368e+07,0.134554,8196,592,20,5641,358,639,6110,69,686,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(AX(AX((i18.u88.p294==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U !(EX(!(!(EX(!((i18.u88.p294==1)))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t95, t96, t130, t132, t149, t193, t194, t228, t230, t246, t291, t324, t325, t327, t344, t345,...389
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,4.52415,144596,1,0,293220,476,4792,418137,324,1472,702176
FORMULA StigmergyElection-PT-03b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 368 edges and 362 vertex of which 54 / 362 are part of one of the 9 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 220 place count 316 transition count 182
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 225 rules applied. Total rules applied 445 place count 97 transition count 176
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 449 place count 94 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 93 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 450 place count 93 transition count 165
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 470 place count 83 transition count 165
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 478 place count 75 transition count 156
Iterating global reduction 4 with 8 rules applied. Total rules applied 486 place count 75 transition count 156
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 488 place count 73 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 73 transition count 146
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 516 place count 60 transition count 133
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 527 place count 49 transition count 95
Iterating global reduction 4 with 11 rules applied. Total rules applied 538 place count 49 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 543 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 546 place count 46 transition count 84
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 46 transition count 84
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 551 place count 44 transition count 80
Iterating global reduction 5 with 2 rules applied. Total rules applied 553 place count 44 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 43 transition count 79
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 556 place count 42 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 558 place count 42 transition count 75
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 561 place count 42 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 567 place count 39 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 568 place count 38 transition count 68
Applied a total of 568 rules in 45 ms. Remains 38 /362 variables (removed 324) and now considering 68/453 (removed 385) transitions.
[2022-06-10 06:03:26] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2022-06-10 06:03:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:03:26] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-10 06:03:26] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2022-06-10 06:03:26] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 06:03:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 06:03:26] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-06-10 06:03:26] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:03:26] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2022-06-10 06:03:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:03:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/362 places, 68/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/362 places, 68/453 transitions.
[2022-06-10 06:03:26] [INFO ] Flatten gal took : 5 ms
[2022-06-10 06:03:26] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:03:27] [INFO ] Input system was already deterministic with 68 transitions.
[2022-06-10 06:03:27] [INFO ] Flatten gal took : 4 ms
[2022-06-10 06:03:27] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:03:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8236336104656227330.gal : 1 ms
[2022-06-10 06:03:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4738243851723376291.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8236336104656227330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4738243851723376291.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2884,0.03361,5164,2,572,5,3171,6,0,214,3531,0


Converting to forward existential form...Done !
original formula: AF((p88==1))
=> equivalent forward existential formula: [FwdG(Init,!((p88==1)))] = FALSE
Hit Full ! (commute/partial/dont) 66/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,0,0.163275,9564,1,0,19,20602,20,4,1210,22333,18
FORMULA StigmergyElection-PT-03b-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 345 transition count 436
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 345 transition count 436
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 338 transition count 429
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 338 transition count 429
Applied a total of 48 rules in 21 ms. Remains 338 /362 variables (removed 24) and now considering 429/453 (removed 24) transitions.
// Phase 1: matrix 429 rows 338 cols
[2022-06-10 06:03:27] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:03:27] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 429 rows 338 cols
[2022-06-10 06:03:27] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:03:27] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
// Phase 1: matrix 429 rows 338 cols
[2022-06-10 06:03:27] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 06:03:28] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/362 places, 429/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 338/362 places, 429/453 transitions.
[2022-06-10 06:03:28] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:03:28] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:03:28] [INFO ] Input system was already deterministic with 429 transitions.
[2022-06-10 06:03:28] [INFO ] Flatten gal took : 15 ms
[2022-06-10 06:03:28] [INFO ] Flatten gal took : 15 ms
[2022-06-10 06:03:28] [INFO ] Time to serialize gal into /tmp/CTLFireability498352142881531722.gal : 3 ms
[2022-06-10 06:03:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17223294380641608955.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability498352142881531722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17223294380641608955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06235e+07,1.96493,55976,2,6729,5,169938,6,0,1783,255461,0


Converting to forward existential form...Done !
original formula: E(EX(EF((A((p20==1) U (p394==1)) * (((p96==1)||(p121==1))||(((p85==1)&&(p208==1))&&((p355==1)&&(p98==1))))))) U EX(AF(((p160==1)&&(p410==...161
=> equivalent forward existential formula: [(EY(FwdU(Init,EX(E(TRUE U (!((E(!((p394==1)) U (!((p20==1)) * !((p394==1)))) + EG(!((p394==1))))) * (((p96==1)|...266
Reverse transition relation is NOT exact ! Due to transitions t24, t52, t61, t95, t96, t97, t130, t131, t133, t150, t159, t193, t194, t195, t228, t229, t23...324
Detected timeout of ITS tools.
[2022-06-10 06:03:58] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:03:58] [INFO ] Applying decomposition
[2022-06-10 06:03:58] [INFO ] Flatten gal took : 15 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/graph7521655887556003542.txt' '-o' '/tmp/graph7521655887556003542.bin' '-w' '/tmp/graph7521655887556003542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7521655887556003542.bin' '-l' '-1' '-v' '-w' '/tmp/graph7521655887556003542.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:03:58] [INFO ] Decomposing Gal with order
[2022-06-10 06:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:03:58] [INFO ] Removed a total of 331 redundant transitions.
[2022-06-10 06:03:58] [INFO ] Flatten gal took : 37 ms
[2022-06-10 06:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2022-06-10 06:03:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4828807370063042327.gal : 7 ms
[2022-06-10 06:03:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7691342706355318008.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4828807370063042327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7691342706355318008.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06235e+07,0.226645,8324,679,22,5891,416,608,7396,74,910,0


Converting to forward existential form...Done !
original formula: E(EX(EF((A((i0.u6.p20==1) U (i17.u81.p394==1)) * (((i3.i1.i2.u29.p96==1)||(i3.i1.i2.u36.p121==1))||(((i3.i1.i0.u24.p85==1)&&(i10.u57.p208...260
=> equivalent forward existential formula: [(EY(FwdU(Init,EX(E(TRUE U (!((E(!((i17.u81.p394==1)) U (!((i0.u6.p20==1)) * !((i17.u81.p394==1)))) + EG(!((i17....381
Reverse transition relation is NOT exact ! Due to transitions t52, t97, t130, t131, t133, t195, t228, t229, t231, t292, t294, t328, t330, t348, t350, i0.t2...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 0,0,7.04613,195032,1,0,392574,640,4804,569826,332,1705,776822
FORMULA StigmergyElection-PT-03b-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 357 edges and 362 vertex of which 45 / 362 are part of one of the 8 SCC in 2 ms
Free SCC test removed 37 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 324 transition count 194
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 223 rules applied. Total rules applied 441 place count 107 transition count 188
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 447 place count 104 transition count 185
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 452 place count 101 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 453 place count 100 transition count 183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 453 place count 100 transition count 174
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 471 place count 91 transition count 174
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 479 place count 83 transition count 165
Iterating global reduction 5 with 8 rules applied. Total rules applied 487 place count 83 transition count 165
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 489 place count 81 transition count 155
Iterating global reduction 5 with 2 rules applied. Total rules applied 491 place count 81 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 492 place count 81 transition count 154
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 518 place count 68 transition count 141
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 526 place count 60 transition count 109
Iterating global reduction 6 with 8 rules applied. Total rules applied 534 place count 60 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 539 place count 60 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 541 place count 59 transition count 103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 542 place count 58 transition count 97
Iterating global reduction 7 with 1 rules applied. Total rules applied 543 place count 58 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 544 place count 58 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 548 place count 58 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 556 place count 54 transition count 88
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 54 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 558 place count 53 transition count 87
Applied a total of 558 rules in 84 ms. Remains 53 /362 variables (removed 309) and now considering 87/453 (removed 366) transitions.
[2022-06-10 06:04:05] [INFO ] Flow matrix only has 82 transitions (discarded 5 similar events)
// Phase 1: matrix 82 rows 53 cols
[2022-06-10 06:04:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:04:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-06-10 06:04:05] [INFO ] Flow matrix only has 82 transitions (discarded 5 similar events)
// Phase 1: matrix 82 rows 53 cols
[2022-06-10 06:04:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:04:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 06:04:05] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-10 06:04:05] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:04:05] [INFO ] Flow matrix only has 82 transitions (discarded 5 similar events)
// Phase 1: matrix 82 rows 53 cols
[2022-06-10 06:04:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:04:06] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/362 places, 87/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/362 places, 87/453 transitions.
[2022-06-10 06:04:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 06:04:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 06:04:06] [INFO ] Input system was already deterministic with 87 transitions.
[2022-06-10 06:04:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 06:04:06] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:04:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7240869243846528714.gal : 1 ms
[2022-06-10 06:04:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14947484714497600986.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7240869243846528714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14947484714497600986.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5044,0.05452,6220,2,1015,5,5646,6,0,292,6121,0


Converting to forward existential form...Done !
original formula: ((EF(!(E((p57==1) U (p140==1)))) * !(A((p336==1) U A((p76==1) U (p9==1))))) * AF(EG((p272==1))))
=> equivalent forward existential formula: (([(Init * !(E(TRUE U !(E((p57==1) U (p140==1))))))] = FALSE * [((Init * !(EG(!(!((E(!((p9==1)) U (!((p76==1)) *...406
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t9, t11, t12, t17, t19, t20, t45, t46, t48, t53, t54, t55, t62, t63, t67, t77, t78, t...277
(forward)formula 0,0,0.358385,16104,1,0,225,47257,192,97,2131,46400,249
FORMULA StigmergyElection-PT-03b-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 344 transition count 435
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 344 transition count 435
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 337 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 337 transition count 428
Applied a total of 50 rules in 18 ms. Remains 337 /362 variables (removed 25) and now considering 428/453 (removed 25) transitions.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:04:06] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:04:06] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:04:06] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-10 06:04:06] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:04:06] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:04:07] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/362 places, 428/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/362 places, 428/453 transitions.
[2022-06-10 06:04:07] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:04:07] [INFO ] Flatten gal took : 13 ms
[2022-06-10 06:04:07] [INFO ] Input system was already deterministic with 428 transitions.
[2022-06-10 06:04:07] [INFO ] Flatten gal took : 12 ms
[2022-06-10 06:04:07] [INFO ] Flatten gal took : 12 ms
[2022-06-10 06:04:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17040929477465653238.gal : 4 ms
[2022-06-10 06:04:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8081916134641750048.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17040929477465653238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8081916134641750048.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05184e+07,1.92933,55408,2,6138,5,165779,6,0,1778,254082,0


Converting to forward existential form...Done !
original formula: AF((AX(AX(EF((p314==1)))) + (((AF((p370==1)) * AF((((p51==0)||(p161==0))||(p296==0)))) * (!(A((p392==1) U (((p119==1)&&(p254==1))&&(p391=...212
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EX(!(E(TRUE U (p314==1)))))))) + (((!(EG(!((p370==1)))) * !(EG(!((((p51==0)||(p161==0))||...392
Reverse transition relation is NOT exact ! Due to transitions t53, t62, t96, t97, t98, t131, t134, t135, t151, t160, t194, t195, t196, t229, t230, t232, t2...313
Detected timeout of ITS tools.
[2022-06-10 06:04:37] [INFO ] Flatten gal took : 14 ms
[2022-06-10 06:04:37] [INFO ] Applying decomposition
[2022-06-10 06:04:37] [INFO ] Flatten gal took : 16 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/graph3611386172395626480.txt' '-o' '/tmp/graph3611386172395626480.bin' '-w' '/tmp/graph3611386172395626480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3611386172395626480.bin' '-l' '-1' '-v' '-w' '/tmp/graph3611386172395626480.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:04:37] [INFO ] Decomposing Gal with order
[2022-06-10 06:04:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:04:37] [INFO ] Removed a total of 331 redundant transitions.
[2022-06-10 06:04:37] [INFO ] Flatten gal took : 36 ms
[2022-06-10 06:04:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2022-06-10 06:04:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7758188725775844199.gal : 5 ms
[2022-06-10 06:04:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16670045926696207008.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7758188725775844199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16670045926696207008.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05184e+07,0.154658,8808,684,22,6447,411,636,7845,62,920,0


Converting to forward existential form...Done !
original formula: AF((AX(AX(EF((i17.i1.u93.p314==1)))) + (((AF((i17.i2.u112.p370==1)) * AF((((i2.i2.u16.p51==0)||(i10.i0.u43.p161==0))||(i16.i0.u86.p296==0...338
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EX(!(E(TRUE U (i17.i1.u93.p314==1)))))))) + (((!(EG(!((i17.i2.u112.p370==1)))) * !(EG(!((...582
Reverse transition relation is NOT exact ! Due to transitions t53, t98, t131, t134, t196, t229, t230, t232, t293, t326, t327, t329, t347, t349, i2.i2.u37.t...400
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,1,7.30444,216840,1,0,425677,504,4877,589391,289,1591,1036733
FORMULA StigmergyElection-PT-03b-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 344 transition count 435
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 344 transition count 435
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 336 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 336 transition count 427
Applied a total of 52 rules in 32 ms. Remains 336 /362 variables (removed 26) and now considering 427/453 (removed 26) transitions.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:04:45] [INFO ] Computed 4 place invariants in 22 ms
[2022-06-10 06:04:45] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:04:45] [INFO ] Computed 4 place invariants in 16 ms
[2022-06-10 06:04:45] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:04:45] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:04:46] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/362 places, 427/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/362 places, 427/453 transitions.
[2022-06-10 06:04:46] [INFO ] Flatten gal took : 21 ms
[2022-06-10 06:04:46] [INFO ] Flatten gal took : 21 ms
[2022-06-10 06:04:46] [INFO ] Input system was already deterministic with 427 transitions.
[2022-06-10 06:04:46] [INFO ] Flatten gal took : 20 ms
[2022-06-10 06:04:46] [INFO ] Flatten gal took : 20 ms
[2022-06-10 06:04:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9331406131355538080.gal : 3 ms
[2022-06-10 06:04:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11324170429066588998.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9331406131355538080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11324170429066588998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08856e+07,3.26107,68152,2,8519,5,196604,6,0,1773,327079,0


Converting to forward existential form...Done !
original formula: AX((EF((AF((p238==1)) * ((p217==1)||(p155==1)))) * ((p424==0) + (EX((p126==1)) * (p316==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (!(EG(!((p238==1)))) * ((p217==1)||(p155==1))))))] = FALSE * ([((EY(Init) * !((p424==0)...243
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t52, t61, t95, t96, t97, t130, t131, t132, t133, t150, t159, t193, t194, t195, t228...347
Detected timeout of ITS tools.
[2022-06-10 06:05:16] [INFO ] Flatten gal took : 12 ms
[2022-06-10 06:05:16] [INFO ] Applying decomposition
[2022-06-10 06:05:16] [INFO ] Flatten gal took : 11 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/graph8840515399476679859.txt' '-o' '/tmp/graph8840515399476679859.bin' '-w' '/tmp/graph8840515399476679859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8840515399476679859.bin' '-l' '-1' '-v' '-w' '/tmp/graph8840515399476679859.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:05:16] [INFO ] Decomposing Gal with order
[2022-06-10 06:05:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:05:16] [INFO ] Removed a total of 326 redundant transitions.
[2022-06-10 06:05:16] [INFO ] Flatten gal took : 43 ms
[2022-06-10 06:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2022-06-10 06:05:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8710800854694056969.gal : 4 ms
[2022-06-10 06:05:16] [INFO ] Time to serialize properties into /tmp/CTLFireability768032649234384677.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8710800854694056969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability768032649234384677.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08856e+07,0.266832,9104,832,28,7175,468,641,8588,59,978,0


Converting to forward existential form...Done !
original formula: AX((EF((AF((i15.u70.p238==1)) * ((i13.i1.u63.p217==1)||(i9.i1.u41.p155==1)))) * ((i25.i0.u120.p424==0) + (EX((i7.u35.p126==1)) * (i19.i1....171
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (!(EG(!((i15.u70.p238==1)))) * ((i13.i1.u63.p217==1)||(i9.i1.u41.p155==1))))))] = FALSE...314
Reverse transition relation is NOT exact ! Due to transitions t97, t130, t131, t133, t150, t195, t228, t229, t231, t247, t290, t292, t326, t328, t345, t346...460
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,4.96587,128812,1,0,245286,468,4587,352431,279,1056,657078
FORMULA StigmergyElection-PT-03b-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 348 transition count 439
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 348 transition count 439
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 344 transition count 435
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 344 transition count 435
Applied a total of 36 rules in 20 ms. Remains 344 /362 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 344 cols
[2022-06-10 06:05:21] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:05:21] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 435 rows 344 cols
[2022-06-10 06:05:21] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:05:21] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 344 cols
[2022-06-10 06:05:21] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:05:22] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/362 places, 435/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/362 places, 435/453 transitions.
[2022-06-10 06:05:22] [INFO ] Flatten gal took : 11 ms
[2022-06-10 06:05:22] [INFO ] Flatten gal took : 15 ms
[2022-06-10 06:05:22] [INFO ] Input system was already deterministic with 435 transitions.
[2022-06-10 06:05:22] [INFO ] Flatten gal took : 18 ms
[2022-06-10 06:05:22] [INFO ] Flatten gal took : 23 ms
[2022-06-10 06:05:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17255024230883058897.gal : 4 ms
[2022-06-10 06:05:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7772747708226111961.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17255024230883058897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7772747708226111961.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09895e+07,2.5177,55128,2,6241,5,167043,6,0,1813,247950,0


Converting to forward existential form...Done !
original formula: AG(((EX((p281==1)) + AX(((p187==0)&&(p278==0)))) + ((p110==1) + ((EG((p222==0)) * (p146==1)) * ((p331==0)||((p203==0)&&(p383==0)))))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((p110==1) + ((EG((p222==0)) * (p146==1)) * ((p331==0)||((p203==0)&&(p383==0))))))) *...212
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t96, t98, t99, t135, t137, t154, t163, t199, t200, t201, t236, t237, t239, t255, t2...313
Detected timeout of ITS tools.
[2022-06-10 06:05:52] [INFO ] Flatten gal took : 19 ms
[2022-06-10 06:05:52] [INFO ] Applying decomposition
[2022-06-10 06:05:52] [INFO ] Flatten gal took : 11 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/graph2280897603636667227.txt' '-o' '/tmp/graph2280897603636667227.bin' '-w' '/tmp/graph2280897603636667227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2280897603636667227.bin' '-l' '-1' '-v' '-w' '/tmp/graph2280897603636667227.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:05:52] [INFO ] Decomposing Gal with order
[2022-06-10 06:05:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:05:52] [INFO ] Removed a total of 315 redundant transitions.
[2022-06-10 06:05:52] [INFO ] Flatten gal took : 31 ms
[2022-06-10 06:05:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2022-06-10 06:05:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1528000196438922503.gal : 4 ms
[2022-06-10 06:05:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1612006113594786873.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1528000196438922503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1612006113594786873.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09895e+07,0.179519,9312,635,24,7640,500,731,8270,62,1019,0


Converting to forward existential form...Done !
original formula: AG(((EX((i17.i1.u81.p281==1)) + AX(((i4.i1.u55.p187==0)&&(i17.i1.u81.p278==0)))) + ((i0.u32.p110==1) + ((EG((i9.u66.p222==0)) * (i10.i0.u...243
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((i0.u32.p110==1) + ((EG((i9.u66.p222==0)) * (i10.i0.u42.p146==1)) * ((i20.i0.u96.p33...303
Reverse transition relation is NOT exact ! Due to transitions t51, t98, t99, t135, t137, t154, t200, t201, t237, t239, t255, t300, t333, t334, t336, t353, ...378
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,2.99418,97488,1,0,186940,529,5323,302860,307,1299,518296
FORMULA StigmergyElection-PT-03b-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 343 edges and 362 vertex of which 52 / 362 are part of one of the 9 SCC in 2 ms
Free SCC test removed 43 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 319 transition count 207
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 204 rules applied. Total rules applied 403 place count 121 transition count 201
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 415 place count 118 transition count 192
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 424 place count 109 transition count 192
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 424 place count 109 transition count 181
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 446 place count 98 transition count 181
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 453 place count 91 transition count 173
Iterating global reduction 4 with 7 rules applied. Total rules applied 460 place count 91 transition count 173
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 462 place count 89 transition count 163
Iterating global reduction 4 with 2 rules applied. Total rules applied 464 place count 89 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 465 place count 89 transition count 162
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 493 place count 75 transition count 148
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 501 place count 67 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 509 place count 67 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 513 place count 67 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 514 place count 66 transition count 110
Iterating global reduction 6 with 1 rules applied. Total rules applied 515 place count 66 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 516 place count 65 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 517 place count 65 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 521 place count 65 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 529 place count 61 transition count 101
Applied a total of 529 rules in 34 ms. Remains 61 /362 variables (removed 301) and now considering 101/453 (removed 352) transitions.
[2022-06-10 06:05:55] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
// Phase 1: matrix 97 rows 61 cols
[2022-06-10 06:05:55] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 06:05:55] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-06-10 06:05:55] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
// Phase 1: matrix 97 rows 61 cols
[2022-06-10 06:05:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:05:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 06:05:55] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-06-10 06:05:55] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:05:55] [INFO ] Flow matrix only has 97 transitions (discarded 4 similar events)
// Phase 1: matrix 97 rows 61 cols
[2022-06-10 06:05:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:05:55] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/362 places, 101/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/362 places, 101/453 transitions.
[2022-06-10 06:05:55] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:05:55] [INFO ] Flatten gal took : 4 ms
[2022-06-10 06:05:55] [INFO ] Input system was already deterministic with 101 transitions.
[2022-06-10 06:05:55] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:05:55] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5278624587077557751.gal : 1 ms
[2022-06-10 06:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability715079619043295077.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5278624587077557751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability715079619043295077.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9221,0.094864,7552,2,1155,5,10087,6,0,340,12824,0


Converting to forward existential form...Done !
original formula: AG(((A((p390!=1) U ((AG(!((((p26==1)&&(p161==1))&&(p321==1)))) + (p153==1)) + (p132==1))) + EG((AG((p121==1)) + (p363==1)))) + ((EF((p398...228
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((!((E(!(((!(E(TRUE U !(!((((p26==1)&&(p161==1))&&(p321==1)))))) + (p153==1)) + (p132==1...1281
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t15, t16, t23, t25, t27, t28, t56, t58, t60, t63, t64, t65, t76, t77, t78, t83, t...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.71636,105192,1,0,634,611497,245,343,2768,487547,706
FORMULA StigmergyElection-PT-03b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 343 transition count 434
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 343 transition count 434
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 335 transition count 426
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 335 transition count 426
Applied a total of 54 rules in 18 ms. Remains 335 /362 variables (removed 27) and now considering 426/453 (removed 27) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:05:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:05:59] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:05:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:06:00] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:06:00] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:06:00] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/362 places, 426/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/362 places, 426/453 transitions.
[2022-06-10 06:06:00] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:06:00] [INFO ] Flatten gal took : 17 ms
[2022-06-10 06:06:00] [INFO ] Input system was already deterministic with 426 transitions.
[2022-06-10 06:06:00] [INFO ] Flatten gal took : 20 ms
[2022-06-10 06:06:00] [INFO ] Flatten gal took : 18 ms
[2022-06-10 06:06:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3439985167041892681.gal : 2 ms
[2022-06-10 06:06:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12844514723125311507.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3439985167041892681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12844514723125311507.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04368e+07,1.96562,53844,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: EG(((EF(((EX((p356==1)) + EX((p67==0))) + E((p361==1) U (p357==1)))) + AG((((p38==1)&&(p173==1))&&(p308==1)))) + (AG(EX((p66==1))) * EX(E...171
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((EX((p356==1)) + EX((p67==0))) + E((p361==1) U (p357==1)))) + !(E(TRUE U !((((p38==1)&&(p...244
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2022-06-10 06:06:30] [INFO ] Flatten gal took : 12 ms
[2022-06-10 06:06:30] [INFO ] Applying decomposition
[2022-06-10 06:06:30] [INFO ] Flatten gal took : 10 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/graph11677171521647299924.txt' '-o' '/tmp/graph11677171521647299924.bin' '-w' '/tmp/graph11677171521647299924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11677171521647299924.bin' '-l' '-1' '-v' '-w' '/tmp/graph11677171521647299924.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:06:30] [INFO ] Decomposing Gal with order
[2022-06-10 06:06:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:06:30] [INFO ] Removed a total of 324 redundant transitions.
[2022-06-10 06:06:30] [INFO ] Flatten gal took : 29 ms
[2022-06-10 06:06:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2022-06-10 06:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5508326073402418986.gal : 4 ms
[2022-06-10 06:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5543950650863656290.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5508326073402418986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5543950650863656290.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04368e+07,0.2231,8392,640,20,5653,421,611,6799,58,938,0


Converting to forward existential form...Done !
original formula: EG(((EF(((EX((i21.i0.u105.p356==1)) + EX((i3.u18.p67==0))) + E((i21.i1.u107.p361==1) U (i21.i0.u106.p357==1)))) + AG((((i2.i0.u11.p38==1)...265
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((EX((i21.i0.u105.p356==1)) + EX((i3.u18.p67==0))) + E((i21.i1.u107.p361==1) U (i21.i0.u10...338
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t129, t130, t132, t149, t194, t227, t228, t230, t291, t324, t325, t327, t344, t345,...386
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,1,4.37497,130624,1,0,270782,482,4805,337754,288,1122,737510
FORMULA StigmergyElection-PT-03b-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 368 edges and 362 vertex of which 54 / 362 are part of one of the 9 SCC in 2 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 222 place count 316 transition count 180
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 227 rules applied. Total rules applied 449 place count 95 transition count 174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 452 place count 92 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 452 place count 92 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 472 place count 82 transition count 164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 480 place count 74 transition count 155
Iterating global reduction 3 with 8 rules applied. Total rules applied 488 place count 74 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 490 place count 72 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 492 place count 72 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 72 transition count 144
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 519 place count 59 transition count 131
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 530 place count 48 transition count 93
Iterating global reduction 4 with 11 rules applied. Total rules applied 541 place count 48 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 546 place count 48 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 548 place count 46 transition count 84
Iterating global reduction 5 with 2 rules applied. Total rules applied 550 place count 46 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 551 place count 45 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 552 place count 45 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 44 transition count 81
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 555 place count 43 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 557 place count 43 transition count 76
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 560 place count 43 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 566 place count 40 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 40 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 568 place count 39 transition count 69
Applied a total of 568 rules in 52 ms. Remains 39 /362 variables (removed 323) and now considering 69/453 (removed 384) transitions.
[2022-06-10 06:06:35] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
// Phase 1: matrix 65 rows 39 cols
[2022-06-10 06:06:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:06:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-10 06:06:35] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
// Phase 1: matrix 65 rows 39 cols
[2022-06-10 06:06:35] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 06:06:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 06:06:35] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-06-10 06:06:35] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:06:35] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
// Phase 1: matrix 65 rows 39 cols
[2022-06-10 06:06:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:06:35] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 39/362 places, 69/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/362 places, 69/453 transitions.
[2022-06-10 06:06:35] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:35] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:35] [INFO ] Input system was already deterministic with 69 transitions.
[2022-06-10 06:06:35] [INFO ] Flatten gal took : 13 ms
[2022-06-10 06:06:35] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2123161130245510801.gal : 1 ms
[2022-06-10 06:06:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4901805491138344925.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2123161130245510801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4901805491138344925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2772,0.063921,5792,2,723,5,4036,6,0,219,4275,0


Converting to forward existential form...Done !
original formula: EG((p54==0))
=> equivalent forward existential formula: [FwdG(Init,(p54==0))] != FALSE
Hit Full ! (commute/partial/dont) 67/0/2
(forward)formula 0,1,0.275469,10016,1,0,17,23360,19,4,1249,20785,16
FORMULA StigmergyElection-PT-03b-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 366 edges and 362 vertex of which 47 / 362 are part of one of the 8 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 322 transition count 184
Reduce places removed 224 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 232 rules applied. Total rules applied 457 place count 98 transition count 176
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 462 place count 94 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 93 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 463 place count 93 transition count 165
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 483 place count 83 transition count 165
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 492 place count 74 transition count 155
Iterating global reduction 4 with 9 rules applied. Total rules applied 501 place count 74 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 503 place count 72 transition count 145
Iterating global reduction 4 with 2 rules applied. Total rules applied 505 place count 72 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 72 transition count 144
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 532 place count 59 transition count 131
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 542 place count 49 transition count 95
Iterating global reduction 5 with 10 rules applied. Total rules applied 552 place count 49 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 557 place count 49 transition count 90
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 559 place count 47 transition count 86
Iterating global reduction 6 with 2 rules applied. Total rules applied 561 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 46 transition count 84
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 46 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 565 place count 45 transition count 83
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 566 place count 44 transition count 79
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 568 place count 44 transition count 78
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 571 place count 44 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 577 place count 41 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 578 place count 40 transition count 71
Applied a total of 578 rules in 24 ms. Remains 40 /362 variables (removed 322) and now considering 71/453 (removed 382) transitions.
[2022-06-10 06:06:35] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 40 cols
[2022-06-10 06:06:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:06:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-10 06:06:35] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 40 cols
[2022-06-10 06:06:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:06:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 06:06:36] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-06-10 06:06:36] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:06:36] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 40 cols
[2022-06-10 06:06:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:06:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/362 places, 71/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/362 places, 71/453 transitions.
[2022-06-10 06:06:36] [INFO ] Flatten gal took : 3 ms
[2022-06-10 06:06:36] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:36] [INFO ] Input system was already deterministic with 71 transitions.
[2022-06-10 06:06:36] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:36] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7063183096281422886.gal : 1 ms
[2022-06-10 06:06:36] [INFO ] Time to serialize properties into /tmp/CTLFireability918589334042069408.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7063183096281422886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability918589334042069408.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2900,0.035218,5616,2,678,5,3632,6,0,225,3684,0


Converting to forward existential form...Done !
original formula: EF(AG((p337==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p337==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t9, t10, t16, t17, t31, t32, t34, t39, t40, t47, t48, t52, t53, t63, t64, t65, t66, t...257
(forward)formula 0,0,0.197,10752,1,0,146,30658,159,62,1670,20905,147
FORMULA StigmergyElection-PT-03b-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 366 edges and 362 vertex of which 47 / 362 are part of one of the 8 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 224 place count 322 transition count 185
Reduce places removed 223 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 231 rules applied. Total rules applied 455 place count 99 transition count 177
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 461 place count 95 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 463 place count 93 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 463 place count 93 transition count 165
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 483 place count 83 transition count 165
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 492 place count 74 transition count 155
Iterating global reduction 4 with 9 rules applied. Total rules applied 501 place count 74 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 503 place count 72 transition count 145
Iterating global reduction 4 with 2 rules applied. Total rules applied 505 place count 72 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 72 transition count 144
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 532 place count 59 transition count 131
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 542 place count 49 transition count 95
Iterating global reduction 5 with 10 rules applied. Total rules applied 552 place count 49 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 557 place count 49 transition count 90
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 559 place count 47 transition count 86
Iterating global reduction 6 with 2 rules applied. Total rules applied 561 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 46 transition count 84
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 46 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 565 place count 45 transition count 83
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 566 place count 44 transition count 79
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 568 place count 44 transition count 78
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 571 place count 44 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 577 place count 41 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 578 place count 40 transition count 71
Applied a total of 578 rules in 31 ms. Remains 40 /362 variables (removed 322) and now considering 71/453 (removed 382) transitions.
[2022-06-10 06:06:36] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 40 cols
[2022-06-10 06:06:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:06:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-06-10 06:06:36] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 40 cols
[2022-06-10 06:06:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:06:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 06:06:36] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-06-10 06:06:36] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:06:36] [INFO ] Flow matrix only has 67 transitions (discarded 4 similar events)
// Phase 1: matrix 67 rows 40 cols
[2022-06-10 06:06:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:06:36] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/362 places, 71/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/362 places, 71/453 transitions.
[2022-06-10 06:06:36] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:36] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:06:36] [INFO ] Input system was already deterministic with 71 transitions.
Finished random walk after 2202 steps, including 277 resets, run visited all 1 properties in 11 ms. (steps per millisecond=200 )
FORMULA StigmergyElection-PT-03b-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 345 transition count 436
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 345 transition count 436
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 337 transition count 428
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 337 transition count 428
Applied a total of 50 rules in 19 ms. Remains 337 /362 variables (removed 25) and now considering 428/453 (removed 25) transitions.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:06:36] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:06:36] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:06:36] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:06:36] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:06:36] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 06:06:37] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/362 places, 428/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/362 places, 428/453 transitions.
[2022-06-10 06:06:37] [INFO ] Flatten gal took : 15 ms
[2022-06-10 06:06:37] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:06:37] [INFO ] Input system was already deterministic with 428 transitions.
[2022-06-10 06:06:37] [INFO ] Flatten gal took : 15 ms
[2022-06-10 06:06:37] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10531899325205052722.gal : 7 ms
[2022-06-10 06:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14906991335277254578.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10531899325205052722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14906991335277254578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05644e+07,1.94618,53868,2,6749,5,164711,6,0,1778,242758,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p405==1) + AF((((p73==1)&&(p233==1))&&(p343==1))))) * EX(EX((p195==1)))) * AX((p101==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EG(!(((p405==1) + !(EG(!((((p73==1)&&(p233==1))&&(p343==1))))))))) * EX(EX((p195==1)))))...188
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2022-06-10 06:07:07] [INFO ] Flatten gal took : 18 ms
[2022-06-10 06:07:07] [INFO ] Applying decomposition
[2022-06-10 06:07:07] [INFO ] Flatten gal took : 20 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/graph1960700126131329435.txt' '-o' '/tmp/graph1960700126131329435.bin' '-w' '/tmp/graph1960700126131329435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1960700126131329435.bin' '-l' '-1' '-v' '-w' '/tmp/graph1960700126131329435.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:07:07] [INFO ] Decomposing Gal with order
[2022-06-10 06:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:07:07] [INFO ] Removed a total of 318 redundant transitions.
[2022-06-10 06:07:07] [INFO ] Flatten gal took : 36 ms
[2022-06-10 06:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2022-06-10 06:07:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14165762151366996306.gal : 6 ms
[2022-06-10 06:07:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3687674209144475908.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14165762151366996306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3687674209144475908.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05644e+07,0.320809,9820,660,28,8574,422,718,9872,56,1018,0


Converting to forward existential form...Done !
original formula: EF(((AF(((i23.u118.p405==1) + AF((((i4.i0.u22.p73==1)&&(i18.i1.u72.p233==1))&&(i20.i0.u99.p343==1))))) * EX(EX((i10.u58.p195==1)))) * AX(...177
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EG(!(((i23.u118.p405==1) + !(EG(!((((i4.i0.u22.p73==1)&&(i18.i1.u72.p233==1))&&(i20.i0.u...247
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t129, t130, t132, t149, t192, t194, t228, t230, t246, t292, t326, t328, t345, t346,...394
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,8.00328,216328,1,0,421669,474,4893,663264,270,1179,1034221
FORMULA StigmergyElection-PT-03b-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 343 transition count 434
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 343 transition count 434
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 335 transition count 426
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 335 transition count 426
Applied a total of 54 rules in 22 ms. Remains 335 /362 variables (removed 27) and now considering 426/453 (removed 27) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:07:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:07:16] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:07:16] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 06:07:16] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:07:16] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:07:16] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/362 places, 426/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/362 places, 426/453 transitions.
[2022-06-10 06:07:16] [INFO ] Flatten gal took : 15 ms
[2022-06-10 06:07:16] [INFO ] Flatten gal took : 17 ms
[2022-06-10 06:07:16] [INFO ] Input system was already deterministic with 426 transitions.
[2022-06-10 06:07:17] [INFO ] Flatten gal took : 20 ms
[2022-06-10 06:07:17] [INFO ] Flatten gal took : 17 ms
[2022-06-10 06:07:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15262054965517908098.gal : 2 ms
[2022-06-10 06:07:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3372725809440411468.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15262054965517908098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3372725809440411468.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04368e+07,2.18989,53736,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: EF(((p70==1) + EG(((EX((p118==1)) * ((p385==1)||(p256==1))) * AF((p391==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p70==1))] != FALSE + [FwdG(FwdU(Init,TRUE),((EX((p118==1)) * ((p385==1)||(p256==1))) * !(E...184
(forward)formula 0,1,2.19581,53736,1,0,7,163098,8,1,1771,240578,1
FORMULA StigmergyElection-PT-03b-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 453/453 transitions.
Graph (trivial) has 368 edges and 362 vertex of which 54 / 362 are part of one of the 9 SCC in 0 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 220 place count 316 transition count 182
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 225 rules applied. Total rules applied 445 place count 97 transition count 176
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 449 place count 94 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 93 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 450 place count 93 transition count 165
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 470 place count 83 transition count 165
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 478 place count 75 transition count 156
Iterating global reduction 4 with 8 rules applied. Total rules applied 486 place count 75 transition count 156
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 488 place count 73 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 73 transition count 146
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 516 place count 60 transition count 133
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 527 place count 49 transition count 95
Iterating global reduction 4 with 11 rules applied. Total rules applied 538 place count 49 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 543 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 546 place count 46 transition count 84
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 46 transition count 84
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 551 place count 44 transition count 80
Iterating global reduction 5 with 2 rules applied. Total rules applied 553 place count 44 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 43 transition count 79
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 556 place count 42 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 558 place count 42 transition count 75
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 561 place count 42 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 567 place count 39 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 568 place count 38 transition count 68
Applied a total of 568 rules in 23 ms. Remains 38 /362 variables (removed 324) and now considering 68/453 (removed 385) transitions.
[2022-06-10 06:07:19] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2022-06-10 06:07:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:07:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-06-10 06:07:19] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2022-06-10 06:07:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 06:07:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-06-10 06:07:19] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:07:19] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2022-06-10 06:07:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:19] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/362 places, 68/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/362 places, 68/453 transitions.
[2022-06-10 06:07:19] [INFO ] Flatten gal took : 6 ms
[2022-06-10 06:07:19] [INFO ] Flatten gal took : 2 ms
[2022-06-10 06:07:19] [INFO ] Input system was already deterministic with 68 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA StigmergyElection-PT-03b-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2022-06-10 06:07:19] [INFO ] Flatten gal took : 10 ms
[2022-06-10 06:07:19] [INFO ] Flatten gal took : 13 ms
Total runtime 282088 ms.

BK_STOP 1654841239612

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-03b"
export BK_EXAMINATION="CTLFireability"
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-03b, examination is CTLFireability"
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-165463872700274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;