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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
251.327 12424.00 27714.00 165.00 FTTFTFFTFTTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872700259.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-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K May 30 14:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 30 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 30 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 30 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:03 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 71K 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-02b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654840566374

Running Version 202205111006
[2022-06-10 05:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 05:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 05:56:08] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2022-06-10 05:56:08] [INFO ] Transformed 291 places.
[2022-06-10 05:56:08] [INFO ] Transformed 332 transitions.
[2022-06-10 05:56:08] [INFO ] Found NUPN structural information;
[2022-06-10 05:56:08] [INFO ] Parsed PT model containing 291 places and 332 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 258 transition count 299
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 258 transition count 299
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 83 place count 241 transition count 282
Iterating global reduction 0 with 17 rules applied. Total rules applied 100 place count 241 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 237 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 237 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 235 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 235 transition count 276
Applied a total of 112 rules in 101 ms. Remains 235 /291 variables (removed 56) and now considering 276/332 (removed 56) transitions.
// Phase 1: matrix 276 rows 235 cols
[2022-06-10 05:56:09] [INFO ] Computed 3 place invariants in 34 ms
[2022-06-10 05:56:09] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 276 rows 235 cols
[2022-06-10 05:56:09] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 05:56:10] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
// Phase 1: matrix 276 rows 235 cols
[2022-06-10 05:56:10] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 05:56:10] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/291 places, 276/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/291 places, 276/332 transitions.
Support contains 17 out of 235 places after structural reductions.
[2022-06-10 05:56:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 05:56:10] [INFO ] Flatten gal took : 84 ms
FORMULA StigmergyElection-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 05:56:10] [INFO ] Flatten gal took : 34 ms
[2022-06-10 05:56:10] [INFO ] Input system was already deterministic with 276 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 887 ms. (steps per millisecond=11 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 276 rows 235 cols
[2022-06-10 05:56:12] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 05:56:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-10 05:56:12] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 05:56:12] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 8 ms to minimize.
[2022-06-10 05:56:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-06-10 05:56:12] [INFO ] After 467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 05:56:12] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 05:56:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-10 05:56:13] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 05:56:13] [INFO ] Deduced a trap composed of 171 places in 123 ms of which 2 ms to minimize.
[2022-06-10 05:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-10 05:56:13] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-10 05:56:13] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 7 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 276/276 transitions.
Graph (trivial) has 238 edges and 235 vertex of which 33 / 235 are part of one of the 6 SCC in 14 ms
Free SCC test removed 27 places
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 303 edges and 208 vertex of which 206 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 206 transition count 95
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 63 transition count 91
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 297 place count 61 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 60 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 298 place count 60 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 316 place count 51 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 318 place count 49 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 49 transition count 79
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 320 place count 49 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 324 place count 47 transition count 77
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 47 transition count 76
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 347 place count 36 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 350 place count 36 transition count 62
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 358 place count 28 transition count 45
Iterating global reduction 6 with 8 rules applied. Total rules applied 366 place count 28 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 371 place count 28 transition count 40
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 27 transition count 39
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 27 transition count 39
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 379 place count 24 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 383 place count 22 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 384 place count 22 transition count 35
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 386 place count 22 transition count 33
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 397 place count 22 transition count 22
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 411 place count 11 transition count 19
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 413 place count 9 transition count 17
Iterating global reduction 9 with 2 rules applied. Total rules applied 415 place count 9 transition count 17
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 418 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 419 place count 9 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 420 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 421 place count 7 transition count 12
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 5 rules applied. Total rules applied 426 place count 4 transition count 9
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 3 edges and 4 vertex of which 2 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 4 rules applied. Total rules applied 430 place count 3 transition count 6
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 432 place count 3 transition count 4
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 13 with 2 rules applied. Total rules applied 434 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 435 place count 2 transition count 2
Applied a total of 435 rules in 101 ms. Remains 2 /235 variables (removed 233) and now considering 2/276 (removed 274) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/235 places, 2/276 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA StigmergyElection-PT-02b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 32 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U F(!p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Graph (trivial) has 235 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 204 transition count 106
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 275 place count 69 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 278 place count 67 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 279 place count 66 transition count 101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 279 place count 66 transition count 94
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 293 place count 59 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 295 place count 57 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 297 place count 57 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 297 place count 57 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 299 place count 56 transition count 91
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
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 319 place count 46 transition count 81
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 325 place count 40 transition count 69
Iterating global reduction 4 with 6 rules applied. Total rules applied 331 place count 40 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 333 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 335 place count 38 transition count 63
Iterating global reduction 5 with 2 rules applied. Total rules applied 337 place count 38 transition count 63
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 36 transition count 59
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 36 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 353 place count 30 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 354 place count 29 transition count 55
Iterating global reduction 5 with 1 rules applied. Total rules applied 355 place count 29 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 29 transition count 54
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 358 place count 29 transition count 52
Applied a total of 358 rules in 43 ms. Remains 29 /235 variables (removed 206) and now considering 52/276 (removed 224) transitions.
[2022-06-10 05:56:13] [INFO ] Flow matrix only has 50 transitions (discarded 2 similar events)
// Phase 1: matrix 50 rows 29 cols
[2022-06-10 05:56:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:56:13] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-06-10 05:56:13] [INFO ] Flow matrix only has 50 transitions (discarded 2 similar events)
// Phase 1: matrix 50 rows 29 cols
[2022-06-10 05:56:13] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 05:56:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-10 05:56:13] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-06-10 05:56:13] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:56:13] [INFO ] Flow matrix only has 50 transitions (discarded 2 similar events)
// Phase 1: matrix 50 rows 29 cols
[2022-06-10 05:56:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:56:13] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/235 places, 52/276 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/235 places, 52/276 transitions.
Stuttering acceptance computed with spot in 260 ms :[p1, p1]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s9 0) (EQ s14 1) (EQ s16 0) (EQ s5 1)) (OR (EQ s16 0) (EQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-05 finished in 607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U G((F(X(p1))&&p2)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Graph (trivial) has 233 edges and 235 vertex of which 33 / 235 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 207 transition count 112
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 137 rules applied. Total rules applied 271 place count 74 transition count 108
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 277 place count 72 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 281 place count 68 transition count 104
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 281 place count 68 transition count 97
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 295 place count 61 transition count 97
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 298 place count 58 transition count 94
Iterating global reduction 4 with 3 rules applied. Total rules applied 301 place count 58 transition count 94
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 301 place count 58 transition count 92
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 305 place count 56 transition count 92
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 321 place count 48 transition count 84
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 327 place count 42 transition count 71
Iterating global reduction 4 with 6 rules applied. Total rules applied 333 place count 42 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 336 place count 42 transition count 68
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 337 place count 41 transition count 66
Iterating global reduction 5 with 1 rules applied. Total rules applied 338 place count 41 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 339 place count 40 transition count 64
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 40 transition count 64
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 354 place count 33 transition count 64
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 355 place count 32 transition count 58
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 32 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 357 place count 32 transition count 57
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 32 transition count 54
Applied a total of 360 rules in 32 ms. Remains 32 /235 variables (removed 203) and now considering 54/276 (removed 222) transitions.
[2022-06-10 05:56:14] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
// Phase 1: matrix 50 rows 32 cols
[2022-06-10 05:56:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:56:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-06-10 05:56:14] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
// Phase 1: matrix 50 rows 32 cols
[2022-06-10 05:56:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:56:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-10 05:56:14] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-06-10 05:56:14] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:56:14] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
// Phase 1: matrix 50 rows 32 cols
[2022-06-10 05:56:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:56:14] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/235 places, 54/276 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/235 places, 54/276 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s10 0) (EQ s5 1)), p0:(EQ s26 1), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-08 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p1))||p0) U F(X(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 231 transition count 272
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 229 transition count 270
Applied a total of 12 rules in 34 ms. Remains 229 /235 variables (removed 6) and now considering 270/276 (removed 6) transitions.
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:56:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:56:14] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:56:14] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 05:56:15] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:56:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:56:15] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 270/276 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/235 places, 270/276 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s172 0) (EQ s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-02b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-10 finished in 1890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Graph (trivial) has 236 edges and 235 vertex of which 29 / 235 are part of one of the 5 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 210 transition count 110
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 145 rules applied. Total rules applied 284 place count 72 transition count 103
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 290 place count 68 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 66 transition count 101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 292 place count 66 transition count 94
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 306 place count 59 transition count 94
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 309 place count 56 transition count 91
Iterating global reduction 4 with 3 rules applied. Total rules applied 312 place count 56 transition count 91
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 312 place count 56 transition count 89
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 316 place count 54 transition count 89
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 334 place count 45 transition count 80
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 341 place count 38 transition count 66
Iterating global reduction 4 with 7 rules applied. Total rules applied 348 place count 38 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 352 place count 38 transition count 62
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 353 place count 37 transition count 60
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 37 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 355 place count 36 transition count 58
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 36 transition count 58
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 372 place count 28 transition count 57
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 373 place count 27 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 374 place count 27 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 375 place count 27 transition count 50
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 377 place count 27 transition count 48
Applied a total of 377 rules in 38 ms. Remains 27 /235 variables (removed 208) and now considering 48/276 (removed 228) transitions.
[2022-06-10 05:56:16] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2022-06-10 05:56:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:56:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 05:56:16] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2022-06-10 05:56:16] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 05:56:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-10 05:56:16] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-10 05:56:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 05:56:16] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2022-06-10 05:56:16] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 05:56:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/235 places, 48/276 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/235 places, 48/276 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8 reset in 410 ms.
Product exploration explored 100000 steps with 14 reset in 163 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 368 steps, including 66 resets, run visited all 1 properties in 8 ms. (steps per millisecond=46 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-06-10 05:56:17] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2022-06-10 05:56:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:56:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-06-10 05:56:18] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2022-06-10 05:56:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:56:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-10 05:56:18] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-06-10 05:56:18] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:56:18] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2022-06-10 05:56:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:56:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 48/48 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 34 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 25 steps with 4 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-11 finished in 2096 ms.
All properties solved by simple procedures.
Total runtime 10154 ms.

BK_STOP 1654840578798

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-02b"
export BK_EXAMINATION="LTLCardinality"
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-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872700259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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