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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 18:44 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 1.2M 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-06b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717010877149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:27:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:27:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:27:58] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-29 19:27:58] [INFO ] Transformed 835 places.
[2024-05-29 19:27:58] [INFO ] Transformed 2416 transitions.
[2024-05-29 19:27:58] [INFO ] Found NUPN structural information;
[2024-05-29 19:27:58] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 104 place count 731 transition count 2312
Iterating global reduction 0 with 104 rules applied. Total rules applied 208 place count 731 transition count 2312
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 257 place count 682 transition count 2263
Iterating global reduction 0 with 49 rules applied. Total rules applied 306 place count 682 transition count 2263
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 316 place count 672 transition count 2253
Iterating global reduction 0 with 10 rules applied. Total rules applied 326 place count 672 transition count 2253
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 331 place count 667 transition count 2248
Iterating global reduction 0 with 5 rules applied. Total rules applied 336 place count 667 transition count 2248
Applied a total of 336 rules in 269 ms. Remains 667 /835 variables (removed 168) and now considering 2248/2416 (removed 168) transitions.
// Phase 1: matrix 2248 rows 667 cols
[2024-05-29 19:27:59] [INFO ] Computed 7 invariants in 63 ms
[2024-05-29 19:27:59] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-29 19:27:59] [INFO ] Invariant cache hit.
[2024-05-29 19:28:01] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
Running 2247 sub problems to find dead transitions.
[2024-05-29 19:28:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2247 unsolved
SMT process timed out in 49295ms, After SMT, problems are : Problem set: 0 solved, 2247 unsolved
Search for dead transitions found 0 dead transitions in 49338ms
Starting structural reductions in LTL mode, iteration 1 : 667/835 places, 2248/2416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51519 ms. Remains : 667/835 places, 2248/2416 transitions.
Support contains 32 out of 667 places after structural reductions.
[2024-05-29 19:28:50] [INFO ] Flatten gal took : 269 ms
[2024-05-29 19:28:51] [INFO ] Flatten gal took : 152 ms
[2024-05-29 19:28:51] [INFO ] Input system was already deterministic with 2248 transitions.
RANDOM walk for 40000 steps (380 resets) in 1895 ms. (21 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40004 steps (60 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (57 resets) in 169 ms. (235 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (61 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
[2024-05-29 19:28:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 639/653 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/667 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2248/2915 variables, 667/674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2915 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/2915 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2915/2915 variables, and 674 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 667/667 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 639/653 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:28:54] [INFO ] Deduced a trap composed of 220 places in 621 ms of which 39 ms to minimize.
[2024-05-29 19:28:54] [INFO ] Deduced a trap composed of 165 places in 553 ms of which 3 ms to minimize.
[2024-05-29 19:28:55] [INFO ] Deduced a trap composed of 223 places in 626 ms of which 3 ms to minimize.
[2024-05-29 19:28:55] [INFO ] Deduced a trap composed of 166 places in 555 ms of which 7 ms to minimize.
[2024-05-29 19:28:56] [INFO ] Deduced a trap composed of 169 places in 640 ms of which 3 ms to minimize.
[2024-05-29 19:28:57] [INFO ] Deduced a trap composed of 171 places in 606 ms of which 3 ms to minimize.
[2024-05-29 19:28:57] [INFO ] Deduced a trap composed of 166 places in 599 ms of which 3 ms to minimize.
[2024-05-29 19:28:58] [INFO ] Deduced a trap composed of 170 places in 565 ms of which 2 ms to minimize.
SMT process timed out in 6202ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 667/667 places, 2248/2248 transitions.
Graph (trivial) has 657 edges and 667 vertex of which 83 / 667 are part of one of the 15 SCC in 9 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 1412 edges and 599 vertex of which 594 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.19 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 404 rules applied. Total rules applied 406 place count 594 transition count 1753
Reduce places removed 399 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 413 rules applied. Total rules applied 819 place count 195 transition count 1739
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 830 place count 188 transition count 1735
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 834 place count 184 transition count 1735
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 834 place count 184 transition count 1701
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 902 place count 150 transition count 1701
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 903 place count 150 transition count 1700
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 905 place count 148 transition count 1697
Iterating global reduction 5 with 2 rules applied. Total rules applied 907 place count 148 transition count 1697
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 908 place count 148 transition count 1696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 909 place count 147 transition count 1696
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 910 place count 146 transition count 1694
Iterating global reduction 7 with 1 rules applied. Total rules applied 911 place count 146 transition count 1694
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 967 place count 118 transition count 1666
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 973 place count 118 transition count 1660
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 992 place count 99 transition count 313
Iterating global reduction 8 with 19 rules applied. Total rules applied 1011 place count 99 transition count 313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1021 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1022 place count 98 transition count 302
Iterating global reduction 9 with 1 rules applied. Total rules applied 1023 place count 98 transition count 302
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 1043 place count 88 transition count 292
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1053 place count 83 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1055 place count 83 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 1065 place count 83 transition count 288
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 10 with 2 rules applied. Total rules applied 1067 place count 82 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 1075 place count 82 transition count 286
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 10 with 2 rules applied. Total rules applied 1077 place count 81 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 1085 place count 81 transition count 284
Free-agglomeration rule applied 31 times.
Iterating global reduction 10 with 31 rules applied. Total rules applied 1116 place count 81 transition count 253
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 10 with 31 rules applied. Total rules applied 1147 place count 50 transition count 253
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1151 place count 46 transition count 249
Iterating global reduction 11 with 4 rules applied. Total rules applied 1155 place count 46 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 1165 place count 46 transition count 239
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1166 place count 46 transition count 239
Applied a total of 1166 rules in 426 ms. Remains 46 /667 variables (removed 621) and now considering 239/2248 (removed 2009) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 46/667 places, 239/2248 transitions.
RANDOM walk for 40000 steps (99 resets) in 278 ms. (143 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40001 steps (187 resets) in 98 ms. (404 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (216 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
// Phase 1: matrix 239 rows 46 cols
[2024-05-29 19:28:59] [INFO ] Computed 7 invariants in 2 ms
[2024-05-29 19:28:59] [INFO ] State equation strengthened by 194 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/46 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/285 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 194/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 194/194 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:28:59] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:28:59] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 29/285 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/46 constraints, ReadFeed: 0/194 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 230ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA StigmergyElection-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 91 stabilizing places and 97 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' '!(F((G(p0)||G((X(p1)||F(p2))))))'
Support contains 6 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 2248/2248 transitions.
Graph (trivial) has 672 edges and 667 vertex of which 98 / 667 are part of one of the 17 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 390 place count 585 transition count 1766
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 404 rules applied. Total rules applied 794 place count 196 transition count 1751
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 806 place count 188 transition count 1747
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 810 place count 184 transition count 1747
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 810 place count 184 transition count 1721
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 862 place count 158 transition count 1721
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 870 place count 150 transition count 1713
Iterating global reduction 4 with 8 rules applied. Total rules applied 878 place count 150 transition count 1713
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 879 place count 149 transition count 1712
Iterating global reduction 4 with 1 rules applied. Total rules applied 880 place count 149 transition count 1712
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 932 place count 123 transition count 1686
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 953 place count 102 transition count 343
Iterating global reduction 4 with 21 rules applied. Total rules applied 974 place count 102 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 984 place count 102 transition count 333
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 988 place count 98 transition count 325
Iterating global reduction 5 with 4 rules applied. Total rules applied 992 place count 98 transition count 325
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 996 place count 94 transition count 317
Iterating global reduction 5 with 4 rules applied. Total rules applied 1000 place count 94 transition count 317
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1026 place count 81 transition count 323
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1027 place count 80 transition count 307
Iterating global reduction 5 with 1 rules applied. Total rules applied 1028 place count 80 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1029 place count 80 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1035 place count 80 transition count 300
Applied a total of 1035 rules in 189 ms. Remains 80 /667 variables (removed 587) and now considering 300/2248 (removed 1948) transitions.
[2024-05-29 19:28:59] [INFO ] Flow matrix only has 292 transitions (discarded 8 similar events)
// Phase 1: matrix 292 rows 80 cols
[2024-05-29 19:28:59] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:28:59] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 19:28:59] [INFO ] Flow matrix only has 292 transitions (discarded 8 similar events)
[2024-05-29 19:28:59] [INFO ] Invariant cache hit.
[2024-05-29 19:28:59] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:29:00] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-29 19:29:00] [INFO ] Redundant transitions in 15 ms returned []
Running 283 sub problems to find dead transitions.
[2024-05-29 19:29:00] [INFO ] Flow matrix only has 292 transitions (discarded 8 similar events)
[2024-05-29 19:29:00] [INFO ] Invariant cache hit.
[2024-05-29 19:29:00] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 3 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:06] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-29 19:29:06] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:29:06] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 291/371 variables, 80/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:12] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:14] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 13 (OVERLAPS) 1/372 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 15 (OVERLAPS) 0/372 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 189 constraints, problems are : Problem set: 0 solved, 283 unsolved in 25790 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:27] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 291/371 variables, 80/127 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 62/189 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 283/472 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 19:29:38] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 474 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 46/46 constraints]
After SMT, in 56248ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 56250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/667 places, 300/2248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56743 ms. Remains : 80/667 places, 300/2248 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLCardinality-04
Product exploration explored 100000 steps with 8849 reset in 348 ms.
Product exploration explored 100000 steps with 8864 reset in 300 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 175 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3512 resets) in 764 ms. (52 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (333 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (335 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (328 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (322 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
[2024-05-29 19:29:57] [INFO ] Flow matrix only has 292 transitions (discarded 8 similar events)
[2024-05-29 19:29:57] [INFO ] Invariant cache hit.
[2024-05-29 19:29:57] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 290/368 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 62/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/371 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-29 19:29:59] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 4 (OVERLAPS) 290/368 variables, 78/88 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 62/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/371 variables, 2/153 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/154 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 155 constraints, problems are : Problem set: 3 solved, 1 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 1225ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 34 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 6 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p2 p1)), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 93 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLCardinality-04 finished in 59732 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((F(p0)&&F(p1)&&F(p2))))'
Support contains 5 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 2248/2248 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 661 transition count 2242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 661 transition count 2242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 660 transition count 2241
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 660 transition count 2241
Applied a total of 14 rules in 58 ms. Remains 660 /667 variables (removed 7) and now considering 2241/2248 (removed 7) transitions.
// Phase 1: matrix 2241 rows 660 cols
[2024-05-29 19:29:59] [INFO ] Computed 7 invariants in 27 ms
[2024-05-29 19:29:59] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-29 19:29:59] [INFO ] Invariant cache hit.
[2024-05-29 19:30:00] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
Running 2240 sub problems to find dead transitions.
[2024-05-29 19:30:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/659 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
SMT process timed out in 49330ms, After SMT, problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 49350ms
Starting structural reductions in LTL mode, iteration 1 : 660/667 places, 2241/2248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51083 ms. Remains : 660/667 places, 2241/2248 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLCardinality-07
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLCardinality-07 finished in 51355 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((F(p0)&&G(p1))))'
Support contains 4 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 2248/2248 transitions.
Graph (trivial) has 678 edges and 667 vertex of which 105 / 667 are part of one of the 18 SCC in 1 ms
Free SCC test removed 87 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 395 place count 579 transition count 1754
Reduce places removed 394 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 406 rules applied. Total rules applied 801 place count 185 transition count 1742
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 809 place count 179 transition count 1740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 811 place count 177 transition count 1740
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 811 place count 177 transition count 1716
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 859 place count 153 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 868 place count 144 transition count 1706
Iterating global reduction 4 with 9 rules applied. Total rules applied 877 place count 144 transition count 1706
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 878 place count 144 transition count 1705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 879 place count 143 transition count 1705
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 881 place count 141 transition count 1702
Iterating global reduction 6 with 2 rules applied. Total rules applied 883 place count 141 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 884 place count 140 transition count 1700
Iterating global reduction 6 with 1 rules applied. Total rules applied 885 place count 140 transition count 1700
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 937 place count 114 transition count 1674
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 958 place count 93 transition count 330
Iterating global reduction 6 with 21 rules applied. Total rules applied 979 place count 93 transition count 330
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 990 place count 93 transition count 319
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 995 place count 88 transition count 309
Iterating global reduction 7 with 5 rules applied. Total rules applied 1000 place count 88 transition count 309
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1005 place count 83 transition count 299
Iterating global reduction 7 with 5 rules applied. Total rules applied 1010 place count 83 transition count 299
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1030 place count 73 transition count 306
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1031 place count 72 transition count 294
Iterating global reduction 7 with 1 rules applied. Total rules applied 1032 place count 72 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1033 place count 72 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1039 place count 72 transition count 287
Applied a total of 1039 rules in 151 ms. Remains 72 /667 variables (removed 595) and now considering 287/2248 (removed 1961) transitions.
[2024-05-29 19:30:50] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
// Phase 1: matrix 280 rows 72 cols
[2024-05-29 19:30:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:30:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 19:30:50] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
[2024-05-29 19:30:50] [INFO ] Invariant cache hit.
[2024-05-29 19:30:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:30:51] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-29 19:30:51] [INFO ] Redundant transitions in 3 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-29 19:30:51] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
[2024-05-29 19:30:51] [INFO ] Invariant cache hit.
[2024-05-29 19:30:51] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:30:54] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:30:54] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:30:54] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:30:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:30:56] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:30:56] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:30:56] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:30:57] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:30:57] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:30:57] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 279/351 variables, 72/110 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 62/172 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 13 (OVERLAPS) 0/352 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 173 constraints, problems are : Problem set: 0 solved, 270 unsolved in 19074 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:31:11] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 279/351 variables, 72/111 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 62/173 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 270/443 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 1/352 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:31:36] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 445 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 38/38 constraints]
After SMT, in 49442ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 49444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/667 places, 287/2248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49848 ms. Remains : 72/667 places, 287/2248 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLCardinality-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLCardinality-10 finished in 49998 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 2 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 2248/2248 transitions.
Graph (trivial) has 679 edges and 667 vertex of which 97 / 667 are part of one of the 17 SCC in 2 ms
Free SCC test removed 80 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 402 place count 586 transition count 1755
Reduce places removed 401 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 415 rules applied. Total rules applied 817 place count 185 transition count 1741
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 826 place count 178 transition count 1739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 828 place count 176 transition count 1739
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 828 place count 176 transition count 1713
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 880 place count 150 transition count 1713
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 889 place count 141 transition count 1703
Iterating global reduction 4 with 9 rules applied. Total rules applied 898 place count 141 transition count 1703
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 899 place count 141 transition count 1702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 900 place count 140 transition count 1702
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 902 place count 138 transition count 1699
Iterating global reduction 6 with 2 rules applied. Total rules applied 904 place count 138 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 905 place count 137 transition count 1697
Iterating global reduction 6 with 1 rules applied. Total rules applied 906 place count 137 transition count 1697
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 956 place count 112 transition count 1672
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 977 place count 91 transition count 329
Iterating global reduction 6 with 21 rules applied. Total rules applied 998 place count 91 transition count 329
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1009 place count 91 transition count 318
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1013 place count 87 transition count 310
Iterating global reduction 7 with 4 rules applied. Total rules applied 1017 place count 87 transition count 310
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1021 place count 83 transition count 302
Iterating global reduction 7 with 4 rules applied. Total rules applied 1025 place count 83 transition count 302
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 7 with 22 rules applied. Total rules applied 1047 place count 72 transition count 309
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1048 place count 71 transition count 295
Iterating global reduction 7 with 1 rules applied. Total rules applied 1049 place count 71 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1050 place count 71 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1056 place count 71 transition count 288
Applied a total of 1056 rules in 168 ms. Remains 71 /667 variables (removed 596) and now considering 288/2248 (removed 1960) transitions.
[2024-05-29 19:31:40] [INFO ] Flow matrix only has 281 transitions (discarded 7 similar events)
// Phase 1: matrix 281 rows 71 cols
[2024-05-29 19:31:40] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:31:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 19:31:40] [INFO ] Flow matrix only has 281 transitions (discarded 7 similar events)
[2024-05-29 19:31:40] [INFO ] Invariant cache hit.
[2024-05-29 19:31:40] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:31:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-29 19:31:41] [INFO ] Redundant transitions in 6 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-29 19:31:41] [INFO ] Flow matrix only has 281 transitions (discarded 7 similar events)
[2024-05-29 19:31:41] [INFO ] Invariant cache hit.
[2024-05-29 19:31:41] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:31:44] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:31:44] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:31:44] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 280/351 variables, 71/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:31:49] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:31:49] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 1/352 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 12 (OVERLAPS) 0/352 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 168 constraints, problems are : Problem set: 0 solved, 271 unsolved in 18858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:32:01] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 280/351 variables, 71/106 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 271/439 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:32:18] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 19:32:28] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/352 variables, and 444 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 38/38 constraints]
After SMT, in 49280ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 49282ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/667 places, 288/2248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49702 ms. Remains : 71/667 places, 288/2248 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLCardinality-11
Product exploration explored 100000 steps with 9298 reset in 276 ms.
Stack based approach found an accepted trace after 35819 steps with 3315 reset with depth 20 and stack size 20 in 70 ms.
FORMULA StigmergyElection-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-06b-LTLCardinality-11 finished in 50109 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((F(p0)||G(p1))))'
Support contains 4 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 2248/2248 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 659 transition count 2240
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 659 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 657 transition count 2238
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 656 transition count 2237
Applied a total of 22 rules in 84 ms. Remains 656 /667 variables (removed 11) and now considering 2237/2248 (removed 11) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 19:32:30] [INFO ] Computed 7 invariants in 25 ms
[2024-05-29 19:32:31] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-29 19:32:31] [INFO ] Invariant cache hit.
[2024-05-29 19:32:32] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:32:32] [INFO ] Invariant cache hit.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-06b

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 835
TRANSITIONS: 2416
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 20130
NUPN UNITS: 13
LOADING TIME: 1.094

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.091
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.583
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: 1187
MODEL NAME: /home/mcc/execution/model
835 places, 2416 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-06b-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06b-LTLCardinality-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717011785769

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-06b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530100323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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