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-171690530100340.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-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530100340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 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 3.4M 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-07b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717012349144

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:52:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:52:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:52:30] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2024-05-29 19:52:30] [INFO ] Transformed 971 places.
[2024-05-29 19:52:30] [INFO ] Transformed 5542 transitions.
[2024-05-29 19:52:30] [INFO ] Found NUPN structural information;
[2024-05-29 19:52:30] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-07b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 971 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 849 transition count 5420
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 849 transition count 5420
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 309 place count 784 transition count 5355
Iterating global reduction 0 with 65 rules applied. Total rules applied 374 place count 784 transition count 5355
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 388 place count 770 transition count 5341
Iterating global reduction 0 with 14 rules applied. Total rules applied 402 place count 770 transition count 5341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 409 place count 763 transition count 5334
Iterating global reduction 0 with 7 rules applied. Total rules applied 416 place count 763 transition count 5334
Applied a total of 416 rules in 347 ms. Remains 763 /971 variables (removed 208) and now considering 5334/5542 (removed 208) transitions.
// Phase 1: matrix 5334 rows 763 cols
[2024-05-29 19:52:31] [INFO ] Computed 8 invariants in 142 ms
[2024-05-29 19:52:31] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-29 19:52:31] [INFO ] Invariant cache hit.
[2024-05-29 19:52:33] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:52:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 119537ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 119682ms
Starting structural reductions in LTL mode, iteration 1 : 763/971 places, 5334/5542 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122439 ms. Remains : 763/971 places, 5334/5542 transitions.
Support contains 43 out of 763 places after structural reductions.
[2024-05-29 19:54:34] [INFO ] Flatten gal took : 593 ms
[2024-05-29 19:54:34] [INFO ] Flatten gal took : 393 ms
[2024-05-29 19:54:35] [INFO ] Input system was already deterministic with 5334 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (329 resets) in 2140 ms. (18 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 165534 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 18
Probabilistic random walk after 165534 steps, saw 32002 distinct states, run finished after 3006 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-29 19:54:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 707/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 707/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 772 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10433ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 740 edges and 763 vertex of which 118 / 763 are part of one of the 21 SCC in 7 ms
Free SCC test removed 97 places
Drop transitions (Empty/Sink Transition effects.) removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Graph (complete) has 1761 edges and 666 vertex of which 659 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.34 ms
Discarding 7 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 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 436 rules applied. Total rules applied 438 place count 659 transition count 4767
Reduce places removed 429 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 443 rules applied. Total rules applied 881 place count 230 transition count 4753
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 888 place count 223 transition count 4753
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 888 place count 223 transition count 4717
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 960 place count 187 transition count 4717
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 961 place count 187 transition count 4716
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1033 place count 151 transition count 4680
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1046 place count 151 transition count 4667
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1060 place count 137 transition count 4640
Iterating global reduction 5 with 14 rules applied. Total rules applied 1074 place count 137 transition count 4640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1075 place count 137 transition count 4639
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1081 place count 131 transition count 4633
Iterating global reduction 6 with 6 rules applied. Total rules applied 1087 place count 131 transition count 4633
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1103 place count 123 transition count 4625
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1109 place count 120 transition count 4633
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 1118 place count 120 transition count 4624
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1120 place count 119 transition count 4630
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1128 place count 119 transition count 4622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1130 place count 118 transition count 4628
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1138 place count 118 transition count 4620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1140 place count 117 transition count 4626
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1148 place count 117 transition count 4618
Free-agglomeration rule applied 50 times.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1198 place count 117 transition count 4568
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 1248 place count 67 transition count 4568
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1255 place count 60 transition count 4561
Iterating global reduction 7 with 7 rules applied. Total rules applied 1262 place count 60 transition count 4561
Applied a total of 1262 rules in 1988 ms. Remains 60 /763 variables (removed 703) and now considering 4561/5334 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1990 ms. Remains : 60/763 places, 4561/5334 transitions.
RANDOM walk for 40000 steps (2813 resets) in 1493 ms. (26 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 1/3 properties
BEST_FIRST walk for 408 steps (0 resets) in 8 ms. (45 steps per ms) remains 0/1 properties
Computed a total of 105 stabilizing places and 112 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((X(p0) U (p0||X(X(F(p0)))))))'
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 34 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-05-29 19:54:52] [INFO ] Invariant cache hit.
[2024-05-29 19:54:54] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2024-05-29 19:54:54] [INFO ] Invariant cache hit.
[2024-05-29 19:54:57] [INFO ] Implicit Places using invariants and state equation in 2942 ms returned []
Implicit Place search using SMT with State Equation took 4241 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:54:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 timeout
1.0)
(s23 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 119989ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120039ms
Finished structural reductions in LTL mode , in 1 iterations and 124334 ms. Remains : 763/763 places, 5334/5334 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-00
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLFireability-00 finished in 124660 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' '!(X(G((X(p1)||p0))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 31 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-05-29 19:56:57] [INFO ] Invariant cache hit.
[2024-05-29 19:56:58] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-29 19:56:58] [INFO ] Invariant cache hit.
[2024-05-29 19:57:01] [INFO ] Implicit Places using invariants and state equation in 2516 ms returned []
Implicit Place search using SMT with State Equation took 3607 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:57:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120168ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120216ms
Finished structural reductions in LTL mode , in 1 iterations and 123874 ms. Remains : 763/763 places, 5334/5334 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-01
Product exploration explored 100000 steps with 823 reset in 375 ms.
Product exploration explored 100000 steps with 824 reset in 382 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (328 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 355 ms. (112 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 209919 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 3
Probabilistic random walk after 209919 steps, saw 39469 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-29 19:59:05] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1819 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3825ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 140 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=46 )
Parikh walk visited 2 properties in 10 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 32 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-05-29 19:59:10] [INFO ] Invariant cache hit.
[2024-05-29 19:59:11] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2024-05-29 19:59:11] [INFO ] Invariant cache hit.
[2024-05-29 19:59:13] [INFO ] Implicit Places using invariants and state equation in 2525 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:59:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 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 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 119732ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 119780ms
Finished structural reductions in LTL mode , in 1 iterations and 123459 ms. Remains : 763/763 places, 5334/5334 transitions.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (326 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (44 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 213098 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 213098 steps, saw 39950 distinct states, run finished after 3003 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-29 20:01:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1410 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3106ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 776 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 1759 edges and 665 vertex of which 658 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Discarding 7 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 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 658 transition count 4730
Reduce places removed 464 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 478 rules applied. Total rules applied 951 place count 194 transition count 4716
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 958 place count 187 transition count 4716
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 958 place count 187 transition count 4680
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1030 place count 151 transition count 4680
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1031 place count 151 transition count 4679
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1103 place count 115 transition count 4643
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1117 place count 115 transition count 4629
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1140 place count 92 transition count 1813
Iterating global reduction 5 with 23 rules applied. Total rules applied 1163 place count 92 transition count 1813
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1172 place count 92 transition count 1804
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1179 place count 85 transition count 1797
Iterating global reduction 6 with 7 rules applied. Total rules applied 1186 place count 85 transition count 1797
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1200 place count 78 transition count 1790
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1206 place count 75 transition count 1798
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1214 place count 75 transition count 1790
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1216 place count 74 transition count 1796
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1224 place count 74 transition count 1788
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1226 place count 73 transition count 1794
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1234 place count 73 transition count 1786
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1236 place count 72 transition count 1792
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1244 place count 72 transition count 1784
Free-agglomeration rule applied 42 times.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1286 place count 72 transition count 1742
Reduce places removed 42 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 107 rules applied. Total rules applied 1393 place count 30 transition count 1677
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1400 place count 23 transition count 1670
Iterating global reduction 7 with 7 rules applied. Total rules applied 1407 place count 23 transition count 1670
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 7 with 127 rules applied. Total rules applied 1534 place count 23 transition count 1543
Drop transitions (Redundant composition of simpler transitions.) removed 602 transitions
Redundant transition composition rules discarded 602 transitions
Iterating global reduction 8 with 602 rules applied. Total rules applied 2136 place count 23 transition count 941
Applied a total of 2136 rules in 1139 ms. Remains 23 /763 variables (removed 740) and now considering 941/5334 (removed 4393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1139 ms. Remains : 23/763 places, 941/5334 transitions.
RANDOM walk for 147 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 825 reset in 349 ms.
Product exploration explored 100000 steps with 825 reset in 306 ms.
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 58 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-05-29 20:01:22] [INFO ] Invariant cache hit.
[2024-05-29 20:01:23] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-05-29 20:01:23] [INFO ] Invariant cache hit.
[2024-05-29 20:01:26] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 20:01:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120300ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120347ms
Finished structural reductions in LTL mode , in 1 iterations and 124065 ms. Remains : 763/763 places, 5334/5334 transitions.
Treatment of property StigmergyElection-PT-07b-LTLFireability-01 finished in 390428 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' '!(X((p0 U p1)))'
Support contains 14 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 35 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-05-29 20:03:27] [INFO ] Invariant cache hit.
[2024-05-29 20:03:28] [INFO ] Implicit Places using invariants in 936 ms returned []
[2024-05-29 20:03:28] [INFO ] Invariant cache hit.
[2024-05-29 20:03:31] [INFO ] Implicit Places using invariants and state equation in 2688 ms returned []
Implicit Place search using SMT with State Equation took 3630 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 20:03:31] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 119251ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 119298ms
Finished structural reductions in LTL mode , in 1 iterations and 122985 ms. Remains : 763/763 places, 5334/5334 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLFireability-02 finished in 123122 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(G((F(p1)||p0))))'
Support contains 12 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 771 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 664 transition count 4776
Reduce places removed 445 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 459 rules applied. Total rules applied 905 place count 219 transition count 4762
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 912 place count 212 transition count 4762
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 912 place count 212 transition count 4733
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 970 place count 183 transition count 4733
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 976 place count 177 transition count 4727
Iterating global reduction 3 with 6 rules applied. Total rules applied 982 place count 177 transition count 4727
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1050 place count 143 transition count 4693
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1071 place count 122 transition count 2613
Iterating global reduction 3 with 21 rules applied. Total rules applied 1092 place count 122 transition count 2613
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1099 place count 122 transition count 2606
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1106 place count 115 transition count 2592
Iterating global reduction 4 with 7 rules applied. Total rules applied 1113 place count 115 transition count 2592
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1120 place count 108 transition count 2578
Iterating global reduction 4 with 7 rules applied. Total rules applied 1127 place count 108 transition count 2578
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1149 place count 97 transition count 2585
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1150 place count 96 transition count 2571
Iterating global reduction 4 with 1 rules applied. Total rules applied 1151 place count 96 transition count 2571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1152 place count 96 transition count 2570
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1159 place count 96 transition count 2563
Applied a total of 1159 rules in 793 ms. Remains 96 /763 variables (removed 667) and now considering 2563/5334 (removed 2771) transitions.
[2024-05-29 20:05:31] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
// Phase 1: matrix 2555 rows 96 cols
[2024-05-29 20:05:31] [INFO ] Computed 2 invariants in 35 ms
[2024-05-29 20:05:32] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-29 20:05:32] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
[2024-05-29 20:05:32] [INFO ] Invariant cache hit.
[2024-05-29 20:05:32] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 20:05:33] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2024-05-29 20:05:33] [INFO ] Redundant transitions in 175 ms returned []
Running 2546 sub problems to find dead transitions.
[2024-05-29 20:05:33] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
[2024-05-29 20:05:33] [INFO ] Invariant cache hit.
[2024-05-29 20:05:34] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
[2024-05-29 20:06:19] [INFO ] Deduced a trap composed of 20 places in 847 ms of which 7 ms to minimize.
[2024-05-29 20:06:20] [INFO ] Deduced a trap composed of 24 places in 972 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 29 places in 822 ms of which 2 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 15 places in 772 ms of which 1 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 15 places in 790 ms of which 1 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 19 places in 793 ms of which 1 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 14 places in 768 ms of which 1 ms to minimize.
[2024-05-29 20:06:25] [INFO ] Deduced a trap composed of 23 places in 758 ms of which 1 ms to minimize.
[2024-05-29 20:06:26] [INFO ] Deduced a trap composed of 16 places in 723 ms of which 0 ms to minimize.
[2024-05-29 20:06:27] [INFO ] Deduced a trap composed of 21 places in 739 ms of which 1 ms to minimize.
[2024-05-29 20:06:27] [INFO ] Deduced a trap composed of 23 places in 742 ms of which 1 ms to minimize.
[2024-05-29 20:06:28] [INFO ] Deduced a trap composed of 15 places in 675 ms of which 0 ms to minimize.
[2024-05-29 20:06:29] [INFO ] Deduced a trap composed of 31 places in 713 ms of which 3 ms to minimize.
[2024-05-29 20:06:30] [INFO ] Deduced a trap composed of 15 places in 725 ms of which 4 ms to minimize.
[2024-05-29 20:06:30] [INFO ] Deduced a trap composed of 23 places in 728 ms of which 1 ms to minimize.
[2024-05-29 20:06:31] [INFO ] Deduced a trap composed of 16 places in 664 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 96/2651 variables, and 18 constraints, problems are : Problem set: 0 solved, 2546 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/96 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2546/190 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
[2024-05-29 20:07:06] [INFO ] Deduced a trap composed of 23 places in 734 ms of which 2 ms to minimize.
SMT process timed out in 92232ms, After SMT, problems are : Problem set: 0 solved, 2546 unsolved
Search for dead transitions found 0 dead transitions in 92256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/763 places, 2563/5334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95184 ms. Remains : 96/763 places, 2563/5334 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-03
Product exploration explored 100000 steps with 7248 reset in 777 ms.
Product exploration explored 100000 steps with 7295 reset in 591 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2905 resets) in 1632 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (227 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (228 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (230 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (226 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 246743 steps, run timeout after 3005 ms. (steps per millisecond=82 ) properties seen :0 out of 4
Probabilistic random walk after 246743 steps, saw 52396 distinct states, run finished after 3005 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-29 20:07:11] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
[2024-05-29 20:07:11] [INFO ] Invariant cache hit.
[2024-05-29 20:07:11] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/94 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2553/2647 variables, 94/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2647 variables, 126/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2647 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/2650 variables, 2/223 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2650 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2650 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2651 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2651/2651 variables, and 225 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/94 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2553/2647 variables, 94/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2647 variables, 126/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2647 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/2650 variables, 2/223 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2650 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2650 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2651 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2651/2651 variables, and 225 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4768ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 25 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLFireability-03 finished in 105393 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((G(p0)||G(F(p1)))))'
Support contains 11 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 772 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 446 transitions
Trivial Post-agglo rules discarded 446 transitions
Performed 446 trivial Post agglomeration. Transition count delta: 446
Iterating post reduction 0 with 446 rules applied. Total rules applied 447 place count 664 transition count 4775
Reduce places removed 446 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 460 rules applied. Total rules applied 907 place count 218 transition count 4761
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 914 place count 211 transition count 4761
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 914 place count 211 transition count 4732
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 972 place count 182 transition count 4732
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 978 place count 176 transition count 4726
Iterating global reduction 3 with 6 rules applied. Total rules applied 984 place count 176 transition count 4726
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1052 place count 142 transition count 4692
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1074 place count 120 transition count 1883
Iterating global reduction 3 with 22 rules applied. Total rules applied 1096 place count 120 transition count 1883
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1104 place count 120 transition count 1875
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1111 place count 113 transition count 1861
Iterating global reduction 4 with 7 rules applied. Total rules applied 1118 place count 113 transition count 1861
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1125 place count 106 transition count 1847
Iterating global reduction 4 with 7 rules applied. Total rules applied 1132 place count 106 transition count 1847
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1154 place count 95 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1155 place count 94 transition count 1840
Iterating global reduction 4 with 1 rules applied. Total rules applied 1156 place count 94 transition count 1840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1157 place count 94 transition count 1839
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1164 place count 94 transition count 1832
Applied a total of 1164 rules in 464 ms. Remains 94 /763 variables (removed 669) and now considering 1832/5334 (removed 3502) transitions.
[2024-05-29 20:07:16] [INFO ] Flow matrix only has 1824 transitions (discarded 8 similar events)
// Phase 1: matrix 1824 rows 94 cols
[2024-05-29 20:07:16] [INFO ] Computed 2 invariants in 26 ms
[2024-05-29 20:07:17] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-29 20:07:17] [INFO ] Flow matrix only has 1824 transitions (discarded 8 similar events)
[2024-05-29 20:07:17] [INFO ] Invariant cache hit.
[2024-05-29 20:07:17] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 20:07:18] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2024-05-29 20:07:18] [INFO ] Redundant transitions in 111 ms returned []
Running 1815 sub problems to find dead transitions.
[2024-05-29 20:07:18] [INFO ] Flow matrix only has 1824 transitions (discarded 8 similar events)
[2024-05-29 20:07:18] [INFO ] Invariant cache hit.
[2024-05-29 20:07:18] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
[2024-05-29 20:07:49] [INFO ] Deduced a trap composed of 22 places in 530 ms of which 2 ms to minimize.
[2024-05-29 20:07:49] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 1 ms to minimize.
[2024-05-29 20:07:50] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 1 ms to minimize.
[2024-05-29 20:07:50] [INFO ] Deduced a trap composed of 15 places in 495 ms of which 1 ms to minimize.
[2024-05-29 20:07:51] [INFO ] Deduced a trap composed of 29 places in 482 ms of which 1 ms to minimize.
[2024-05-29 20:07:51] [INFO ] Deduced a trap composed of 38 places in 517 ms of which 0 ms to minimize.
[2024-05-29 20:07:52] [INFO ] Deduced a trap composed of 17 places in 530 ms of which 0 ms to minimize.
[2024-05-29 20:07:52] [INFO ] Deduced a trap composed of 16 places in 530 ms of which 0 ms to minimize.
[2024-05-29 20:07:53] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 1 ms to minimize.
[2024-05-29 20:07:53] [INFO ] Deduced a trap composed of 15 places in 482 ms of which 0 ms to minimize.
[2024-05-29 20:07:54] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 1 ms to minimize.
[2024-05-29 20:07:54] [INFO ] Deduced a trap composed of 26 places in 486 ms of which 1 ms to minimize.
[2024-05-29 20:07:55] [INFO ] Deduced a trap composed of 22 places in 525 ms of which 1 ms to minimize.
[2024-05-29 20:07:55] [INFO ] Deduced a trap composed of 18 places in 576 ms of which 1 ms to minimize.
[2024-05-29 20:07:56] [INFO ] Deduced a trap composed of 16 places in 513 ms of which 1 ms to minimize.
[2024-05-29 20:07:57] [INFO ] Deduced a trap composed of 15 places in 490 ms of which 1 ms to minimize.
[2024-05-29 20:07:57] [INFO ] Deduced a trap composed of 22 places in 478 ms of which 1 ms to minimize.
[2024-05-29 20:07:58] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 2 ms to minimize.
[2024-05-29 20:07:58] [INFO ] Deduced a trap composed of 23 places in 488 ms of which 0 ms to minimize.
[2024-05-29 20:07:59] [INFO ] Deduced a trap composed of 23 places in 490 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
[2024-05-29 20:08:04] [INFO ] Deduced a trap composed of 21 places in 478 ms of which 0 ms to minimize.
[2024-05-29 20:08:04] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 1 ms to minimize.
[2024-05-29 20:08:05] [INFO ] Deduced a trap composed of 23 places in 496 ms of which 1 ms to minimize.
[2024-05-29 20:08:07] [INFO ] Deduced a trap composed of 13 places in 474 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/1918 variables, and 26 constraints, problems are : Problem set: 0 solved, 1815 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/94 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1815/195 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
[2024-05-29 20:08:16] [INFO ] Deduced a trap composed of 22 places in 514 ms of which 0 ms to minimize.
[2024-05-29 20:08:28] [INFO ] Deduced a trap composed of 24 places in 496 ms of which 1 ms to minimize.
[2024-05-29 20:08:29] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 1 ms to minimize.
[2024-05-29 20:08:29] [INFO ] Deduced a trap composed of 25 places in 431 ms of which 1 ms to minimize.
[2024-05-29 20:08:30] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 94/1918 variables, and 31 constraints, problems are : Problem set: 0 solved, 1815 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/94 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/195 constraints, Known Traps: 29/29 constraints]
After SMT, in 82102ms problems are : Problem set: 0 solved, 1815 unsolved
Search for dead transitions found 0 dead transitions in 82118ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/763 places, 1832/5334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84111 ms. Remains : 94/763 places, 1832/5334 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-04
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLFireability-04 finished in 84208 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 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 776 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 450 rules applied. Total rules applied 451 place count 664 transition count 4771
Reduce places removed 450 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 464 rules applied. Total rules applied 915 place count 214 transition count 4757
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 922 place count 207 transition count 4757
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 922 place count 207 transition count 4728
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 980 place count 178 transition count 4728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 986 place count 172 transition count 4722
Iterating global reduction 3 with 6 rules applied. Total rules applied 992 place count 172 transition count 4722
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1060 place count 138 transition count 4688
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1083 place count 115 transition count 1393
Iterating global reduction 3 with 23 rules applied. Total rules applied 1106 place count 115 transition count 1393
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1115 place count 115 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1122 place count 108 transition count 1370
Iterating global reduction 4 with 7 rules applied. Total rules applied 1129 place count 108 transition count 1370
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1136 place count 101 transition count 1356
Iterating global reduction 4 with 7 rules applied. Total rules applied 1143 place count 101 transition count 1356
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1165 place count 90 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1166 place count 89 transition count 1349
Iterating global reduction 4 with 1 rules applied. Total rules applied 1167 place count 89 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1168 place count 89 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1175 place count 89 transition count 1341
Applied a total of 1175 rules in 439 ms. Remains 89 /763 variables (removed 674) and now considering 1341/5334 (removed 3993) transitions.
[2024-05-29 20:08:40] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
// Phase 1: matrix 1333 rows 89 cols
[2024-05-29 20:08:41] [INFO ] Computed 2 invariants in 21 ms
[2024-05-29 20:08:41] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-29 20:08:41] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:08:41] [INFO ] Invariant cache hit.
[2024-05-29 20:08:41] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 20:08:42] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2024-05-29 20:08:42] [INFO ] Redundant transitions in 24 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-05-29 20:08:42] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:08:42] [INFO ] Invariant cache hit.
[2024-05-29 20:08:42] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-05-29 20:09:09] [INFO ] Deduced a trap composed of 14 places in 387 ms of which 0 ms to minimize.
[2024-05-29 20:09:09] [INFO ] Deduced a trap composed of 19 places in 467 ms of which 1 ms to minimize.
[2024-05-29 20:09:10] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 0 ms to minimize.
[2024-05-29 20:09:10] [INFO ] Deduced a trap composed of 13 places in 468 ms of which 1 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 19 places in 474 ms of which 2 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 15 places in 457 ms of which 1 ms to minimize.
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 0 ms to minimize.
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 15 places in 393 ms of which 1 ms to minimize.
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 23 places in 427 ms of which 2 ms to minimize.
[2024-05-29 20:09:15] [INFO ] Deduced a trap composed of 14 places in 432 ms of which 1 ms to minimize.
[2024-05-29 20:09:21] [INFO ] Deduced a trap composed of 21 places in 397 ms of which 1 ms to minimize.
[2024-05-29 20:09:21] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 0 ms to minimize.
[2024-05-29 20:09:21] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 1 ms to minimize.
[2024-05-29 20:09:22] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 1 ms to minimize.
[2024-05-29 20:09:22] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:09:22] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 5 (OVERLAPS) 1332/1421 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
SMT process timed out in 50967ms, After SMT, problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 50979ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/763 places, 1341/5334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52561 ms. Remains : 89/763 places, 1341/5334 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-05
Product exploration explored 100000 steps with 7566 reset in 393 ms.
Product exploration explored 100000 steps with 7572 reset in 377 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3045 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (242 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 709491 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 1
Probabilistic random walk after 709491 steps, saw 162029 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
[2024-05-29 20:09:37] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:09:37] [INFO ] Invariant cache hit.
[2024-05-29 20:09:37] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1421 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1422 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1422/1422 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1418 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1421 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1421 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1422 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1422/1422 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1341/1341 transitions.
Applied a total of 0 rules in 69 ms. Remains 89 /89 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
[2024-05-29 20:09:39] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:09:39] [INFO ] Invariant cache hit.
[2024-05-29 20:09:39] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-29 20:09:39] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:09:39] [INFO ] Invariant cache hit.
[2024-05-29 20:09:39] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 20:09:40] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2024-05-29 20:09:40] [INFO ] Redundant transitions in 23 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-05-29 20:09:40] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:09:40] [INFO ] Invariant cache hit.
[2024-05-29 20:09:40] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-05-29 20:10:10] [INFO ] Deduced a trap composed of 14 places in 458 ms of which 1 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 19 places in 384 ms of which 1 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 20 places in 388 ms of which 1 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2024-05-29 20:10:12] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 1 ms to minimize.
[2024-05-29 20:10:12] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2024-05-29 20:10:13] [INFO ] Deduced a trap composed of 15 places in 434 ms of which 1 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 1 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 1 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 14 places in 346 ms of which 1 ms to minimize.
[2024-05-29 20:10:21] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 1 ms to minimize.
[2024-05-29 20:10:22] [INFO ] Deduced a trap composed of 23 places in 454 ms of which 0 ms to minimize.
[2024-05-29 20:10:22] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 1 ms to minimize.
[2024-05-29 20:10:22] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 1 ms to minimize.
[2024-05-29 20:10:23] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 1 ms to minimize.
[2024-05-29 20:10:23] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 5 (OVERLAPS) 1332/1421 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 126/234 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1421/1422 variables, and 234 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 1324/1205 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 5 (OVERLAPS) 1332/1421 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 126/234 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1421/1422 variables, and 1439 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 34267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 1324/1205 constraints, Known Traps: 17/17 constraints]
After SMT, in 88231ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 88243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 89381 ms. Remains : 89/89 places, 1341/1341 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3021 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (249 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 700867 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 700867 steps, saw 160602 distinct states, run finished after 3002 ms. (steps per millisecond=233 ) properties seen :0
[2024-05-29 20:11:11] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:11:11] [INFO ] Invariant cache hit.
[2024-05-29 20:11:12] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1421 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1422 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1422/1422 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1418 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1421 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1421 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1422 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1422/1422 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1997ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4046 reset in 195 ms.
Product exploration explored 100000 steps with 7564 reset in 334 ms.
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1341/1341 transitions.
Applied a total of 0 rules in 48 ms. Remains 89 /89 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
[2024-05-29 20:11:14] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:11:14] [INFO ] Invariant cache hit.
[2024-05-29 20:11:15] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 20:11:15] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:11:15] [INFO ] Invariant cache hit.
[2024-05-29 20:11:15] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 20:11:15] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2024-05-29 20:11:16] [INFO ] Redundant transitions in 25 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-05-29 20:11:16] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:11:16] [INFO ] Invariant cache hit.
[2024-05-29 20:11:16] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-05-29 20:11:45] [INFO ] Deduced a trap composed of 14 places in 428 ms of which 4 ms to minimize.
[2024-05-29 20:11:46] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 1 ms to minimize.
[2024-05-29 20:11:46] [INFO ] Deduced a trap composed of 20 places in 474 ms of which 1 ms to minimize.
[2024-05-29 20:11:47] [INFO ] Deduced a trap composed of 13 places in 461 ms of which 0 ms to minimize.
[2024-05-29 20:11:47] [INFO ] Deduced a trap composed of 19 places in 450 ms of which 1 ms to minimize.
[2024-05-29 20:11:47] [INFO ] Deduced a trap composed of 13 places in 459 ms of which 1 ms to minimize.
[2024-05-29 20:11:48] [INFO ] Deduced a trap composed of 15 places in 447 ms of which 1 ms to minimize.
[2024-05-29 20:11:50] [INFO ] Deduced a trap composed of 15 places in 433 ms of which 1 ms to minimize.
[2024-05-29 20:11:50] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 0 ms to minimize.
[2024-05-29 20:11:51] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 2 ms to minimize.
[2024-05-29 20:11:51] [INFO ] Deduced a trap composed of 14 places in 424 ms of which 1 ms to minimize.
[2024-05-29 20:11:57] [INFO ] Deduced a trap composed of 21 places in 485 ms of which 1 ms to minimize.
[2024-05-29 20:11:57] [INFO ] Deduced a trap composed of 23 places in 447 ms of which 0 ms to minimize.
[2024-05-29 20:11:58] [INFO ] Deduced a trap composed of 23 places in 427 ms of which 1 ms to minimize.
[2024-05-29 20:11:58] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 0 ms to minimize.
[2024-05-29 20:11:58] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 1 ms to minimize.
[2024-05-29 20:11:59] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
SMT process timed out in 53358ms, After SMT, problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 53370ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54517 ms. Remains : 89/89 places, 1341/1341 transitions.
Treatment of property StigmergyElection-PT-07b-LTLFireability-05 finished in 209301 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(G(p0)))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 776 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 450 rules applied. Total rules applied 451 place count 664 transition count 4771
Reduce places removed 450 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 464 rules applied. Total rules applied 915 place count 214 transition count 4757
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 922 place count 207 transition count 4757
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 922 place count 207 transition count 4728
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 980 place count 178 transition count 4728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 986 place count 172 transition count 4722
Iterating global reduction 3 with 6 rules applied. Total rules applied 992 place count 172 transition count 4722
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1060 place count 138 transition count 4688
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1083 place count 115 transition count 1393
Iterating global reduction 3 with 23 rules applied. Total rules applied 1106 place count 115 transition count 1393
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1115 place count 115 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1122 place count 108 transition count 1370
Iterating global reduction 4 with 7 rules applied. Total rules applied 1129 place count 108 transition count 1370
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1136 place count 101 transition count 1356
Iterating global reduction 4 with 7 rules applied. Total rules applied 1143 place count 101 transition count 1356
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1165 place count 90 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1166 place count 89 transition count 1349
Iterating global reduction 4 with 1 rules applied. Total rules applied 1167 place count 89 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1168 place count 89 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1175 place count 89 transition count 1341
Applied a total of 1175 rules in 378 ms. Remains 89 /763 variables (removed 674) and now considering 1341/5334 (removed 3993) transitions.
[2024-05-29 20:12:10] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
// Phase 1: matrix 1333 rows 89 cols
[2024-05-29 20:12:10] [INFO ] Computed 2 invariants in 18 ms
[2024-05-29 20:12:10] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-29 20:12:10] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:12:10] [INFO ] Invariant cache hit.
[2024-05-29 20:12:10] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 20:12:11] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2024-05-29 20:12:11] [INFO ] Redundant transitions in 25 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-05-29 20:12:11] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-05-29 20:12:11] [INFO ] Invariant cache hit.
[2024-05-29 20:12:11] [INFO ] State equation strengthened by 127 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-07b

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 971
TRANSITIONS: 5542
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 65199
NUPN UNITS: 15
LOADING TIME: 1.951

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.199
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.783
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1433
MODEL NAME: /home/mcc/execution/model
971 places, 5542 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-07b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07b-LTLFireability-01 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-07b-LTLFireability-04 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-07b-LTLFireability-08 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-07b-LTLFireability-09 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-07b-LTLFireability-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717014687589

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-07b"
export BK_EXAMINATION="LTLFireability"
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-07b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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