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.r400-tall-171690532000276.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 itstools
Input is StigmergyElection-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532000276
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717006809201

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 18:20:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:20:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:20:10] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-29 18:20:10] [INFO ] Transformed 427 places.
[2024-05-29 18:20:10] [INFO ] Transformed 518 transitions.
[2024-05-29 18:20:10] [INFO ] Found NUPN structural information;
[2024-05-29 18:20:10] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA StigmergyElection-PT-03b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 377 transition count 468
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 377 transition count 468
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 125 place count 352 transition count 443
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 352 transition count 443
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 156 place count 346 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 346 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 165 place count 343 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 168 place count 343 transition count 434
Applied a total of 168 rules in 107 ms. Remains 343 /427 variables (removed 84) and now considering 434/518 (removed 84) transitions.
// Phase 1: matrix 434 rows 343 cols
[2024-05-29 18:20:10] [INFO ] Computed 4 invariants in 26 ms
[2024-05-29 18:20:11] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-29 18:20:11] [INFO ] Invariant cache hit.
[2024-05-29 18:20:11] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-29 18:20:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-29 18:20:17] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 24 ms to minimize.
[2024-05-29 18:20:17] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:20:17] [INFO ] Deduced a trap composed of 167 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:20:17] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:20:17] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:20:18] [INFO ] Deduced a trap composed of 165 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:20:19] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:20:19] [INFO ] Deduced a trap composed of 167 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:20:19] [INFO ] Deduced a trap composed of 169 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:20:19] [INFO ] Deduced a trap composed of 168 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:20:19] [INFO ] Deduced a trap composed of 169 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:20:20] [INFO ] Deduced a trap composed of 165 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:20:20] [INFO ] Deduced a trap composed of 167 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:20:20] [INFO ] Deduced a trap composed of 167 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-29 18:20:21] [INFO ] Deduced a trap composed of 168 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/362 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-29 18:20:33] [INFO ] Deduced a trap composed of 166 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 363 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-29 18:20:44] [INFO ] Deduced a trap composed of 166 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:20:44] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:20:45] [INFO ] Deduced a trap composed of 166 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/366 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 433/799 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 168 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-29 18:21:01] [INFO ] Deduced a trap composed of 167 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 801 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 21/21 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 343/427 places, 434/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60832 ms. Remains : 343/427 places, 434/518 transitions.
Support contains 28 out of 343 places after structural reductions.
[2024-05-29 18:21:11] [INFO ] Flatten gal took : 53 ms
[2024-05-29 18:21:11] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:21:11] [INFO ] Input system was already deterministic with 434 transitions.
RANDOM walk for 40000 steps (688 resets) in 1461 ms. (27 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (168 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (160 resets) in 69 ms. (571 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (169 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (146 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (167 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
[2024-05-29 18:21:12] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 322/329 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/343 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/347 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/777 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 347 constraints, problems are : Problem set: 2 solved, 2 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 325/329 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/343 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/347 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 2/349 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/349 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/777 variables, 0/349 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 349 constraints, problems are : Problem set: 2 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 4278 steps, including 54 resets, run visited all 2 properties in 12 ms. (steps per millisecond=356 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 16 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA StigmergyElection-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X((F(G(p0))&&(p1 U (p2||G(p1)))))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 337 transition count 428
Applied a total of 12 rules in 19 ms. Remains 337 /343 variables (removed 6) and now considering 428/434 (removed 6) transitions.
// Phase 1: matrix 428 rows 337 cols
[2024-05-29 18:21:13] [INFO ] Computed 4 invariants in 8 ms
[2024-05-29 18:21:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 18:21:13] [INFO ] Invariant cache hit.
[2024-05-29 18:21:13] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-29 18:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:21:18] [INFO ] Deduced a trap composed of 162 places in 95 ms of which 3 ms to minimize.
[2024-05-29 18:21:18] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:21:18] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:21:18] [INFO ] Deduced a trap composed of 166 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:21:19] [INFO ] Deduced a trap composed of 162 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:21:19] [INFO ] Deduced a trap composed of 164 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:21:19] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:21:19] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:21:20] [INFO ] Deduced a trap composed of 165 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:21:20] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:21:20] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:21:21] [INFO ] Deduced a trap composed of 165 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:21:21] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:21:21] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 4 ms to minimize.
[2024-05-29 18:21:22] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:21:23] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:21:23] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:21:24] [INFO ] Deduced a trap composed of 166 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:21:34] [INFO ] Deduced a trap composed of 165 places in 76 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 427 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 765/765 variables, and 360 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:21:47] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/361 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 427/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 788 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 20/20 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 337/343 places, 428/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60368 ms. Remains : 337/343 places, 428/434 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-01
Product exploration explored 100000 steps with 1181 reset in 182 ms.
Product exploration explored 100000 steps with 1569 reset in 142 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 p2 p1 p0), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 31181 steps (388 resets) in 115 ms. (268 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 428/428 transitions.
Graph (trivial) has 341 edges and 337 vertex of which 51 / 337 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 294 transition count 181
Reduce places removed 198 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 204 rules applied. Total rules applied 403 place count 96 transition count 175
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 407 place count 93 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 408 place count 92 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 408 place count 92 transition count 161
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 434 place count 79 transition count 161
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 436 place count 77 transition count 159
Iterating global reduction 4 with 2 rules applied. Total rules applied 438 place count 77 transition count 159
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 466 place count 63 transition count 145
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 478 place count 51 transition count 98
Iterating global reduction 4 with 12 rules applied. Total rules applied 490 place count 51 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 496 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 498 place count 49 transition count 88
Iterating global reduction 5 with 2 rules applied. Total rules applied 500 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 502 place count 47 transition count 84
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 47 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 5 with 20 rules applied. Total rules applied 524 place count 37 transition count 98
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 525 place count 36 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 526 place count 36 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 527 place count 36 transition count 89
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 530 place count 36 transition count 86
Applied a total of 530 rules in 45 ms. Remains 36 /337 variables (removed 301) and now considering 86/428 (removed 342) transitions.
[2024-05-29 18:22:14] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 36 cols
[2024-05-29 18:22:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:22:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:22:14] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-29 18:22:14] [INFO ] Invariant cache hit.
[2024-05-29 18:22:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 18:22:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 18:22:14] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-29 18:22:14] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-29 18:22:14] [INFO ] Invariant cache hit.
[2024-05-29 18:22:14] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 18:22:15] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:22:15] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:22:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:22:15] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 18:22:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:22:15] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 81/117 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 63 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/117 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 77/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 18:22:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/118 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 7/7 constraints]
After SMT, in 3827ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/337 places, 86/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3958 ms. Remains : 36/337 places, 86/428 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 3427 steps (507 resets) in 49 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 125 ms.
Product exploration explored 100000 steps with 46 reset in 85 ms.
Built C files in :
/tmp/ltsmin14955076555357099860
[2024-05-29 18:22:19] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2024-05-29 18:22:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:22:19] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2024-05-29 18:22:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:22:19] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2024-05-29 18:22:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:22:19] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14955076555357099860
Running compilation step : cd /tmp/ltsmin14955076555357099860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin14955076555357099860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14955076555357099860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3165608483736494360.hoa' '--buchi-type=spotba'
LTSmin run took 226 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-03b-LTLFireability-01 finished in 66922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 343 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 298 transition count 183
Reduce places removed 200 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 206 rules applied. Total rules applied 407 place count 98 transition count 177
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 416 place count 95 transition count 171
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 422 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 422 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 444 place count 78 transition count 160
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 447 place count 75 transition count 157
Iterating global reduction 4 with 3 rules applied. Total rules applied 450 place count 75 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 450 place count 75 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 452 place count 74 transition count 156
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 480 place count 60 transition count 142
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 492 place count 48 transition count 95
Iterating global reduction 4 with 12 rules applied. Total rules applied 504 place count 48 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 510 place count 48 transition count 89
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 513 place count 45 transition count 83
Iterating global reduction 5 with 3 rules applied. Total rules applied 516 place count 45 transition count 83
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 519 place count 42 transition count 77
Iterating global reduction 5 with 3 rules applied. Total rules applied 522 place count 42 transition count 77
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 540 place count 33 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 541 place count 32 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 542 place count 32 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 543 place count 32 transition count 84
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 546 place count 32 transition count 81
Applied a total of 546 rules in 31 ms. Remains 32 /343 variables (removed 311) and now considering 81/434 (removed 353) transitions.
[2024-05-29 18:22:20] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 32 cols
[2024-05-29 18:22:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:22:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:22:20] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-29 18:22:20] [INFO ] Invariant cache hit.
[2024-05-29 18:22:20] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 18:22:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 18:22:20] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 18:22:20] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-29 18:22:20] [INFO ] Invariant cache hit.
[2024-05-29 18:22:20] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 77/109 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 54 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 77/109 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 72/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:22:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:22:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/110 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 128 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints]
After SMT, in 3924ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3925ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/343 places, 81/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4042 ms. Remains : 32/343 places, 81/434 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-02
Stuttering criterion allowed to conclude after 22 steps with 4 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-02 finished in 4101 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)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 335 transition count 426
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 20 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:22:24] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 18:22:24] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 18:22:24] [INFO ] Invariant cache hit.
[2024-05-29 18:22:24] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:22:24] [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 18:22:29] [INFO ] Deduced a trap composed of 164 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:22:29] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 3 ms to minimize.
[2024-05-29 18:22:29] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 200 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 163 places in 76 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 18:22:33] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:22:33] [INFO ] Deduced a trap composed of 163 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:22:33] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 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 18:22:39] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:22:39] [INFO ] Deduced a trap composed of 163 places in 81 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 18:22:41] [INFO ] Deduced a trap composed of 163 places in 78 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 18:22:52] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 163 places in 75 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
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 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 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 18:22:58] [INFO ] Deduced a trap composed of 164 places in 82 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 18:23:05] [INFO ] Deduced a trap composed of 162 places in 77 ms of which 1 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 30015 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 60088ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60368 ms. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-07 finished in 60478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 345 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 298 transition count 185
Reduce places removed 198 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 204 rules applied. Total rules applied 403 place count 100 transition count 179
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 408 place count 97 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 410 place count 95 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 410 place count 95 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 434 place count 83 transition count 165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 437 place count 80 transition count 162
Iterating global reduction 4 with 3 rules applied. Total rules applied 440 place count 80 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 440 place count 80 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 470 place count 65 transition count 147
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 482 place count 53 transition count 100
Iterating global reduction 4 with 12 rules applied. Total rules applied 494 place count 53 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 499 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 501 place count 51 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 503 place count 51 transition count 91
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 505 place count 49 transition count 87
Iterating global reduction 5 with 2 rules applied. Total rules applied 507 place count 49 transition count 87
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 5 with 20 rules applied. Total rules applied 527 place count 39 transition count 101
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 528 place count 38 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 529 place count 38 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 38 transition count 92
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 533 place count 38 transition count 89
Applied a total of 533 rules in 30 ms. Remains 38 /343 variables (removed 305) and now considering 89/434 (removed 345) transitions.
[2024-05-29 18:23:24] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 38 cols
[2024-05-29 18:23:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:23:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:23:24] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-05-29 18:23:24] [INFO ] Invariant cache hit.
[2024-05-29 18:23:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 18:23:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-29 18:23:24] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-29 18:23:24] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-05-29 18:23:24] [INFO ] Invariant cache hit.
[2024-05-29 18:23:24] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-29 18:23:24] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:23:24] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:23:25] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:23:25] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:23:25] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-29 18:23:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 84/122 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-29 18:23:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 66 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2001 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/122 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-29 18:23:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 147 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2445 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
After SMT, in 4474ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4475ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/343 places, 89/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4589 ms. Remains : 38/343 places, 89/434 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-08 finished in 4798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 349 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 298 transition count 180
Reduce places removed 203 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 209 rules applied. Total rules applied 413 place count 95 transition count 174
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 417 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 91 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 418 place count 91 transition count 161
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 442 place count 79 transition count 161
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 445 place count 76 transition count 158
Iterating global reduction 4 with 3 rules applied. Total rules applied 448 place count 76 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 448 place count 76 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 450 place count 75 transition count 157
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 478 place count 61 transition count 143
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 490 place count 49 transition count 96
Iterating global reduction 4 with 12 rules applied. Total rules applied 502 place count 49 transition count 96
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 507 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 510 place count 46 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 513 place count 46 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 516 place count 43 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 519 place count 43 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 537 place count 34 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 538 place count 33 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 539 place count 33 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 540 place count 33 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 543 place count 33 transition count 83
Applied a total of 543 rules in 35 ms. Remains 33 /343 variables (removed 310) and now considering 83/434 (removed 351) transitions.
[2024-05-29 18:23:29] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 33 cols
[2024-05-29 18:23:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:23:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 18:23:29] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-05-29 18:23:29] [INFO ] Invariant cache hit.
[2024-05-29 18:23:29] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 18:23:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-29 18:23:29] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-29 18:23:29] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-05-29 18:23:29] [INFO ] Invariant cache hit.
[2024-05-29 18:23:29] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:23:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:23:29] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 78/111 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/112 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 56 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:23:30] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 78/111 variables, 33/38 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 74/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/112 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:23:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 18:23:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 0/112 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 133 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints]
After SMT, in 3738ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3738ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/343 places, 83/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3850 ms. Remains : 33/343 places, 83/434 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-09 finished in 3950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 335 transition count 426
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 14 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:23:33] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 18:23:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 18:23:33] [INFO ] Invariant cache hit.
[2024-05-29 18:23:33] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:23:33] [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 18:23:38] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 3 ms to minimize.
[2024-05-29 18:23:38] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:23:38] [INFO ] Deduced a trap composed of 164 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:23:39] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:23:40] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:23:40] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:23:40] [INFO ] Deduced a trap composed of 165 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:23:40] [INFO ] Deduced a trap composed of 200 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:23:40] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:23:41] [INFO ] Deduced a trap composed of 163 places in 76 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 18:23:42] [INFO ] Deduced a trap composed of 163 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:23:42] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:23:42] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 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 18:23:48] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:23:48] [INFO ] Deduced a trap composed of 163 places in 74 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 18:23:50] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 2 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 18:24:01] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:24:02] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 1 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 30016 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 18:24:08] [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 18:24:14] [INFO ] Deduced a trap composed of 162 places in 78 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 30016 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 60089ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60356 ms. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 179 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 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-11 finished in 60887 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)) U (!p1 U p2)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 340 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 340 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 338 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 338 transition count 429
Applied a total of 10 rules in 16 ms. Remains 338 /343 variables (removed 5) and now considering 429/434 (removed 5) transitions.
// Phase 1: matrix 429 rows 338 cols
[2024-05-29 18:24:34] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 18:24:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 18:24:34] [INFO ] Invariant cache hit.
[2024-05-29 18:24:34] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-05-29 18:24:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:24:39] [INFO ] Deduced a trap composed of 164 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 166 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 166 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 166 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 164 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 167 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 166 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:24:43] [INFO ] Deduced a trap composed of 162 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:24:44] [INFO ] Deduced a trap composed of 166 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 166 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:24:50] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:24:54] [INFO ] Deduced a trap composed of 167 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (OVERLAPS) 429/767 variables, 338/361 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/767 variables, and 361 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:25:07] [INFO ] Deduced a trap composed of 164 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 429/767 variables, 338/362 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 428/790 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/767 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/767 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 790 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 20/20 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 338/343 places, 429/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 338/343 places, 429/434 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-13
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-13 finished in 60573 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)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 335 transition count 426
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 14 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:25:34] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 18:25:34] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 18:25:34] [INFO ] Invariant cache hit.
[2024-05-29 18:25:35] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:25:35] [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 18:25:40] [INFO ] Deduced a trap composed of 164 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:25:40] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:25:40] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:25:41] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 164 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 200 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 165 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 1 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 18:25:44] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 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 18:25:50] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 1 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 18:25:52] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 2 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 18:26:03] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:26:03] [INFO ] Deduced a trap composed of 163 places in 78 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
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 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 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 18:26:09] [INFO ] Deduced a trap composed of 164 places in 79 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 18:26:15] [INFO ] Deduced a trap composed of 162 places in 82 ms of which 1 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 30014 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 60086ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60359 ms. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-14 finished in 60478 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((X(F(p0))||F(p1))))))'
Support contains 6 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 336 transition count 427
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 336 transition count 427
Applied a total of 14 rules in 9 ms. Remains 336 /343 variables (removed 7) and now considering 427/434 (removed 7) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-29 18:26:35] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 18:26:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 18:26:35] [INFO ] Invariant cache hit.
[2024-05-29 18:26:35] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-29 18:26:35] [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:26:40] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:26:40] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:26:40] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:26:41] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:26:42] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:26:42] [INFO ] Deduced a trap composed of 165 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:26:42] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:26:42] [INFO ] Deduced a trap composed of 166 places in 87 ms of which 1 ms to minimize.
[2024-05-29 18:26:42] [INFO ] Deduced a trap composed of 165 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:26:42] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:26:43] [INFO ] Deduced a trap composed of 194 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:26:43] [INFO ] Deduced a trap composed of 165 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:26:43] [INFO ] Deduced a trap composed of 175 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:26:43] [INFO ] Deduced a trap composed of 163 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:26:44] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:26:45] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/356 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:26:55] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:27:04] [INFO ] Deduced a trap composed of 162 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 426 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 763/763 variables, and 358 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30015 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
[2024-05-29 18:27:09] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/359 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 426/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 785 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 19/19 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 427/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60345 ms. Remains : 336/343 places, 427/434 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (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-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Product exploration explored 100000 steps with 25000 reset in 96 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 p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (673 resets) in 94 ms. (421 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (152 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (151 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
[2024-05-29 18:27:36] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 330/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/763 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 330/336 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/763 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 341 constraints, problems are : Problem set: 1 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-15 finished in 61519 ms.
All properties solved by simple procedures.
Total runtime 446547 ms.

BK_STOP 1717007256857

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532000276"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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