Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530200371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyElection-PT-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530200371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 18:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 11 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717014987276

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 20:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:36:30] [INFO ] Load time of PNML (sax parser for PT used): 1583 ms
[2024-05-29 20:36:30] [INFO ] Transformed 1243 places.
[2024-05-29 20:36:30] [INFO ] Transformed 41210 transitions.
[2024-05-29 20:36:30] [INFO ] Found NUPN structural information;
[2024-05-29 20:36:30] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 1990 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA StigmergyElection-PT-09b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 150 place count 1093 transition count 41060
Iterating global reduction 0 with 150 rules applied. Total rules applied 300 place count 1093 transition count 41060
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 379 place count 1014 transition count 40981
Iterating global reduction 0 with 79 rules applied. Total rules applied 458 place count 1014 transition count 40981
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 475 place count 997 transition count 40964
Iterating global reduction 0 with 17 rules applied. Total rules applied 492 place count 997 transition count 40964
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 500 place count 989 transition count 40956
Iterating global reduction 0 with 8 rules applied. Total rules applied 508 place count 989 transition count 40956
Applied a total of 508 rules in 3294 ms. Remains 989 /1243 variables (removed 254) and now considering 40956/41210 (removed 254) transitions.
// Phase 1: matrix 40956 rows 989 cols
[2024-05-29 20:36:35] [INFO ] Computed 10 invariants in 974 ms
[2024-05-29 20:36:48] [INFO ] Implicit Places using invariants in 13914 ms returned []
Implicit Place search using SMT only with invariants took 13952 ms to find 0 implicit places.
Running 40955 sub problems to find dead transitions.
[2024-05-29 20:36:48] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/41945 variables, and 0 constraints, problems are : Problem set: 0 solved, 40955 unsolved in 30621 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 40955/1535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40955 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/41945 variables, and 0 constraints, problems are : Problem set: 0 solved, 40955 unsolved in 30415 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 39420/1535 constraints, Known Traps: 0/0 constraints]
After SMT, in 732884ms problems are : Problem set: 0 solved, 40955 unsolved
Search for dead transitions found 0 dead transitions in 733302ms
Starting structural reductions in LTL mode, iteration 1 : 989/1243 places, 40956/41210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750812 ms. Remains : 989/1243 places, 40956/41210 transitions.
Support contains 31 out of 989 places after structural reductions.
[2024-05-29 20:49:06] [INFO ] Flatten gal took : 4043 ms
[2024-05-29 20:49:10] [INFO ] Flatten gal took : 3706 ms
[2024-05-29 20:49:18] [INFO ] Input system was already deterministic with 40956 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (258 resets) in 2659 ms. (15 steps per ms) remains 8/17 properties
BEST_FIRST walk for 40004 steps (29 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (31 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (46 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
[2024-05-29 20:49:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 747/763 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/763 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 226/989 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 5368ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 40956/40956 transitions.
Graph (trivial) has 985 edges and 989 vertex of which 136 / 989 are part of one of the 24 SCC in 19 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Graph (complete) has 2687 edges and 877 vertex of which 869 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.134 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 603 rules applied. Total rules applied 605 place count 869 transition count 40204
Reduce places removed 596 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 615 rules applied. Total rules applied 1220 place count 273 transition count 40185
Reduce places removed 10 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 16 rules applied. Total rules applied 1236 place count 263 transition count 40179
Reduce places removed 6 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 8 rules applied. Total rules applied 1244 place count 257 transition count 40177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1245 place count 256 transition count 40177
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 44 Pre rules applied. Total rules applied 1245 place count 256 transition count 40133
Deduced a syphon composed of 44 places in 18 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 1333 place count 212 transition count 40133
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 23 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1423 place count 167 transition count 40087
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1435 place count 167 transition count 40075
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 1464 place count 138 transition count 1705
Iterating global reduction 6 with 29 rules applied. Total rules applied 1493 place count 138 transition count 1705
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1511 place count 138 transition count 1687
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1513 place count 136 transition count 1685
Iterating global reduction 7 with 2 rules applied. Total rules applied 1515 place count 136 transition count 1685
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 7 with 28 rules applied. Total rules applied 1543 place count 122 transition count 1671
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1561 place count 113 transition count 1687
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1564 place count 113 transition count 1684
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1574 place count 113 transition count 1674
Free-agglomeration rule applied 46 times.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1620 place count 113 transition count 1628
Reduce places removed 46 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 47 rules applied. Total rules applied 1667 place count 67 transition count 1627
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1675 place count 59 transition count 1619
Iterating global reduction 9 with 8 rules applied. Total rules applied 1683 place count 59 transition count 1619
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1698 place count 59 transition count 1604
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 1714 place count 59 transition count 1588
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1716 place count 59 transition count 1588
Applied a total of 1716 rules in 11741 ms. Remains 59 /989 variables (removed 930) and now considering 1588/40956 (removed 39368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11742 ms. Remains : 59/989 places, 1588/40956 transitions.
RANDOM walk for 21922 steps (130 resets) in 1001 ms. (21 steps per ms) remains 0/8 properties
Computed a total of 135 stabilizing places and 144 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 40956/40956 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 981 transition count 40948
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 981 transition count 40948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 977 transition count 40944
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 977 transition count 40944
Applied a total of 24 rules in 1049 ms. Remains 977 /989 variables (removed 12) and now considering 40944/40956 (removed 12) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2024-05-29 20:49:39] [INFO ] Computed 10 invariants in 617 ms
[2024-05-29 20:49:53] [INFO ] Implicit Places using invariants in 13703 ms returned []
Implicit Place search using SMT only with invariants took 13708 ms to find 0 implicit places.
Running 40943 sub problems to find dead transitions.
[2024-05-29 20:49:53] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30532 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 40943/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30446 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 39420/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 884803ms problems are : Problem set: 0 solved, 40943 unsolved
Search for dead transitions found 0 dead transitions in 885199ms
Starting structural reductions in LTL mode, iteration 1 : 977/989 places, 40944/40956 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 900076 ms. Remains : 977/989 places, 40944/40956 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 419 steps with 2 reset in 27 ms.
FORMULA StigmergyElection-PT-09b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLCardinality-00 finished in 900589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1||G(p0)))))'
Support contains 3 out of 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 40956/40956 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 981 transition count 40948
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 981 transition count 40948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 977 transition count 40944
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 977 transition count 40944
Applied a total of 24 rules in 1212 ms. Remains 977 /989 variables (removed 12) and now considering 40944/40956 (removed 12) transitions.
[2024-05-29 21:04:40] [INFO ] Invariant cache hit.
[2024-05-29 21:04:53] [INFO ] Implicit Places using invariants in 13813 ms returned []
Implicit Place search using SMT only with invariants took 13818 ms to find 0 implicit places.
Running 40943 sub problems to find dead transitions.
[2024-05-29 21:04:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30479 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 40943/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30456 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 39420/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 802901ms problems are : Problem set: 0 solved, 40943 unsolved
Search for dead transitions found 0 dead transitions in 803350ms
Starting structural reductions in LTL mode, iteration 1 : 977/989 places, 40944/40956 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 818484 ms. Remains : 977/989 places, 40944/40956 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLCardinality-02
Product exploration explored 100000 steps with 647 reset in 2103 ms.
Product exploration explored 100000 steps with 647 reset in 2062 ms.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Detected a total of 135/977 stabilizing places and 144/40944 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (257 resets) in 1180 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (30 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2062 steps, run visited all 1 properties in 131 ms. (steps per millisecond=15 )
Probabilistic random walk after 2062 steps, saw 1857 distinct states, run finished after 134 ms. (steps per millisecond=15 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-09b-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-09b-LTLCardinality-02 finished in 824799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 989/989 places, 40956/40956 transitions.
Graph (trivial) has 1013 edges and 989 vertex of which 159 / 989 are part of one of the 27 SCC in 3 ms
Free SCC test removed 132 places
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 590 transitions
Trivial Post-agglo rules discarded 590 transitions
Performed 590 trivial Post agglomeration. Transition count delta: 590
Iterating post reduction 0 with 590 rules applied. Total rules applied 591 place count 856 transition count 40215
Reduce places removed 590 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 608 rules applied. Total rules applied 1199 place count 266 transition count 40197
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 1209 place count 257 transition count 40196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1210 place count 256 transition count 40196
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1210 place count 256 transition count 40160
Deduced a syphon composed of 36 places in 16 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1282 place count 220 transition count 40160
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1291 place count 211 transition count 40150
Iterating global reduction 4 with 9 rules applied. Total rules applied 1300 place count 211 transition count 40150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1301 place count 210 transition count 40148
Iterating global reduction 4 with 1 rules applied. Total rules applied 1302 place count 210 transition count 40148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1303 place count 209 transition count 40146
Iterating global reduction 4 with 1 rules applied. Total rules applied 1304 place count 209 transition count 40146
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 14 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1390 place count 166 transition count 40103
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1425 place count 131 transition count 1736
Iterating global reduction 4 with 35 rules applied. Total rules applied 1460 place count 131 transition count 1736
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1477 place count 131 transition count 1719
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1485 place count 123 transition count 1703
Iterating global reduction 5 with 8 rules applied. Total rules applied 1493 place count 123 transition count 1703
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1501 place count 115 transition count 1687
Iterating global reduction 5 with 8 rules applied. Total rules applied 1509 place count 115 transition count 1687
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
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 1535 place count 102 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1536 place count 101 transition count 1676
Iterating global reduction 5 with 1 rules applied. Total rules applied 1537 place count 101 transition count 1676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1538 place count 101 transition count 1675
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1547 place count 101 transition count 1666
Applied a total of 1547 rules in 10786 ms. Remains 101 /989 variables (removed 888) and now considering 1666/40956 (removed 39290) transitions.
[2024-05-29 21:18:34] [INFO ] Flow matrix only has 1656 transitions (discarded 10 similar events)
// Phase 1: matrix 1656 rows 101 cols
[2024-05-29 21:18:34] [INFO ] Computed 2 invariants in 25 ms
[2024-05-29 21:18:34] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-29 21:18:34] [INFO ] Flow matrix only has 1656 transitions (discarded 10 similar events)
[2024-05-29 21:18:34] [INFO ] Invariant cache hit.
[2024-05-29 21:18:35] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 21:18:37] [INFO ] Implicit Places using invariants and state equation in 2608 ms returned []
Implicit Place search using SMT with State Equation took 3197 ms to find 0 implicit places.
[2024-05-29 21:18:37] [INFO ] Redundant transitions in 118 ms returned []
Running 1649 sub problems to find dead transitions.
[2024-05-29 21:18:37] [INFO ] Flow matrix only has 1656 transitions (discarded 10 similar events)
[2024-05-29 21:18:37] [INFO ] Invariant cache hit.
[2024-05-29 21:18:38] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
[2024-05-29 21:19:10] [INFO ] Deduced a trap composed of 18 places in 639 ms of which 10 ms to minimize.
[2024-05-29 21:19:11] [INFO ] Deduced a trap composed of 13 places in 648 ms of which 1 ms to minimize.
[2024-05-29 21:19:12] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 1 ms to minimize.
[2024-05-29 21:19:12] [INFO ] Deduced a trap composed of 18 places in 530 ms of which 1 ms to minimize.
[2024-05-29 21:19:13] [INFO ] Deduced a trap composed of 12 places in 569 ms of which 1 ms to minimize.
[2024-05-29 21:19:13] [INFO ] Deduced a trap composed of 12 places in 588 ms of which 1 ms to minimize.
[2024-05-29 21:19:14] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 5 ms to minimize.
[2024-05-29 21:19:14] [INFO ] Deduced a trap composed of 14 places in 528 ms of which 1 ms to minimize.
[2024-05-29 21:19:15] [INFO ] Deduced a trap composed of 21 places in 561 ms of which 1 ms to minimize.
[2024-05-29 21:19:15] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 1 ms to minimize.
[2024-05-29 21:19:16] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 1 ms to minimize.
[2024-05-29 21:19:16] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 1 ms to minimize.
[2024-05-29 21:19:17] [INFO ] Deduced a trap composed of 21 places in 689 ms of which 1 ms to minimize.
[2024-05-29 21:19:18] [INFO ] Deduced a trap composed of 19 places in 619 ms of which 2 ms to minimize.
[2024-05-29 21:19:18] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2024-05-29 21:19:19] [INFO ] Deduced a trap composed of 19 places in 594 ms of which 1 ms to minimize.
[2024-05-29 21:19:19] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 7 ms to minimize.
[2024-05-29 21:19:20] [INFO ] Deduced a trap composed of 19 places in 570 ms of which 1 ms to minimize.
[2024-05-29 21:19:21] [INFO ] Deduced a trap composed of 19 places in 584 ms of which 1 ms to minimize.
[2024-05-29 21:19:21] [INFO ] Deduced a trap composed of 19 places in 540 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
[2024-05-29 21:19:26] [INFO ] Deduced a trap composed of 13 places in 581 ms of which 1 ms to minimize.
[2024-05-29 21:19:27] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 21:19:27] [INFO ] Deduced a trap composed of 27 places in 584 ms of which 1 ms to minimize.
[2024-05-29 21:19:28] [INFO ] Deduced a trap composed of 12 places in 505 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/1757 variables, and 26 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1649/1138 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
[2024-05-29 21:19:38] [INFO ] Deduced a trap composed of 19 places in 683 ms of which 1 ms to minimize.
[2024-05-29 21:19:39] [INFO ] Deduced a trap composed of 19 places in 648 ms of which 1 ms to minimize.
[2024-05-29 21:19:39] [INFO ] Deduced a trap composed of 26 places in 634 ms of which 1 ms to minimize.
[2024-05-29 21:19:40] [INFO ] Deduced a trap composed of 24 places in 600 ms of which 2 ms to minimize.
[2024-05-29 21:19:40] [INFO ] Deduced a trap composed of 19 places in 571 ms of which 1 ms to minimize.
[2024-05-29 21:19:41] [INFO ] Deduced a trap composed of 19 places in 606 ms of which 1 ms to minimize.
[2024-05-29 21:19:42] [INFO ] Deduced a trap composed of 19 places in 576 ms of which 1 ms to minimize.
[2024-05-29 21:19:42] [INFO ] Deduced a trap composed of 19 places in 553 ms of which 1 ms to minimize.
[2024-05-29 21:19:43] [INFO ] Deduced a trap composed of 19 places in 536 ms of which 0 ms to minimize.
[2024-05-29 21:19:43] [INFO ] Deduced a trap composed of 19 places in 527 ms of which 1 ms to minimize.
[2024-05-29 21:19:44] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 1 ms to minimize.
[2024-05-29 21:19:44] [INFO ] Deduced a trap composed of 19 places in 521 ms of which 1 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 13 places in 463 ms of which 0 ms to minimize.
[2024-05-29 21:19:51] [INFO ] Deduced a trap composed of 20 places in 479 ms of which 0 ms to minimize.
[2024-05-29 21:19:51] [INFO ] Deduced a trap composed of 18 places in 581 ms of which 1 ms to minimize.
[2024-05-29 21:19:52] [INFO ] Deduced a trap composed of 21 places in 560 ms of which 2 ms to minimize.
[2024-05-29 21:19:53] [INFO ] Deduced a trap composed of 18 places in 567 ms of which 1 ms to minimize.
[2024-05-29 21:19:53] [INFO ] Deduced a trap composed of 18 places in 562 ms of which 1 ms to minimize.
[2024-05-29 21:19:54] [INFO ] Deduced a trap composed of 20 places in 567 ms of which 1 ms to minimize.
[2024-05-29 21:19:54] [INFO ] Deduced a trap composed of 20 places in 483 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1649 unsolved
[2024-05-29 21:19:55] [INFO ] Deduced a trap composed of 20 places in 697 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 101/1757 variables, and 47 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1138 constraints, Known Traps: 45/45 constraints]
After SMT, in 84506ms problems are : Problem set: 0 solved, 1649 unsolved
Search for dead transitions found 0 dead transitions in 84521ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/989 places, 1666/40956 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98640 ms. Remains : 101/989 places, 1666/40956 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLCardinality-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-09b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLCardinality-04 finished in 98766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 989/989 places, 40956/40956 transitions.
Graph (trivial) has 1007 edges and 989 vertex of which 157 / 989 are part of one of the 27 SCC in 2 ms
Free SCC test removed 130 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 587 place count 858 transition count 40222
Reduce places removed 586 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 604 rules applied. Total rules applied 1191 place count 272 transition count 40204
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 1202 place count 263 transition count 40202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1204 place count 261 transition count 40202
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1204 place count 261 transition count 40166
Deduced a syphon composed of 36 places in 20 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1276 place count 225 transition count 40166
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1285 place count 216 transition count 40156
Iterating global reduction 4 with 9 rules applied. Total rules applied 1294 place count 216 transition count 40156
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1295 place count 215 transition count 40154
Iterating global reduction 4 with 1 rules applied. Total rules applied 1296 place count 215 transition count 40154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1297 place count 214 transition count 40152
Iterating global reduction 4 with 1 rules applied. Total rules applied 1298 place count 214 transition count 40152
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 14 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1386 place count 170 transition count 40108
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1419 place count 137 transition count 1745
Iterating global reduction 4 with 33 rules applied. Total rules applied 1452 place count 137 transition count 1745
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1469 place count 137 transition count 1728
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1475 place count 131 transition count 1716
Iterating global reduction 5 with 6 rules applied. Total rules applied 1481 place count 131 transition count 1716
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1487 place count 125 transition count 1704
Iterating global reduction 5 with 6 rules applied. Total rules applied 1493 place count 125 transition count 1704
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1523 place count 110 transition count 1711
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 109 transition count 1689
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 109 transition count 1689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1526 place count 109 transition count 1688
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1536 place count 109 transition count 1678
Applied a total of 1536 rules in 12595 ms. Remains 109 /989 variables (removed 880) and now considering 1678/40956 (removed 39278) transitions.
[2024-05-29 21:20:14] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
// Phase 1: matrix 1666 rows 109 cols
[2024-05-29 21:20:14] [INFO ] Computed 2 invariants in 20 ms
[2024-05-29 21:20:15] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-29 21:20:15] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:20:15] [INFO ] Invariant cache hit.
[2024-05-29 21:20:16] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 21:20:18] [INFO ] Implicit Places using invariants and state equation in 2620 ms returned []
Implicit Place search using SMT with State Equation took 3190 ms to find 0 implicit places.
[2024-05-29 21:20:18] [INFO ] Redundant transitions in 82 ms returned []
Running 1661 sub problems to find dead transitions.
[2024-05-29 21:20:18] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:20:18] [INFO ] Invariant cache hit.
[2024-05-29 21:20:18] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:20:51] [INFO ] Deduced a trap composed of 19 places in 631 ms of which 1 ms to minimize.
[2024-05-29 21:20:52] [INFO ] Deduced a trap composed of 19 places in 594 ms of which 1 ms to minimize.
[2024-05-29 21:20:53] [INFO ] Deduced a trap composed of 14 places in 643 ms of which 1 ms to minimize.
[2024-05-29 21:20:53] [INFO ] Deduced a trap composed of 18 places in 704 ms of which 1 ms to minimize.
[2024-05-29 21:20:54] [INFO ] Deduced a trap composed of 20 places in 647 ms of which 1 ms to minimize.
[2024-05-29 21:20:55] [INFO ] Deduced a trap composed of 15 places in 567 ms of which 2 ms to minimize.
[2024-05-29 21:20:55] [INFO ] Deduced a trap composed of 16 places in 551 ms of which 1 ms to minimize.
[2024-05-29 21:20:56] [INFO ] Deduced a trap composed of 15 places in 513 ms of which 1 ms to minimize.
[2024-05-29 21:20:56] [INFO ] Deduced a trap composed of 20 places in 487 ms of which 1 ms to minimize.
[2024-05-29 21:20:57] [INFO ] Deduced a trap composed of 12 places in 472 ms of which 1 ms to minimize.
[2024-05-29 21:20:57] [INFO ] Deduced a trap composed of 19 places in 569 ms of which 1 ms to minimize.
[2024-05-29 21:20:58] [INFO ] Deduced a trap composed of 13 places in 576 ms of which 1 ms to minimize.
[2024-05-29 21:20:58] [INFO ] Deduced a trap composed of 21 places in 577 ms of which 1 ms to minimize.
[2024-05-29 21:20:59] [INFO ] Deduced a trap composed of 17 places in 549 ms of which 1 ms to minimize.
[2024-05-29 21:20:59] [INFO ] Deduced a trap composed of 15 places in 463 ms of which 1 ms to minimize.
[2024-05-29 21:21:00] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 1 ms to minimize.
[2024-05-29 21:21:00] [INFO ] Deduced a trap composed of 20 places in 474 ms of which 1 ms to minimize.
[2024-05-29 21:21:01] [INFO ] Deduced a trap composed of 22 places in 520 ms of which 0 ms to minimize.
[2024-05-29 21:21:01] [INFO ] Deduced a trap composed of 25 places in 543 ms of which 1 ms to minimize.
[2024-05-29 21:21:02] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:21:07] [INFO ] Deduced a trap composed of 18 places in 548 ms of which 1 ms to minimize.
[2024-05-29 21:21:07] [INFO ] Deduced a trap composed of 12 places in 551 ms of which 1 ms to minimize.
[2024-05-29 21:21:08] [INFO ] Deduced a trap composed of 13 places in 576 ms of which 0 ms to minimize.
[2024-05-29 21:21:09] [INFO ] Deduced a trap composed of 19 places in 565 ms of which 3 ms to minimize.
[2024-05-29 21:21:09] [INFO ] Deduced a trap composed of 20 places in 543 ms of which 1 ms to minimize.
[2024-05-29 21:21:10] [INFO ] Deduced a trap composed of 18 places in 513 ms of which 1 ms to minimize.
[2024-05-29 21:21:10] [INFO ] Deduced a trap composed of 18 places in 521 ms of which 0 ms to minimize.
[2024-05-29 21:21:11] [INFO ] Deduced a trap composed of 18 places in 509 ms of which 1 ms to minimize.
[2024-05-29 21:21:11] [INFO ] Deduced a trap composed of 18 places in 532 ms of which 1 ms to minimize.
[2024-05-29 21:21:12] [INFO ] Deduced a trap composed of 20 places in 528 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 109/1775 variables, and 32 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/109 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1661/1150 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:21:18] [INFO ] Deduced a trap composed of 19 places in 652 ms of which 1 ms to minimize.
[2024-05-29 21:21:19] [INFO ] Deduced a trap composed of 23 places in 591 ms of which 1 ms to minimize.
[2024-05-29 21:21:19] [INFO ] Deduced a trap composed of 19 places in 551 ms of which 1 ms to minimize.
[2024-05-29 21:21:20] [INFO ] Deduced a trap composed of 19 places in 555 ms of which 1 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 20 places in 446 ms of which 1 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 1 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 28 places in 600 ms of which 1 ms to minimize.
[2024-05-29 21:21:29] [INFO ] Deduced a trap composed of 19 places in 475 ms of which 0 ms to minimize.
[2024-05-29 21:21:30] [INFO ] Deduced a trap composed of 19 places in 506 ms of which 1 ms to minimize.
[2024-05-29 21:21:30] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 0 ms to minimize.
[2024-05-29 21:21:31] [INFO ] Deduced a trap composed of 22 places in 470 ms of which 1 ms to minimize.
[2024-05-29 21:21:37] [INFO ] Deduced a trap composed of 19 places in 512 ms of which 1 ms to minimize.
[2024-05-29 21:21:38] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 0 ms to minimize.
[2024-05-29 21:21:39] [INFO ] Deduced a trap composed of 22 places in 627 ms of which 1 ms to minimize.
[2024-05-29 21:21:39] [INFO ] Deduced a trap composed of 25 places in 583 ms of which 1 ms to minimize.
[2024-05-29 21:21:40] [INFO ] Deduced a trap composed of 29 places in 545 ms of which 1 ms to minimize.
[2024-05-29 21:21:40] [INFO ] Deduced a trap composed of 23 places in 549 ms of which 1 ms to minimize.
[2024-05-29 21:21:41] [INFO ] Deduced a trap composed of 19 places in 532 ms of which 1 ms to minimize.
[2024-05-29 21:21:42] [INFO ] Deduced a trap composed of 26 places in 526 ms of which 1 ms to minimize.
[2024-05-29 21:21:42] [INFO ] Deduced a trap composed of 29 places in 515 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 109/1775 variables, and 52 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/109 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1150 constraints, Known Traps: 50/50 constraints]
After SMT, in 84695ms problems are : Problem set: 0 solved, 1661 unsolved
Search for dead transitions found 0 dead transitions in 84710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/989 places, 1678/40956 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100584 ms. Remains : 109/989 places, 1678/40956 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLCardinality-06
Product exploration explored 100000 steps with 5899 reset in 624 ms.
Product exploration explored 100000 steps with 5897 reset in 659 ms.
Computed a total of 7 stabilizing places and 27 stable transitions
Computed a total of 7 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 643 steps (35 resets) in 58 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 1678/1678 transitions.
Applied a total of 0 rules in 137 ms. Remains 109 /109 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2024-05-29 21:21:45] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:21:45] [INFO ] Invariant cache hit.
[2024-05-29 21:21:45] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-29 21:21:45] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:21:45] [INFO ] Invariant cache hit.
[2024-05-29 21:21:46] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 21:21:48] [INFO ] Implicit Places using invariants and state equation in 2512 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
[2024-05-29 21:21:48] [INFO ] Redundant transitions in 40 ms returned []
Running 1661 sub problems to find dead transitions.
[2024-05-29 21:21:48] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:21:48] [INFO ] Invariant cache hit.
[2024-05-29 21:21:48] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:22:20] [INFO ] Deduced a trap composed of 19 places in 647 ms of which 2 ms to minimize.
[2024-05-29 21:22:21] [INFO ] Deduced a trap composed of 19 places in 614 ms of which 1 ms to minimize.
[2024-05-29 21:22:21] [INFO ] Deduced a trap composed of 14 places in 606 ms of which 1 ms to minimize.
[2024-05-29 21:22:22] [INFO ] Deduced a trap composed of 18 places in 627 ms of which 1 ms to minimize.
[2024-05-29 21:22:22] [INFO ] Deduced a trap composed of 20 places in 584 ms of which 1 ms to minimize.
[2024-05-29 21:22:23] [INFO ] Deduced a trap composed of 15 places in 615 ms of which 0 ms to minimize.
[2024-05-29 21:22:24] [INFO ] Deduced a trap composed of 16 places in 562 ms of which 1 ms to minimize.
[2024-05-29 21:22:24] [INFO ] Deduced a trap composed of 15 places in 524 ms of which 0 ms to minimize.
[2024-05-29 21:22:25] [INFO ] Deduced a trap composed of 20 places in 515 ms of which 1 ms to minimize.
[2024-05-29 21:22:25] [INFO ] Deduced a trap composed of 12 places in 462 ms of which 0 ms to minimize.
[2024-05-29 21:22:26] [INFO ] Deduced a trap composed of 19 places in 505 ms of which 0 ms to minimize.
[2024-05-29 21:22:26] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2024-05-29 21:22:27] [INFO ] Deduced a trap composed of 21 places in 532 ms of which 1 ms to minimize.
[2024-05-29 21:22:27] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 1 ms to minimize.
[2024-05-29 21:22:28] [INFO ] Deduced a trap composed of 15 places in 470 ms of which 1 ms to minimize.
[2024-05-29 21:22:28] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 1 ms to minimize.
[2024-05-29 21:22:29] [INFO ] Deduced a trap composed of 20 places in 482 ms of which 1 ms to minimize.
[2024-05-29 21:22:29] [INFO ] Deduced a trap composed of 22 places in 519 ms of which 1 ms to minimize.
[2024-05-29 21:22:30] [INFO ] Deduced a trap composed of 25 places in 492 ms of which 1 ms to minimize.
[2024-05-29 21:22:30] [INFO ] Deduced a trap composed of 19 places in 543 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:22:35] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 1 ms to minimize.
[2024-05-29 21:22:36] [INFO ] Deduced a trap composed of 12 places in 525 ms of which 1 ms to minimize.
[2024-05-29 21:22:36] [INFO ] Deduced a trap composed of 13 places in 571 ms of which 1 ms to minimize.
[2024-05-29 21:22:37] [INFO ] Deduced a trap composed of 19 places in 573 ms of which 1 ms to minimize.
[2024-05-29 21:22:37] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 1 ms to minimize.
[2024-05-29 21:22:38] [INFO ] Deduced a trap composed of 18 places in 524 ms of which 0 ms to minimize.
[2024-05-29 21:22:38] [INFO ] Deduced a trap composed of 18 places in 513 ms of which 1 ms to minimize.
[2024-05-29 21:22:39] [INFO ] Deduced a trap composed of 18 places in 503 ms of which 1 ms to minimize.
[2024-05-29 21:22:39] [INFO ] Deduced a trap composed of 18 places in 504 ms of which 0 ms to minimize.
[2024-05-29 21:22:40] [INFO ] Deduced a trap composed of 20 places in 527 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 109/1775 variables, and 32 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/109 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1661/1150 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:22:47] [INFO ] Deduced a trap composed of 19 places in 657 ms of which 1 ms to minimize.
[2024-05-29 21:22:48] [INFO ] Deduced a trap composed of 23 places in 666 ms of which 1 ms to minimize.
[2024-05-29 21:22:48] [INFO ] Deduced a trap composed of 19 places in 616 ms of which 1 ms to minimize.
[2024-05-29 21:22:49] [INFO ] Deduced a trap composed of 19 places in 632 ms of which 1 ms to minimize.
[2024-05-29 21:22:53] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 0 ms to minimize.
[2024-05-29 21:22:54] [INFO ] Deduced a trap composed of 14 places in 385 ms of which 0 ms to minimize.
[2024-05-29 21:22:54] [INFO ] Deduced a trap composed of 28 places in 563 ms of which 1 ms to minimize.
[2024-05-29 21:22:57] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 1 ms to minimize.
[2024-05-29 21:22:58] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 0 ms to minimize.
[2024-05-29 21:22:58] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 1 ms to minimize.
[2024-05-29 21:22:59] [INFO ] Deduced a trap composed of 22 places in 492 ms of which 1 ms to minimize.
[2024-05-29 21:23:04] [INFO ] Deduced a trap composed of 19 places in 442 ms of which 1 ms to minimize.
[2024-05-29 21:23:05] [INFO ] Deduced a trap composed of 25 places in 498 ms of which 1 ms to minimize.
[2024-05-29 21:23:06] [INFO ] Deduced a trap composed of 22 places in 644 ms of which 1 ms to minimize.
[2024-05-29 21:23:06] [INFO ] Deduced a trap composed of 25 places in 596 ms of which 1 ms to minimize.
[2024-05-29 21:23:07] [INFO ] Deduced a trap composed of 29 places in 561 ms of which 1 ms to minimize.
[2024-05-29 21:23:07] [INFO ] Deduced a trap composed of 23 places in 555 ms of which 1 ms to minimize.
[2024-05-29 21:23:08] [INFO ] Deduced a trap composed of 19 places in 535 ms of which 2 ms to minimize.
[2024-05-29 21:23:08] [INFO ] Deduced a trap composed of 26 places in 505 ms of which 1 ms to minimize.
[2024-05-29 21:23:09] [INFO ] Deduced a trap composed of 29 places in 493 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 109/1775 variables, and 52 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/109 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1150 constraints, Known Traps: 50/50 constraints]
After SMT, in 83011ms problems are : Problem set: 0 solved, 1661 unsolved
Search for dead transitions found 0 dead transitions in 83031ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86294 ms. Remains : 109/109 places, 1678/1678 transitions.
Computed a total of 7 stabilizing places and 27 stable transitions
Computed a total of 7 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 226 steps (10 resets) in 7 ms. (28 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5915 reset in 704 ms.
Product exploration explored 100000 steps with 5916 reset in 740 ms.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 1678/1678 transitions.
Applied a total of 0 rules in 160 ms. Remains 109 /109 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2024-05-29 21:23:13] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:23:13] [INFO ] Invariant cache hit.
[2024-05-29 21:23:14] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-29 21:23:14] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:23:14] [INFO ] Invariant cache hit.
[2024-05-29 21:23:14] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 21:23:17] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 3137 ms to find 0 implicit places.
[2024-05-29 21:23:17] [INFO ] Redundant transitions in 40 ms returned []
Running 1661 sub problems to find dead transitions.
[2024-05-29 21:23:17] [INFO ] Flow matrix only has 1666 transitions (discarded 12 similar events)
[2024-05-29 21:23:17] [INFO ] Invariant cache hit.
[2024-05-29 21:23:17] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:23:50] [INFO ] Deduced a trap composed of 19 places in 623 ms of which 1 ms to minimize.
[2024-05-29 21:23:51] [INFO ] Deduced a trap composed of 19 places in 599 ms of which 0 ms to minimize.
[2024-05-29 21:23:51] [INFO ] Deduced a trap composed of 14 places in 608 ms of which 1 ms to minimize.
[2024-05-29 21:23:52] [INFO ] Deduced a trap composed of 18 places in 649 ms of which 1 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 20 places in 571 ms of which 1 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 15 places in 544 ms of which 1 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 16 places in 531 ms of which 1 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 15 places in 585 ms of which 1 ms to minimize.
[2024-05-29 21:23:55] [INFO ] Deduced a trap composed of 20 places in 490 ms of which 1 ms to minimize.
[2024-05-29 21:23:55] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 1 ms to minimize.
[2024-05-29 21:23:56] [INFO ] Deduced a trap composed of 19 places in 513 ms of which 1 ms to minimize.
[2024-05-29 21:23:56] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 1 ms to minimize.
[2024-05-29 21:23:57] [INFO ] Deduced a trap composed of 21 places in 566 ms of which 1 ms to minimize.
[2024-05-29 21:23:57] [INFO ] Deduced a trap composed of 17 places in 565 ms of which 1 ms to minimize.
[2024-05-29 21:23:58] [INFO ] Deduced a trap composed of 15 places in 563 ms of which 1 ms to minimize.
[2024-05-29 21:23:58] [INFO ] Deduced a trap composed of 12 places in 488 ms of which 1 ms to minimize.
[2024-05-29 21:23:59] [INFO ] Deduced a trap composed of 20 places in 553 ms of which 0 ms to minimize.
[2024-05-29 21:24:00] [INFO ] Deduced a trap composed of 22 places in 636 ms of which 0 ms to minimize.
[2024-05-29 21:24:00] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 1 ms to minimize.
[2024-05-29 21:24:01] [INFO ] Deduced a trap composed of 19 places in 571 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:24:06] [INFO ] Deduced a trap composed of 18 places in 599 ms of which 1 ms to minimize.
[2024-05-29 21:24:06] [INFO ] Deduced a trap composed of 12 places in 618 ms of which 1 ms to minimize.
[2024-05-29 21:24:07] [INFO ] Deduced a trap composed of 13 places in 638 ms of which 1 ms to minimize.
[2024-05-29 21:24:08] [INFO ] Deduced a trap composed of 19 places in 625 ms of which 1 ms to minimize.
[2024-05-29 21:24:08] [INFO ] Deduced a trap composed of 20 places in 585 ms of which 1 ms to minimize.
[2024-05-29 21:24:09] [INFO ] Deduced a trap composed of 18 places in 579 ms of which 0 ms to minimize.
[2024-05-29 21:24:09] [INFO ] Deduced a trap composed of 18 places in 576 ms of which 1 ms to minimize.
[2024-05-29 21:24:10] [INFO ] Deduced a trap composed of 18 places in 536 ms of which 0 ms to minimize.
[2024-05-29 21:24:10] [INFO ] Deduced a trap composed of 18 places in 481 ms of which 1 ms to minimize.
[2024-05-29 21:24:11] [INFO ] Deduced a trap composed of 20 places in 579 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 109/1775 variables, and 32 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/109 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1661/1150 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-29 21:24:17] [INFO ] Deduced a trap composed of 19 places in 639 ms of which 1 ms to minimize.
[2024-05-29 21:24:18] [INFO ] Deduced a trap composed of 23 places in 600 ms of which 1 ms to minimize.
[2024-05-29 21:24:18] [INFO ] Deduced a trap composed of 19 places in 564 ms of which 1 ms to minimize.
[2024-05-29 21:24:19] [INFO ] Deduced a trap composed of 19 places in 554 ms of which 0 ms to minimize.
[2024-05-29 21:24:23] [INFO ] Deduced a trap composed of 20 places in 499 ms of which 1 ms to minimize.
[2024-05-29 21:24:24] [INFO ] Deduced a trap composed of 14 places in 474 ms of which 1 ms to minimize.
[2024-05-29 21:24:24] [INFO ] Deduced a trap composed of 28 places in 653 ms of which 1 ms to minimize.
[2024-05-29 21:24:29] [INFO ] Deduced a trap composed of 19 places in 508 ms of which 1 ms to minimize.
[2024-05-29 21:24:29] [INFO ] Deduced a trap composed of 19 places in 551 ms of which 0 ms to minimize.
[2024-05-29 21:24:30] [INFO ] Deduced a trap composed of 19 places in 522 ms of which 0 ms to minimize.
[2024-05-29 21:24:30] [INFO ] Deduced a trap composed of 22 places in 518 ms of which 0 ms to minimize.
[2024-05-29 21:24:36] [INFO ] Deduced a trap composed of 19 places in 499 ms of which 0 ms to minimize.
[2024-05-29 21:24:37] [INFO ] Deduced a trap composed of 25 places in 542 ms of which 1 ms to minimize.
[2024-05-29 21:24:38] [INFO ] Deduced a trap composed of 22 places in 632 ms of which 1 ms to minimize.
[2024-05-29 21:24:38] [INFO ] Deduced a trap composed of 25 places in 613 ms of which 1 ms to minimize.
[2024-05-29 21:24:39] [INFO ] Deduced a trap composed of 29 places in 554 ms of which 1 ms to minimize.
[2024-05-29 21:24:39] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 1 ms to minimize.
[2024-05-29 21:24:40] [INFO ] Deduced a trap composed of 19 places in 532 ms of which 1 ms to minimize.
[2024-05-29 21:24:40] [INFO ] Deduced a trap composed of 26 places in 569 ms of which 1 ms to minimize.
[2024-05-29 21:24:41] [INFO ] Deduced a trap composed of 29 places in 493 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 109/1775 variables, and 52 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/109 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1150 constraints, Known Traps: 50/50 constraints]
After SMT, in 84513ms problems are : Problem set: 0 solved, 1661 unsolved
Search for dead transitions found 0 dead transitions in 84528ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 87879 ms. Remains : 109/109 places, 1678/1678 transitions.
Treatment of property StigmergyElection-PT-09b-LTLCardinality-06 finished in 285258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 40956/40956 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 983 transition count 40950
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 983 transition count 40950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 979 transition count 40946
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 979 transition count 40946
Applied a total of 20 rules in 1322 ms. Remains 979 /989 variables (removed 10) and now considering 40946/40956 (removed 10) transitions.
// Phase 1: matrix 40946 rows 979 cols
[2024-05-29 21:24:49] [INFO ] Computed 10 invariants in 721 ms
[2024-05-29 21:25:03] [INFO ] Implicit Places using invariants in 14290 ms returned []
Implicit Place search using SMT only with invariants took 14297 ms to find 0 implicit places.
Running 40945 sub problems to find dead transitions.
[2024-05-29 21:25:03] [INFO ] Invariant cache hit.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-09b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-09b, 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 r399-tall-171690530200371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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