MCC'2024- Execution of r536-tall-171690531900235

About the Execution of LTSMin+red for StigmergyCommit-PT-11a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
6468.163	3600000.00	10005679.00	10836.80	FFTFFTTTFFFTF?FF	normal

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.r536-tall-171690531900235.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 ltsminxred
Input is StigmergyCommit-PT-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531900235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 464M 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 StigmergyCommit-PT-11a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242982384

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:56:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:56:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:56:39] [INFO ] Load time of PNML (sax parser for PT used): 15756 ms
[2024-06-01 11:56:40] [INFO ] Transformed 436 places.
[2024-06-01 11:56:41] [INFO ] Transformed 373236 transitions.
[2024-06-01 11:56:41] [INFO ] Found NUPN structural information;
[2024-06-01 11:56:41] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 17908 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 345 transition count 8655
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 345 transition count 8655
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 193 place count 345 transition count 8644
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 237 place count 301 transition count 8589
Iterating global reduction 1 with 44 rules applied. Total rules applied 281 place count 301 transition count 8589
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 292 place count 301 transition count 8578
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 299 place count 294 transition count 8571
Iterating global reduction 2 with 7 rules applied. Total rules applied 306 place count 294 transition count 8571
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 312 place count 288 transition count 8565
Iterating global reduction 2 with 6 rules applied. Total rules applied 318 place count 288 transition count 8565
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 323 place count 283 transition count 8560
Iterating global reduction 2 with 5 rules applied. Total rules applied 328 place count 283 transition count 8560
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 332 place count 279 transition count 8556
Iterating global reduction 2 with 4 rules applied. Total rules applied 336 place count 279 transition count 8556
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 340 place count 279 transition count 8552
Applied a total of 340 rules in 371 ms. Remains 279 /436 variables (removed 157) and now considering 8552/8758 (removed 206) transitions.
[2024-06-01 11:56:44] [INFO ] Flow matrix only has 8538 transitions (discarded 14 similar events)
// Phase 1: matrix 8538 rows 279 cols
[2024-06-01 11:56:44] [INFO ] Computed 3 invariants in 118 ms
[2024-06-01 11:56:47] [INFO ] Implicit Places using invariants in 2940 ms returned []
[2024-06-01 11:56:47] [INFO ] Flow matrix only has 8538 transitions (discarded 14 similar events)
[2024-06-01 11:56:47] [INFO ] Invariant cache hit.
[2024-06-01 11:56:50] [INFO ] State equation strengthened by 8315 read => feed constraints.
[2024-06-01 11:56:59] [INFO ] Implicit Places using invariants and state equation in 12788 ms returned [278]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 15780 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 278/436 places, 8552/8758 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 246 transition count 8520
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 246 transition count 8520
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 246 transition count 8508
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 86 place count 236 transition count 8498
Iterating global reduction 1 with 10 rules applied. Total rules applied 96 place count 236 transition count 8498
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 226 transition count 8488
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 226 transition count 8488
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 126 place count 216 transition count 8478
Iterating global reduction 1 with 10 rules applied. Total rules applied 136 place count 216 transition count 8478
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 145 place count 207 transition count 8469
Iterating global reduction 1 with 9 rules applied. Total rules applied 154 place count 207 transition count 8469
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 162 place count 199 transition count 8461
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 199 transition count 8461
Applied a total of 170 rules in 282 ms. Remains 199 /278 variables (removed 79) and now considering 8461/8552 (removed 91) transitions.
[2024-06-01 11:57:00] [INFO ] Flow matrix only has 8447 transitions (discarded 14 similar events)
// Phase 1: matrix 8447 rows 199 cols
[2024-06-01 11:57:00] [INFO ] Computed 2 invariants in 55 ms
[2024-06-01 11:57:02] [INFO ] Implicit Places using invariants in 2518 ms returned []
[2024-06-01 11:57:02] [INFO ] Flow matrix only has 8447 transitions (discarded 14 similar events)
[2024-06-01 11:57:02] [INFO ] Invariant cache hit.
[2024-06-01 11:57:05] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 11:57:09] [INFO ] Implicit Places using invariants and state equation in 6334 ms returned []
Implicit Place search using SMT with State Equation took 8871 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 199/436 places, 8461/8758 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25325 ms. Remains : 199/436 places, 8461/8758 transitions.
Support contains 23 out of 199 places after structural reductions.
[2024-06-01 11:57:10] [INFO ] Flatten gal took : 952 ms
[2024-06-01 11:57:11] [INFO ] Flatten gal took : 657 ms
[2024-06-01 11:57:12] [INFO ] Input system was already deterministic with 8461 transitions.
Support contains 22 out of 199 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 39188 ms. (1 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 4/4 properties
[2024-06-01 11:57:22] [INFO ] Flow matrix only has 8447 transitions (discarded 14 similar events)
[2024-06-01 11:57:22] [INFO ] Invariant cache hit.
[2024-06-01 11:57:24] [INFO ] State equation strengthened by 8201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/199 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8446/8645 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8645 variables, 8200/8401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8645 variables, 0/8401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/8646 variables, 1/8402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8646 variables, 0/8402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/8646 variables, 0/8402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8646/8646 variables, and 8402 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, ReadFeed: 8201/8201 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:57:31] [INFO ] Deduced a trap composed of 13 places in 2865 ms of which 25 ms to minimize.
[2024-06-01 11:57:34] [INFO ] Deduced a trap composed of 17 places in 3004 ms of which 3 ms to minimize.
SMT process timed out in 11945ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Graph (complete) has 687 edges and 199 vertex of which 197 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.55 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 197 transition count 8359
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 100 rules applied. Total rules applied 201 place count 122 transition count 8334
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 214 place count 111 transition count 8332
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 218 place count 110 transition count 8329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 107 transition count 8329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 221 place count 107 transition count 8326
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 227 place count 104 transition count 8326
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 240 place count 91 transition count 8312
Iterating global reduction 5 with 13 rules applied. Total rules applied 253 place count 91 transition count 8312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 91 transition count 8311
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 264 place count 81 transition count 8301
Iterating global reduction 6 with 10 rules applied. Total rules applied 274 place count 81 transition count 8301
Performed 49 Post agglomeration using F-continuation condition with reduction of 8145 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 374 place count 30 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 6 with 76 rules applied. Total rules applied 450 place count 30 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 453 place count 28 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 455 place count 28 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 456 place count 28 transition count 27
Applied a total of 456 rules in 964 ms. Remains 28 /199 variables (removed 171) and now considering 27/8461 (removed 8434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 28/199 places, 27/8461 transitions.
RANDOM walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
// Phase 1: matrix 27 rows 28 cols
[2024-06-01 11:57:36] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 11:57:36] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/28 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/55 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 0 solved, 2 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, ReadFeed: 8/8 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 21/55 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, State Equation: 0/28 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 186ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 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(F(p0)))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 183 transition count 8444
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 183 transition count 8444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 183 transition count 8442
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 171 transition count 8430
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 171 transition count 8430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 171 transition count 8428
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 163 transition count 8420
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 163 transition count 8420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 163 transition count 8419
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 84 place count 156 transition count 8412
Iterating global reduction 3 with 7 rules applied. Total rules applied 91 place count 156 transition count 8412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 156 transition count 8410
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 98 place count 151 transition count 8405
Iterating global reduction 4 with 5 rules applied. Total rules applied 103 place count 151 transition count 8405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 151 transition count 8404
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 107 place count 148 transition count 8401
Iterating global reduction 5 with 3 rules applied. Total rules applied 110 place count 148 transition count 8401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 148 transition count 8399
Applied a total of 112 rules in 269 ms. Remains 148 /199 variables (removed 51) and now considering 8399/8461 (removed 62) transitions.
[2024-06-01 11:57:36] [INFO ] Flow matrix only has 8386 transitions (discarded 13 similar events)
// Phase 1: matrix 8386 rows 148 cols
[2024-06-01 11:57:36] [INFO ] Computed 1 invariants in 32 ms
[2024-06-01 11:57:39] [INFO ] Implicit Places using invariants in 2567 ms returned []
[2024-06-01 11:57:39] [INFO ] Flow matrix only has 8386 transitions (discarded 13 similar events)
[2024-06-01 11:57:39] [INFO ] Invariant cache hit.
[2024-06-01 11:57:42] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 11:57:45] [INFO ] Implicit Places using invariants and state equation in 6465 ms returned []
Implicit Place search using SMT with State Equation took 9037 ms to find 0 implicit places.
Running 8398 sub problems to find dead transitions.
[2024-06-01 11:57:46] [INFO ] Flow matrix only has 8386 transitions (discarded 13 similar events)
[2024-06-01 11:57:46] [INFO ] Invariant cache hit.
[2024-06-01 11:57:47] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 147/8534 variables, and 0 constraints, problems are : Problem set: 0 solved, 8398 unsolved in 30243 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/148 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8398/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8398 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 147/8534 variables, and 0 constraints, problems are : Problem set: 0 solved, 8398 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/148 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 206878ms problems are : Problem set: 0 solved, 8398 unsolved
Search for dead transitions found 0 dead transitions in 207031ms
Starting structural reductions in LTL mode, iteration 1 : 148/199 places, 8399/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216398 ms. Remains : 148/199 places, 8399/8461 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Product exploration explored 100000 steps with 50000 reset in 521 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-11a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-02 finished in 217988 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(p0)||G(p1))))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 8446
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 8446
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 185 transition count 8444
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 175 transition count 8434
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 175 transition count 8434
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 167 transition count 8426
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 167 transition count 8426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 167 transition count 8425
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 160 transition count 8418
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 160 transition count 8418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 160 transition count 8416
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 155 transition count 8411
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 155 transition count 8411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 155 transition count 8410
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 97 place count 152 transition count 8407
Iterating global reduction 4 with 3 rules applied. Total rules applied 100 place count 152 transition count 8407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 152 transition count 8405
Applied a total of 102 rules in 332 ms. Remains 152 /199 variables (removed 47) and now considering 8405/8461 (removed 56) transitions.
[2024-06-01 12:01:14] [INFO ] Flow matrix only has 8392 transitions (discarded 13 similar events)
// Phase 1: matrix 8392 rows 152 cols
[2024-06-01 12:01:14] [INFO ] Computed 1 invariants in 99 ms
[2024-06-01 12:01:17] [INFO ] Implicit Places using invariants in 2716 ms returned []
[2024-06-01 12:01:17] [INFO ] Flow matrix only has 8392 transitions (discarded 13 similar events)
[2024-06-01 12:01:17] [INFO ] Invariant cache hit.
[2024-06-01 12:01:20] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 12:01:23] [INFO ] Implicit Places using invariants and state equation in 6151 ms returned []
Implicit Place search using SMT with State Equation took 8880 ms to find 0 implicit places.
Running 8404 sub problems to find dead transitions.
[2024-06-01 12:01:23] [INFO ] Flow matrix only has 8392 transitions (discarded 13 similar events)
[2024-06-01 12:01:23] [INFO ] Invariant cache hit.
[2024-06-01 12:01:24] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 151/8544 variables, and 0 constraints, problems are : Problem set: 0 solved, 8404 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/152 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8404/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 151/8544 variables, and 0 constraints, problems are : Problem set: 0 solved, 8404 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/152 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 198484ms problems are : Problem set: 0 solved, 8404 unsolved
Search for dead transitions found 0 dead transitions in 198586ms
Starting structural reductions in LTL mode, iteration 1 : 152/199 places, 8405/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207868 ms. Remains : 152/199 places, 8405/8461 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-04
Product exploration timeout after 12780 steps with 0 reset in 10001 ms.
Product exploration timeout after 12640 steps with 0 reset in 10013 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (9 resets) in 41370 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8955 steps, run visited all 1 properties in 97 ms. (steps per millisecond=92 )
Probabilistic random walk after 8955 steps, saw 8759 distinct states, run finished after 101 ms. (steps per millisecond=88 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-11a-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-04 finished in 239947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 8446
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 8446
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 185 transition count 8444
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 175 transition count 8434
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 175 transition count 8434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 175 transition count 8432
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 169 transition count 8426
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 169 transition count 8426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 169 transition count 8425
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 70 place count 164 transition count 8420
Iterating global reduction 3 with 5 rules applied. Total rules applied 75 place count 164 transition count 8420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 164 transition count 8418
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 79 place count 162 transition count 8416
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 162 transition count 8416
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 160 transition count 8414
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 160 transition count 8414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 160 transition count 8413
Applied a total of 86 rules in 247 ms. Remains 160 /199 variables (removed 39) and now considering 8413/8461 (removed 48) transitions.
[2024-06-01 12:05:14] [INFO ] Flow matrix only has 8400 transitions (discarded 13 similar events)
// Phase 1: matrix 8400 rows 160 cols
[2024-06-01 12:05:14] [INFO ] Computed 1 invariants in 43 ms
[2024-06-01 12:05:17] [INFO ] Implicit Places using invariants in 2418 ms returned []
[2024-06-01 12:05:17] [INFO ] Flow matrix only has 8400 transitions (discarded 13 similar events)
[2024-06-01 12:05:17] [INFO ] Invariant cache hit.
[2024-06-01 12:05:19] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 12:05:23] [INFO ] Implicit Places using invariants and state equation in 6085 ms returned []
Implicit Place search using SMT with State Equation took 8508 ms to find 0 implicit places.
Running 8412 sub problems to find dead transitions.
[2024-06-01 12:05:23] [INFO ] Flow matrix only has 8400 transitions (discarded 13 similar events)
[2024-06-01 12:05:23] [INFO ] Invariant cache hit.
[2024-06-01 12:05:24] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/8560 variables, and 0 constraints, problems are : Problem set: 0 solved, 8412 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/160 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8412/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 159/8560 variables, and 0 constraints, problems are : Problem set: 0 solved, 8412 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/160 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 216007ms problems are : Problem set: 0 solved, 8412 unsolved
Search for dead transitions found 0 dead transitions in 216099ms
Starting structural reductions in LTL mode, iteration 1 : 160/199 places, 8413/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224954 ms. Remains : 160/199 places, 8413/8461 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 480 ms.
Product exploration explored 100000 steps with 33333 reset in 424 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-11a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-06 finished in 226227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 184 transition count 8445
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 184 transition count 8445
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 184 transition count 8443
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 172 transition count 8431
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 172 transition count 8431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 172 transition count 8429
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 164 transition count 8421
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 164 transition count 8421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 164 transition count 8420
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 82 place count 157 transition count 8413
Iterating global reduction 3 with 7 rules applied. Total rules applied 89 place count 157 transition count 8413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 157 transition count 8411
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 96 place count 152 transition count 8406
Iterating global reduction 4 with 5 rules applied. Total rules applied 101 place count 152 transition count 8406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 152 transition count 8405
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 105 place count 149 transition count 8402
Iterating global reduction 5 with 3 rules applied. Total rules applied 108 place count 149 transition count 8402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 149 transition count 8400
Applied a total of 110 rules in 250 ms. Remains 149 /199 variables (removed 50) and now considering 8400/8461 (removed 61) transitions.
[2024-06-01 12:09:00] [INFO ] Flow matrix only has 8387 transitions (discarded 13 similar events)
// Phase 1: matrix 8387 rows 149 cols
[2024-06-01 12:09:00] [INFO ] Computed 1 invariants in 27 ms
[2024-06-01 12:09:03] [INFO ] Implicit Places using invariants in 2725 ms returned []
[2024-06-01 12:09:03] [INFO ] Flow matrix only has 8387 transitions (discarded 13 similar events)
[2024-06-01 12:09:03] [INFO ] Invariant cache hit.
[2024-06-01 12:09:06] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 12:09:10] [INFO ] Implicit Places using invariants and state equation in 6379 ms returned []
Implicit Place search using SMT with State Equation took 9110 ms to find 0 implicit places.
Running 8399 sub problems to find dead transitions.
[2024-06-01 12:09:10] [INFO ] Flow matrix only has 8387 transitions (discarded 13 similar events)
[2024-06-01 12:09:10] [INFO ] Invariant cache hit.
[2024-06-01 12:09:11] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 148/8536 variables, and 0 constraints, problems are : Problem set: 0 solved, 8399 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/149 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8399/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 148/8536 variables, and 0 constraints, problems are : Problem set: 0 solved, 8399 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/149 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 215055ms problems are : Problem set: 0 solved, 8399 unsolved
Search for dead transitions found 0 dead transitions in 215159ms
Starting structural reductions in LTL mode, iteration 1 : 149/199 places, 8400/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224557 ms. Remains : 149/199 places, 8400/8461 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-11a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-07 finished in 225666 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 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 198 transition count 8380
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 87 rules applied. Total rules applied 167 place count 118 transition count 8373
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 172 place count 116 transition count 8370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 176 place count 115 transition count 8367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 178 place count 113 transition count 8367
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 178 place count 113 transition count 8356
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 200 place count 102 transition count 8356
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 100 transition count 8354
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 100 transition count 8354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 205 place count 100 transition count 8353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 205 place count 100 transition count 8352
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 207 place count 99 transition count 8352
Performed 47 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 301 place count 52 transition count 8290
Ensure Unique test removed 2060 transitions
Reduce isomorphic transitions removed 2060 transitions.
Iterating post reduction 6 with 2060 rules applied. Total rules applied 2361 place count 52 transition count 6230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2377 place count 44 transition count 6222
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2385 place count 44 transition count 6214
Drop transitions (Redundant composition of simpler transitions.) removed 6091 transitions
Redundant transition composition rules discarded 6091 transitions
Iterating global reduction 8 with 6091 rules applied. Total rules applied 8476 place count 44 transition count 123
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 8500 place count 32 transition count 111
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 8504 place count 28 transition count 107
Applied a total of 8504 rules in 4533 ms. Remains 28 /199 variables (removed 171) and now considering 107/8461 (removed 8354) transitions.
[2024-06-01 12:12:50] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
// Phase 1: matrix 94 rows 28 cols
[2024-06-01 12:12:50] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:12:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 12:12:50] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
[2024-06-01 12:12:50] [INFO ] Invariant cache hit.
[2024-06-01 12:12:51] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-01 12:12:51] [INFO ] Redundant transitions in 2 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 12:12:51] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
[2024-06-01 12:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:12:51] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 28 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 93/121 variables, 28/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 9 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:12:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/121 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 71 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:12:54] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 8 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 5 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:12:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 93/121 variables, 28/158 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 29/187 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/121 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 187 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 129/129 constraints]
After SMT, in 9347ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 9347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/199 places, 107/8461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14128 ms. Remains : 28/199 places, 107/8461 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-12
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-12 finished in 14220 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))))))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 8446
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 8446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 185 transition count 8445
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 174 transition count 8434
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 174 transition count 8434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 174 transition count 8432
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 166 transition count 8424
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 166 transition count 8424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 166 transition count 8423
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 77 place count 159 transition count 8416
Iterating global reduction 3 with 7 rules applied. Total rules applied 84 place count 159 transition count 8416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 159 transition count 8414
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 91 place count 154 transition count 8409
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 154 transition count 8409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 154 transition count 8408
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 100 place count 151 transition count 8405
Iterating global reduction 5 with 3 rules applied. Total rules applied 103 place count 151 transition count 8405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 105 place count 151 transition count 8403
Applied a total of 105 rules in 233 ms. Remains 151 /199 variables (removed 48) and now considering 8403/8461 (removed 58) transitions.
[2024-06-01 12:13:00] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
// Phase 1: matrix 8390 rows 151 cols
[2024-06-01 12:13:00] [INFO ] Computed 1 invariants in 23 ms
[2024-06-01 12:13:03] [INFO ] Implicit Places using invariants in 2691 ms returned []
[2024-06-01 12:13:03] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:13:03] [INFO ] Invariant cache hit.
[2024-06-01 12:13:05] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 12:13:09] [INFO ] Implicit Places using invariants and state equation in 6099 ms returned []
Implicit Place search using SMT with State Equation took 8819 ms to find 0 implicit places.
Running 8402 sub problems to find dead transitions.
[2024-06-01 12:13:09] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:13:09] [INFO ] Invariant cache hit.
[2024-06-01 12:13:10] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8402/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 203389ms problems are : Problem set: 0 solved, 8402 unsolved
Search for dead transitions found 0 dead transitions in 203486ms
Starting structural reductions in LTL mode, iteration 1 : 151/199 places, 8403/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212570 ms. Remains : 151/199 places, 8403/8461 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-13
Product exploration explored 100000 steps with 13423 reset in 455 ms.
Product exploration explored 100000 steps with 13368 reset in 462 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 8403/8403 transitions.
Applied a total of 0 rules in 27 ms. Remains 151 /151 variables (removed 0) and now considering 8403/8403 (removed 0) transitions.
[2024-06-01 12:16:35] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:16:35] [INFO ] Invariant cache hit.
[2024-06-01 12:16:37] [INFO ] Implicit Places using invariants in 2576 ms returned []
[2024-06-01 12:16:37] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:16:37] [INFO ] Invariant cache hit.
[2024-06-01 12:16:40] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 12:16:43] [INFO ] Implicit Places using invariants and state equation in 6004 ms returned []
Implicit Place search using SMT with State Equation took 8584 ms to find 0 implicit places.
Running 8402 sub problems to find dead transitions.
[2024-06-01 12:16:43] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:16:43] [INFO ] Invariant cache hit.
[2024-06-01 12:16:44] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8402/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 197529ms problems are : Problem set: 0 solved, 8402 unsolved
Search for dead transitions found 0 dead transitions in 197624ms
Finished structural reductions in LTL mode , in 1 iterations and 206267 ms. Remains : 151/151 places, 8403/8403 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13098 reset in 648 ms.
Product exploration explored 100000 steps with 13449 reset in 649 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 8403/8403 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 151 transition count 8403
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 36 place count 151 transition count 8415
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 151 transition count 8415
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 70 place count 129 transition count 8393
Deduced a syphon composed of 26 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 92 place count 129 transition count 8393
Performed 61 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 87 places in 2 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 153 place count 129 transition count 8404
Ensure Unique test removed 4130 transitions
Reduce isomorphic transitions removed 4130 transitions.
Iterating post reduction 1 with 4130 rules applied. Total rules applied 4283 place count 129 transition count 4274
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 4323 place count 89 transition count 4234
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 4363 place count 89 transition count 4234
Deduced a syphon composed of 47 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4119 transitions
Redundant transition composition rules discarded 4119 transitions
Iterating global reduction 2 with 4119 rules applied. Total rules applied 8482 place count 89 transition count 115
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 8494 place count 89 transition count 115
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 8518 place count 65 transition count 91
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 8542 place count 65 transition count 91
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 8542 rules in 3363 ms. Remains 65 /151 variables (removed 86) and now considering 91/8403 (removed 8312) transitions.
[2024-06-01 12:20:07] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 12:20:07] [INFO ] Flow matrix only has 79 transitions (discarded 12 similar events)
// Phase 1: matrix 79 rows 65 cols
[2024-06-01 12:20:07] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:20:07] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:20:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:20:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:20:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:20:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:20:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 9 (OVERLAPS) 78/143 variables, 65/154 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 12/166 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/166 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/167 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/167 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/167 constraints. Problems are: Problem set: 46 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 167 constraints, problems are : Problem set: 46 solved, 44 unsolved in 6343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 46 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 36/65 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 88/89 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 20/109 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 4 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 8/117 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:20:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/119 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-06-01 12:20:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/120 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/120 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 78/143 variables, 65/185 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 12/197 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 44/241 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/241 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/242 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/242 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/242 constraints. Problems are: Problem set: 46 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 242 constraints, problems are : Problem set: 46 solved, 44 unsolved in 6582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 44/90 constraints, Known Traps: 119/119 constraints]
After SMT, in 12950ms problems are : Problem set: 46 solved, 44 unsolved
Search for dead transitions found 46 dead transitions in 12952ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/151 places, 45/8403 transitions.
Graph (complete) has 355 edges and 65 vertex of which 30 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 30 /65 variables (removed 35) and now considering 45/45 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/151 places, 45/8403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16333 ms. Remains : 30/151 places, 45/8403 transitions.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 8403/8403 transitions.
Applied a total of 0 rules in 27 ms. Remains 151 /151 variables (removed 0) and now considering 8403/8403 (removed 0) transitions.
[2024-06-01 12:20:20] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
// Phase 1: matrix 8390 rows 151 cols
[2024-06-01 12:20:20] [INFO ] Computed 1 invariants in 31 ms
[2024-06-01 12:20:23] [INFO ] Implicit Places using invariants in 2662 ms returned []
[2024-06-01 12:20:23] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:20:23] [INFO ] Invariant cache hit.
[2024-06-01 12:20:25] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-06-01 12:20:29] [INFO ] Implicit Places using invariants and state equation in 6237 ms returned []
Implicit Place search using SMT with State Equation took 8907 ms to find 0 implicit places.
Running 8402 sub problems to find dead transitions.
[2024-06-01 12:20:29] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-06-01 12:20:29] [INFO ] Invariant cache hit.
[2024-06-01 12:20:30] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8402/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8402 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 216313ms problems are : Problem set: 0 solved, 8402 unsolved
Search for dead transitions found 0 dead transitions in 216415ms
Finished structural reductions in LTL mode , in 1 iterations and 225380 ms. Remains : 151/151 places, 8403/8403 transitions.
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-13 finished in 666841 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))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 199 transition count 8386
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 82 rules applied. Total rules applied 157 place count 124 transition count 8379
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 162 place count 122 transition count 8376
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 121 transition count 8372
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 118 transition count 8372
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 170 place count 118 transition count 8359
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 196 place count 105 transition count 8359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 103 transition count 8356
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 103 transition count 8356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 201 place count 103 transition count 8355
Performed 59 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 319 place count 44 transition count 8271
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 6 with 2058 rules applied. Total rules applied 2377 place count 44 transition count 6213
Drop transitions (Redundant composition of simpler transitions.) removed 6091 transitions
Redundant transition composition rules discarded 6091 transitions
Iterating global reduction 7 with 6091 rules applied. Total rules applied 8468 place count 44 transition count 122
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 8492 place count 32 transition count 110
Applied a total of 8492 rules in 5038 ms. Remains 32 /199 variables (removed 167) and now considering 110/8461 (removed 8351) transitions.
[2024-06-01 12:24:12] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
// Phase 1: matrix 98 rows 32 cols
[2024-06-01 12:24:12] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 12:24:12] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 12:24:12] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
[2024-06-01 12:24:12] [INFO ] Invariant cache hit.
[2024-06-01 12:24:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-06-01 12:24:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-01 12:24:12] [INFO ] Redundant transitions in 5 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 12:24:12] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
[2024-06-01 12:24:12] [INFO ] Invariant cache hit.
[2024-06-01 12:24:12] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:24:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:24:14] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:24:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:24:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 97/129 variables, 32/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 76/185 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 1/130 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/130 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 186 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:24:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 97/129 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 76/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 109/334 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:24:24] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 1/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 109 unsolved in 14414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 117/117 constraints]
After SMT, in 21540ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 21542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/199 places, 110/8461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26760 ms. Remains : 32/199 places, 110/8461 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-15 finished in 26931 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))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-11a-LTLCardinality-13
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 198 transition count 8380
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 87 rules applied. Total rules applied 167 place count 118 transition count 8373
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 172 place count 116 transition count 8370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 115 transition count 8369
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 174 place count 115 transition count 8357
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 198 place count 103 transition count 8357
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 100 transition count 8353
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 100 transition count 8353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 207 place count 100 transition count 8350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 207 place count 100 transition count 8349
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 99 transition count 8349
Performed 47 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 303 place count 52 transition count 8286
Ensure Unique test removed 4104 transitions
Reduce isomorphic transitions removed 4104 transitions.
Iterating post reduction 5 with 4104 rules applied. Total rules applied 4407 place count 52 transition count 4182
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 4423 place count 44 transition count 4174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4431 place count 44 transition count 4166
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 4433 place count 44 transition count 4166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4434 place count 44 transition count 4165
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4437 place count 41 transition count 4162
Applied a total of 4437 rules in 1145 ms. Remains 41 /199 variables (removed 158) and now considering 4162/8461 (removed 4299) transitions.
[2024-06-01 12:24:35] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
// Phase 1: matrix 4149 rows 41 cols
[2024-06-01 12:24:35] [INFO ] Computed 1 invariants in 15 ms
[2024-06-01 12:24:37] [INFO ] Implicit Places using invariants in 1446 ms returned []
[2024-06-01 12:24:37] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:24:37] [INFO ] Invariant cache hit.
[2024-06-01 12:24:37] [INFO ] State equation strengthened by 2060 read => feed constraints.
[2024-06-01 12:24:39] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2024-06-01 12:24:39] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:24:39] [INFO ] Invariant cache hit.
[2024-06-01 12:24:39] [INFO ] State equation strengthened by 2060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-06-01 12:26:16] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-06-01 12:26:16] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-06-01 12:26:16] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 0 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 4 places in 1068 ms of which 1 ms to minimize.
[2024-06-01 12:26:19] [INFO ] Deduced a trap composed of 4 places in 794 ms of which 0 ms to minimize.
[2024-06-01 12:26:20] [INFO ] Deduced a trap composed of 4 places in 951 ms of which 1 ms to minimize.
[2024-06-01 12:26:21] [INFO ] Deduced a trap composed of 4 places in 800 ms of which 0 ms to minimize.
[2024-06-01 12:26:22] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 1 ms to minimize.
[2024-06-01 12:26:22] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 1 ms to minimize.
[2024-06-01 12:26:23] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 0 ms to minimize.
[2024-06-01 12:26:23] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 0 ms to minimize.
[2024-06-01 12:26:24] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
SMT process timed out in 104519ms, After SMT, problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 104563ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/199 places, 4162/8461 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 109542 ms. Remains : 41/199 places, 4162/8461 transitions.
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-13
Product exploration timeout after 13100 steps with 2620 reset in 10001 ms.
Product exploration timeout after 13280 steps with 2656 reset in 10001 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 4162/4162 transitions.
Applied a total of 0 rules in 12 ms. Remains 41 /41 variables (removed 0) and now considering 4162/4162 (removed 0) transitions.
[2024-06-01 12:26:45] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:26:45] [INFO ] Invariant cache hit.
[2024-06-01 12:26:46] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-06-01 12:26:46] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:26:46] [INFO ] Invariant cache hit.
[2024-06-01 12:26:47] [INFO ] State equation strengthened by 2060 read => feed constraints.
[2024-06-01 12:26:48] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 3693 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2024-06-01 12:26:48] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:26:48] [INFO ] Invariant cache hit.
[2024-06-01 12:26:48] [INFO ] State equation strengthened by 2060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-06-01 12:28:24] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 1 ms to minimize.
[2024-06-01 12:28:25] [INFO ] Deduced a trap composed of 4 places in 1086 ms of which 0 ms to minimize.
[2024-06-01 12:28:26] [INFO ] Deduced a trap composed of 4 places in 959 ms of which 0 ms to minimize.
[2024-06-01 12:28:27] [INFO ] Deduced a trap composed of 4 places in 933 ms of which 1 ms to minimize.
[2024-06-01 12:28:28] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 1 ms to minimize.
[2024-06-01 12:28:28] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 0 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 0 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 1 ms to minimize.
SMT process timed out in 101800ms, After SMT, problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 101849ms
Finished structural reductions in LTL mode , in 1 iterations and 105570 ms. Remains : 41/41 places, 4162/4162 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 13320 steps with 2664 reset in 10006 ms.
Product exploration timeout after 13360 steps with 2672 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 4162/4162 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4107 transitions
Redundant transition composition rules discarded 4107 transitions
Iterating global reduction 0 with 4107 rules applied. Total rules applied 4107 place count 41 transition count 55
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 4119 place count 41 transition count 55
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 4119 rules in 1246 ms. Remains 41 /41 variables (removed 0) and now considering 55/4162 (removed 4107) transitions.
[2024-06-01 12:28:53] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 12:28:53] [INFO ] Flow matrix only has 43 transitions (discarded 12 similar events)
// Phase 1: matrix 43 rows 41 cols
[2024-06-01 12:28:53] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:28:53] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:28:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:28:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 5 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 10 (OVERLAPS) 42/83 variables, 41/149 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 12/161 constraints. Problems are: Problem set: 12 solved, 42 unsolved
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 5/166 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/83 variables, 0/166 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 14 (OVERLAPS) 1/84 variables, 1/167 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/167 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 16 (OVERLAPS) 0/84 variables, 0/167 constraints. Problems are: Problem set: 12 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 167 constraints, problems are : Problem set: 12 solved, 42 unsolved in 4296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 112/112 constraints]
Escalating to Integer solving :Problem set: 12 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 110/110 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/110 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 13/41 variables, 1/111 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/113 constraints. Problems are: Problem set: 12 solved, 42 unsolved
[2024-06-01 12:28:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:28:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:28:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:28:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:28:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:28:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 13/126 constraints. Problems are: Problem set: 12 solved, 42 unsolved
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:28:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 6/132 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/132 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 42/83 variables, 41/173 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 12/185 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 42/227 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/227 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/228 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/228 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/228 constraints. Problems are: Problem set: 12 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 228 constraints, problems are : Problem set: 12 solved, 42 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 42/54 constraints, Known Traps: 131/131 constraints]
After SMT, in 6616ms problems are : Problem set: 12 solved, 42 unsolved
Search for dead transitions found 12 dead transitions in 6618ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 43/4162 transitions.
Graph (complete) has 341 edges and 41 vertex of which 29 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 29 /41 variables (removed 12) and now considering 43/43 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/41 places, 43/4162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7879 ms. Remains : 29/41 places, 43/4162 transitions.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 4162/4162 transitions.
Applied a total of 0 rules in 11 ms. Remains 41 /41 variables (removed 0) and now considering 4162/4162 (removed 0) transitions.
[2024-06-01 12:28:59] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
// Phase 1: matrix 4149 rows 41 cols
[2024-06-01 12:28:59] [INFO ] Computed 1 invariants in 13 ms
[2024-06-01 12:29:01] [INFO ] Implicit Places using invariants in 1429 ms returned []
[2024-06-01 12:29:01] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:29:01] [INFO ] Invariant cache hit.
[2024-06-01 12:29:02] [INFO ] State equation strengthened by 2060 read => feed constraints.
[2024-06-01 12:29:03] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 3742 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2024-06-01 12:29:03] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-06-01 12:29:03] [INFO ] Invariant cache hit.
[2024-06-01 12:29:03] [INFO ] State equation strengthened by 2060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 1 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 4 places in 1021 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 4 places in 856 ms of which 1 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 4 places in 844 ms of which 0 ms to minimize.
[2024-06-01 12:30:40] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 1 ms to minimize.
[2024-06-01 12:30:41] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-06-01 12:30:42] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 0 ms to minimize.
[2024-06-01 12:30:42] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 0 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 541 ms of which 1 ms to minimize.
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/4190 variables, and 21 constraints, problems are : Problem set: 0 solved, 4161 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/2060 constraints, PredecessorRefiner: 4161/28 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2024-06-01 12:30:55] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-06-01 12:30:56] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-06-01 12:30:57] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-06-01 12:30:57] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-06-01 12:30:57] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-06-01 12:30:57] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-06-01 12:30:58] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 0 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 0 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 0 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 4 places in 753 ms of which 0 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 4 places in 665 ms of which 0 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 4 places in 761 ms of which 0 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 1 ms to minimize.
[2024-06-01 12:31:05] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 666 ms of which 0 ms to minimize.
[2024-06-01 12:31:06] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 1 ms to minimize.
[2024-06-01 12:31:07] [INFO ] Deduced a trap composed of 4 places in 556 ms of which 1 ms to minimize.
[2024-06-01 12:31:07] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2024-06-01 12:31:08] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 0 ms to minimize.
[2024-06-01 12:31:08] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2024-06-01 12:31:08] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-06-01 12:31:09] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-06-01 12:31:09] [INFO ] Deduced a trap composed of 4 places in 861 ms of which 1 ms to minimize.
[2024-06-01 12:31:10] [INFO ] Deduced a trap composed of 4 places in 728 ms of which 0 ms to minimize.
[2024-06-01 12:31:11] [INFO ] Deduced a trap composed of 4 places in 853 ms of which 0 ms to minimize.
[2024-06-01 12:31:12] [INFO ] Deduced a trap composed of 4 places in 962 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-06-01 12:31:13] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 0 ms to minimize.
SMT process timed out in 131277ms, After SMT, problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 131317ms
Finished structural reductions in LTL mode , in 1 iterations and 135083 ms. Remains : 41/41 places, 4162/4162 transitions.
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-13 finished in 401560 ms.
[2024-06-01 12:31:16] [INFO ] Flatten gal took : 872 ms
[2024-06-01 12:31:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 12:31:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 8461 transitions and 197399 arcs took 119 ms.
Total runtime 2093186 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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

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="StigmergyCommit-PT-11a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyCommit-PT-11a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531900235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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