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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 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 117K 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-03b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717008949123

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 18:55:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 18:55:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:55:50] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-29 18:55:50] [INFO ] Transformed 427 places.
[2024-05-29 18:55:50] [INFO ] Transformed 518 transitions.
[2024-05-29 18:55:50] [INFO ] Found NUPN structural information;
[2024-05-29 18:55:50] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-03b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 380 transition count 471
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 380 transition count 471
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 116 place count 358 transition count 449
Iterating global reduction 0 with 22 rules applied. Total rules applied 138 place count 358 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 142 place count 354 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 146 place count 354 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 148 place count 352 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 150 place count 352 transition count 443
Applied a total of 150 rules in 116 ms. Remains 352 /427 variables (removed 75) and now considering 443/518 (removed 75) transitions.
// Phase 1: matrix 443 rows 352 cols
[2024-05-29 18:55:50] [INFO ] Computed 4 invariants in 31 ms
[2024-05-29 18:55:51] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-29 18:55:51] [INFO ] Invariant cache hit.
[2024-05-29 18:55:51] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-05-29 18:55:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/352 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-29 18:55:57] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 23 ms to minimize.
[2024-05-29 18:55:57] [INFO ] Deduced a trap composed of 170 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:55:58] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 3 ms to minimize.
[2024-05-29 18:55:58] [INFO ] Deduced a trap composed of 169 places in 83 ms of which 3 ms to minimize.
[2024-05-29 18:55:58] [INFO ] Deduced a trap composed of 169 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:55:59] [INFO ] Deduced a trap composed of 169 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:55:59] [INFO ] Deduced a trap composed of 170 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:55:59] [INFO ] Deduced a trap composed of 189 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:55:59] [INFO ] Deduced a trap composed of 170 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:55:59] [INFO ] Deduced a trap composed of 169 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:56:00] [INFO ] Deduced a trap composed of 169 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:56:00] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:56:00] [INFO ] Deduced a trap composed of 167 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:56:00] [INFO ] Deduced a trap composed of 169 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:56:00] [INFO ] Deduced a trap composed of 168 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-29 18:56:01] [INFO ] Deduced a trap composed of 173 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:56:04] [INFO ] Deduced a trap composed of 172 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (OVERLAPS) 443/795 variables, 352/373 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-29 18:56:14] [INFO ] Deduced a trap composed of 169 places in 94 ms of which 4 ms to minimize.
[2024-05-29 18:56:14] [INFO ] Deduced a trap composed of 171 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:56:14] [INFO ] Deduced a trap composed of 174 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 795/795 variables, and 376 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/352 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-29 18:56:24] [INFO ] Deduced a trap composed of 174 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:56:27] [INFO ] Deduced a trap composed of 222 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-29 18:56:29] [INFO ] Deduced a trap composed of 169 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (OVERLAPS) 443/795 variables, 352/379 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 442/821 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/795 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 795/795 variables, and 821 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 23/23 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in LTL mode, iteration 1 : 352/427 places, 443/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60851 ms. Remains : 352/427 places, 443/518 transitions.
Support contains 21 out of 352 places after structural reductions.
[2024-05-29 18:56:51] [INFO ] Flatten gal took : 82 ms
[2024-05-29 18:56:51] [INFO ] Flatten gal took : 23 ms
[2024-05-29 18:56:51] [INFO ] Input system was already deterministic with 443 transitions.
RANDOM walk for 40000 steps (522 resets) in 1422 ms. (28 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40003 steps (160 resets) in 153 ms. (259 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (164 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (166 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (176 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
[2024-05-29 18:56:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 347/352 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 443/795 variables, 352/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/795 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/795 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 356 constraints, problems are : Problem set: 0 solved, 3 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 347/352 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 18:56:52] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:56:52] [INFO ] Deduced a trap composed of 165 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:56:53] [INFO ] Deduced a trap composed of 172 places in 101 ms of which 3 ms to minimize.
[2024-05-29 18:56:53] [INFO ] Deduced a trap composed of 168 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 443/795 variables, 352/360 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 2/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/795 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 362 constraints, problems are : Problem set: 1 solved, 2 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 952ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 4658 steps, including 69 resets, run visited all 1 properties in 9 ms. (steps per millisecond=517 )
Parikh walk visited 2 properties in 36 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 45 stabilizing places and 48 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' '!(G(F(p0)))'
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Graph (trivial) has 358 edges and 352 vertex of which 56 / 352 are part of one of the 9 SCC in 3 ms
Free SCC test removed 47 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 214 place count 304 transition count 177
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 219 rules applied. Total rules applied 433 place count 91 transition count 171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 436 place count 88 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 436 place count 88 transition count 160
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 458 place count 77 transition count 160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 462 place count 73 transition count 156
Iterating global reduction 3 with 4 rules applied. Total rules applied 466 place count 73 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 466 place count 73 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 468 place count 72 transition count 155
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 492 place count 60 transition count 143
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 503 place count 49 transition count 98
Iterating global reduction 3 with 11 rules applied. Total rules applied 514 place count 49 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 520 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 522 place count 47 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 524 place count 47 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 526 place count 45 transition count 84
Iterating global reduction 4 with 2 rules applied. Total rules applied 528 place count 45 transition count 84
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 548 place count 35 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 549 place count 34 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 34 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 34 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 555 place count 34 transition count 85
Applied a total of 555 rules in 50 ms. Remains 34 /352 variables (removed 318) and now considering 85/443 (removed 358) transitions.
[2024-05-29 18:56:53] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
// Phase 1: matrix 80 rows 34 cols
[2024-05-29 18:56:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:56:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 18:56:53] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
[2024-05-29 18:56:53] [INFO ] Invariant cache hit.
[2024-05-29 18:56:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 18:56:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 18:56:53] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-29 18:56:53] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
[2024-05-29 18:56:53] [INFO ] Invariant cache hit.
[2024-05-29 18:56:53] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 18:56:54] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:56:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:56:54] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:56:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 79/113 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 18:56:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/114 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 60 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 79/113 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 76/135 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 18:56:56] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 18:56:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 138 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2587 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 7/7 constraints]
After SMT, in 4191ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/352 places, 85/443 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4338 ms. Remains : 34/352 places, 85/443 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-00 finished in 4592 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(X(X(G(p0)))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 345 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 345 transition count 436
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 341 transition count 432
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 341 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 340 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 340 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 339 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 339 transition count 430
Applied a total of 26 rules in 46 ms. Remains 339 /352 variables (removed 13) and now considering 430/443 (removed 13) transitions.
// Phase 1: matrix 430 rows 339 cols
[2024-05-29 18:56:58] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 18:56:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 18:56:58] [INFO ] Invariant cache hit.
[2024-05-29 18:56:58] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-05-29 18:56:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:57:03] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 3 ms to minimize.
[2024-05-29 18:57:03] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:57:04] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:57:04] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:57:05] [INFO ] Deduced a trap composed of 169 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:57:05] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:57:05] [INFO ] Deduced a trap composed of 166 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:57:05] [INFO ] Deduced a trap composed of 168 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:57:05] [INFO ] Deduced a trap composed of 169 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:57:08] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:57:09] [INFO ] Deduced a trap composed of 167 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:57:14] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (OVERLAPS) 430/769 variables, 339/355 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:57:25] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:57:25] [INFO ] Deduced a trap composed of 167 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:57:25] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 429 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 Real declared 769/769 variables, and 358 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/769 variables, 339/358 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 429/787 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:57:40] [INFO ] Deduced a trap composed of 165 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 788 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 16/16 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 339/352 places, 430/443 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60393 ms. Remains : 339/352 places, 430/443 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-02 finished in 60558 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(p0)&&F(p1)))))'
Support contains 3 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 345 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 345 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 342 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 342 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 340 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 340 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 339 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 339 transition count 430
Applied a total of 26 rules in 28 ms. Remains 339 /352 variables (removed 13) and now considering 430/443 (removed 13) transitions.
// Phase 1: matrix 430 rows 339 cols
[2024-05-29 18:57:58] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 18:57:58] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 18:57:58] [INFO ] Invariant cache hit.
[2024-05-29 18:57:59] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-05-29 18:57:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:58:04] [INFO ] Deduced a trap composed of 165 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 167 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 167 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 166 places in 96 ms of which 3 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 163 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 166 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 167 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 167 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 165 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 430/769 variables, 339/357 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 166 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/769 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 358 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:58:31] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 430/769 variables, 339/359 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 429/788 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:58:39] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:58:42] [INFO ] Deduced a trap composed of 167 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 162 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:58:45] [INFO ] Deduced a trap composed of 168 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 792 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 20/20 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 339/352 places, 430/443 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 339/352 places, 430/443 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-07
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-07 finished in 60723 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 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Graph (trivial) has 357 edges and 352 vertex of which 57 / 352 are part of one of the 9 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 303 transition count 178
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 216 rules applied. Total rules applied 427 place count 93 transition count 172
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 431 place count 90 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 432 place count 89 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 432 place count 89 transition count 160
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 454 place count 78 transition count 160
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 457 place count 75 transition count 157
Iterating global reduction 4 with 3 rules applied. Total rules applied 460 place count 75 transition count 157
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 486 place count 62 transition count 144
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 498 place count 50 transition count 97
Iterating global reduction 4 with 12 rules applied. Total rules applied 510 place count 50 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 516 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 519 place count 47 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 522 place count 47 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 525 place count 44 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 528 place count 44 transition count 79
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 546 place count 35 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 547 place count 34 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 548 place count 34 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 549 place count 34 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 552 place count 34 transition count 83
Applied a total of 552 rules in 29 ms. Remains 34 /352 variables (removed 318) and now considering 83/443 (removed 360) transitions.
[2024-05-29 18:58:59] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 34 cols
[2024-05-29 18:58:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:58:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 18:58:59] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-29 18:58:59] [INFO ] Invariant cache hit.
[2024-05-29 18:58:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 18:58:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-29 18:58:59] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-29 18:58:59] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-29 18:58:59] [INFO ] Invariant cache hit.
[2024-05-29 18:58:59] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:58:59] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:58:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:58:59] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:58:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 79/113 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:59:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/114 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 57 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 79/113 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 74/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:59:01] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:59:02] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 133 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints]
After SMT, in 4184ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 4185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/352 places, 83/443 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4316 ms. Remains : 34/352 places, 83/443 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-09 finished in 4367 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(p1)&&G(p2)&&p0)))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 344 transition count 435
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 344 transition count 435
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 339 transition count 430
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 337 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 336 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 336 transition count 427
Applied a total of 32 rules in 26 ms. Remains 336 /352 variables (removed 16) and now considering 427/443 (removed 16) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-29 18:59:03] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 18:59:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 18:59:03] [INFO ] Invariant cache hit.
[2024-05-29 18:59:04] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-29 18:59:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:59:09] [INFO ] Deduced a trap composed of 162 places in 101 ms of which 3 ms to minimize.
[2024-05-29 18:59:09] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:59:09] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:59:10] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:59:10] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:59:10] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:59:10] [INFO ] Deduced a trap composed of 164 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:59:11] [INFO ] Deduced a trap composed of 166 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:59:11] [INFO ] Deduced a trap composed of 166 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:59:11] [INFO ] Deduced a trap composed of 166 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:59:11] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:59:11] [INFO ] Deduced a trap composed of 163 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:59:11] [INFO ] Deduced a trap composed of 163 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:59:12] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:59:12] [INFO ] Deduced a trap composed of 165 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:59:13] [INFO ] Deduced a trap composed of 163 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:59:14] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:59:14] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (OVERLAPS) 0/763 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 358 constraints, problems are : Problem set: 0 solved, 426 unsolved in 29752 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/763 variables, 336/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 426/784 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:59:43] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:59:43] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 2/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:59:51] [INFO ] Deduced a trap composed of 165 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 787 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 21/21 constraints]
After SMT, in 59839ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 59843ms
Starting structural reductions in LTL mode, iteration 1 : 336/352 places, 427/443 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60122 ms. Remains : 336/352 places, 427/443 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-10 finished in 60339 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(p0)||X(X(F(p1))))))'
Support contains 3 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 345 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 345 transition count 436
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 341 transition count 432
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 341 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 340 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 340 transition count 431
Applied a total of 24 rules in 16 ms. Remains 340 /352 variables (removed 12) and now considering 431/443 (removed 12) transitions.
// Phase 1: matrix 431 rows 340 cols
[2024-05-29 19:00:04] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 19:00:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 19:00:04] [INFO ] Invariant cache hit.
[2024-05-29 19:00:04] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-29 19:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 19:00:09] [INFO ] Deduced a trap composed of 165 places in 98 ms of which 2 ms to minimize.
[2024-05-29 19:00:09] [INFO ] Deduced a trap composed of 163 places in 91 ms of which 2 ms to minimize.
[2024-05-29 19:00:10] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:00:10] [INFO ] Deduced a trap composed of 166 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:00:10] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:00:10] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:00:11] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:00:11] [INFO ] Deduced a trap composed of 166 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:00:11] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:00:11] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:00:12] [INFO ] Deduced a trap composed of 164 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 168 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 220 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 19:00:19] [INFO ] Deduced a trap composed of 166 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:00:20] [INFO ] Deduced a trap composed of 166 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:00:20] [INFO ] Deduced a trap composed of 168 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 19:00:22] [INFO ] Deduced a trap composed of 168 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:00:22] [INFO ] Deduced a trap composed of 162 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:00:23] [INFO ] Deduced a trap composed of 164 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:00:23] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 431/771 variables, 340/365 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 19:00:34] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 2 ms to minimize.
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 Real declared 771/771 variables, and 366 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 19:00:37] [INFO ] Deduced a trap composed of 169 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 431/771 variables, 340/367 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 430/797 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 797 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 23/23 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 340/352 places, 431/443 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60367 ms. Remains : 340/352 places, 431/443 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-11
Stuttering criterion allowed to conclude after 820 steps with 14 reset in 7 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-11 finished in 60609 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(X((X(F(p0))||G(p1)))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 443/443 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 343 transition count 434
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 343 transition count 434
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 335 transition count 426
Applied a total of 34 rules in 19 ms. Remains 335 /352 variables (removed 17) and now considering 426/443 (removed 17) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 19:01:04] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 19:01:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 19:01:04] [INFO ] Invariant cache hit.
[2024-05-29 19:01:05] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 19:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:10] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 2 ms to minimize.
[2024-05-29 19:01:10] [INFO ] Deduced a trap composed of 163 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:01:10] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-05-29 19:01:11] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:01:11] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:01:11] [INFO ] Deduced a trap composed of 165 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:01:12] [INFO ] Deduced a trap composed of 165 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:01:12] [INFO ] Deduced a trap composed of 200 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:01:12] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:01:12] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:13] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:01:14] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:01:14] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:19] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:01:19] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:32] [INFO ] Deduced a trap composed of 165 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:01:33] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:39] [INFO ] Deduced a trap composed of 164 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 19:01:46] [INFO ] Deduced a trap composed of 162 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 335/352 places, 426/443 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60350 ms. Remains : 335/352 places, 426/443 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-15
Product exploration explored 100000 steps with 1663 reset in 164 ms.
Product exploration explored 100000 steps with 1750 reset in 138 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (697 resets) in 148 ms. (268 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (161 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
[2024-05-29 19:02:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 212/335 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/761 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 123/761 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/335 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLCardinality-15 finished in 61501 ms.
All properties solved by simple procedures.
Total runtime 375994 ms.
ITS solved all properties within timeout

BK_STOP 1717009326310

--------------------
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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-03b"
export BK_EXAMINATION="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-03b, 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-171690530000275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "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 ;