Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690529700156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529700156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:51 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 1.8M 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-06a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716989858054

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:37:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 13:37:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:37:39] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-05-29 13:37:39] [INFO ] Transformed 256 places.
[2024-05-29 13:37:39] [INFO ] Transformed 2816 transitions.
[2024-05-29 13:37:39] [INFO ] Found NUPN structural information;
[2024-05-29 13:37:39] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 201 transition count 525
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 201 transition count 525
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 117 place count 201 transition count 518
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 146 place count 172 transition count 482
Iterating global reduction 1 with 29 rules applied. Total rules applied 175 place count 172 transition count 482
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 182 place count 172 transition count 475
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 188 place count 166 transition count 469
Iterating global reduction 2 with 6 rules applied. Total rules applied 194 place count 166 transition count 469
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 160 transition count 463
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 160 transition count 463
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 155 transition count 458
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 155 transition count 458
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 151 transition count 454
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 151 transition count 454
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 228 place count 151 transition count 450
Applied a total of 228 rules in 82 ms. Remains 151 /256 variables (removed 105) and now considering 450/587 (removed 137) transitions.
[2024-05-29 13:37:40] [INFO ] Flow matrix only has 442 transitions (discarded 8 similar events)
// Phase 1: matrix 442 rows 151 cols
[2024-05-29 13:37:40] [INFO ] Computed 2 invariants in 23 ms
[2024-05-29 13:37:40] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 13:37:40] [INFO ] Flow matrix only has 442 transitions (discarded 8 similar events)
[2024-05-29 13:37:40] [INFO ] Invariant cache hit.
[2024-05-29 13:37:40] [INFO ] State equation strengthened by 320 read => feed constraints.
[2024-05-29 13:37:40] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-29 13:37:40] [INFO ] Flow matrix only has 442 transitions (discarded 8 similar events)
[2024-05-29 13:37:40] [INFO ] Invariant cache hit.
[2024-05-29 13:37:40] [INFO ] State equation strengthened by 320 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 25 ms to minimize.
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 11 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-29 13:37:51] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 3 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 3 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:37:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:37:53] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:02] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:04] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:38:04] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:38:04] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:38:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:07] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:38:07] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:38:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:09] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:38:10] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:11] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:38:11] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:38:11] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 151/593 variables, and 118 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/151 constraints, ReadFeed: 0/320 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:38:17] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:38:17] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:38:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:38:20] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:38:20] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:38:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-29 13:38:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:38:26] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:38:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:38:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 441/592 variables, 151/281 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 319/600 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/593 variables, and 1049 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, ReadFeed: 319/320 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 128/128 constraints]
After SMT, in 62345ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 62366ms
Starting structural reductions in LTL mode, iteration 1 : 151/256 places, 450/587 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63282 ms. Remains : 151/256 places, 450/587 transitions.
Support contains 14 out of 151 places after structural reductions.
[2024-05-29 13:38:43] [INFO ] Flatten gal took : 76 ms
[2024-05-29 13:38:43] [INFO ] Flatten gal took : 40 ms
[2024-05-29 13:38:43] [INFO ] Input system was already deterministic with 450 transitions.
Reduction of identical properties reduced properties to check from 13 to 9
RANDOM walk for 40000 steps (18 resets) in 1697 ms. (23 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2024-05-29 13:38:44] [INFO ] Flow matrix only has 442 transitions (discarded 8 similar events)
[2024-05-29 13:38:44] [INFO ] Invariant cache hit.
[2024-05-29 13:38:44] [INFO ] State equation strengthened by 320 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 150/593 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/151 constraints, ReadFeed: 0/320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 44 stabilizing places and 43 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 76 rules applied. Total rules applied 76 place count 149 transition count 374
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 95 rules applied. Total rules applied 171 place count 74 transition count 354
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 16 rules applied. Total rules applied 187 place count 67 transition count 345
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 65 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 191 place count 65 transition count 337
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 203 place count 59 transition count 337
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 217 place count 45 transition count 323
Iterating global reduction 4 with 14 rules applied. Total rules applied 231 place count 45 transition count 323
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 4 with 128 rules applied. Total rules applied 359 place count 45 transition count 195
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 359 place count 45 transition count 188
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 373 place count 38 transition count 188
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 389 place count 30 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 396 place count 30 transition count 172
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 410 place count 23 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 22 transition count 164
Applied a total of 411 rules in 88 ms. Remains 22 /151 variables (removed 129) and now considering 164/450 (removed 286) transitions.
[2024-05-29 13:38:44] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
// Phase 1: matrix 156 rows 22 cols
[2024-05-29 13:38:44] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:38:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 13:38:44] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:38:44] [INFO ] Invariant cache hit.
[2024-05-29 13:38:44] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:38:44] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-29 13:38:44] [INFO ] Redundant transitions in 8 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:38:44] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:38:44] [INFO ] Invariant cache hit.
[2024-05-29 13:38:44] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:38:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:38:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:38:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:38:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13774 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 19912ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 19916ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/151 places, 164/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20113 ms. Remains : 22/151 places, 164/450 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-00
Stuttering criterion allowed to conclude after 832 steps with 103 reset in 11 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-00 finished in 20386 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((X(G((F(p2)||p1)))||p0)))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 441
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 439
Applied a total of 19 rules in 15 ms. Remains 143 /151 variables (removed 8) and now considering 439/450 (removed 11) transitions.
[2024-05-29 13:39:04] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:39:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:39:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 13:39:04] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:39:04] [INFO ] Invariant cache hit.
[2024-05-29 13:39:05] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:39:05] [INFO ] Implicit Places using invariants and state equation in 447 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 507 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 15 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:39:05] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:39:05] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 13:39:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:39:05] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:39:05] [INFO ] Invariant cache hit.
[2024-05-29 13:39:05] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:39:05] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 685 ms. Remains : 88/151 places, 378/450 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 0 reset in 128 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 p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (23 resets) in 587 ms. (68 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
[2024-05-29 13:39:06] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:39:06] [INFO ] Invariant cache hit.
[2024-05-29 13:39:06] [INFO ] State equation strengthened by 260 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 369/457 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 259/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 88/458 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 13 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLFireability-01 finished in 1931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 8 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 441
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 439
Applied a total of 19 rules in 20 ms. Remains 143 /151 variables (removed 8) and now considering 439/450 (removed 11) transitions.
[2024-05-29 13:39:06] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:39:06] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:39:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 13:39:06] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:39:06] [INFO ] Invariant cache hit.
[2024-05-29 13:39:07] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:39:07] [INFO ] Implicit Places using invariants and state equation in 449 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 17 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:39:07] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:39:07] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:39:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 13:39:07] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:39:07] [INFO ] Invariant cache hit.
[2024-05-29 13:39:07] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:39:07] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 706 ms. Remains : 88/151 places, 378/450 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-02
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-02 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 76 rules applied. Total rules applied 76 place count 149 transition count 374
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 95 rules applied. Total rules applied 171 place count 74 transition count 354
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 16 rules applied. Total rules applied 187 place count 67 transition count 345
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 65 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 191 place count 65 transition count 337
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 203 place count 59 transition count 337
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 217 place count 45 transition count 323
Iterating global reduction 4 with 14 rules applied. Total rules applied 231 place count 45 transition count 323
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 4 with 128 rules applied. Total rules applied 359 place count 45 transition count 195
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 359 place count 45 transition count 188
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 373 place count 38 transition count 188
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 389 place count 30 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 396 place count 30 transition count 172
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 410 place count 23 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 22 transition count 164
Applied a total of 411 rules in 65 ms. Remains 22 /151 variables (removed 129) and now considering 164/450 (removed 286) transitions.
[2024-05-29 13:39:07] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
// Phase 1: matrix 156 rows 22 cols
[2024-05-29 13:39:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:39:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 13:39:07] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:07] [INFO ] Invariant cache hit.
[2024-05-29 13:39:07] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:39:07] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-29 13:39:07] [INFO ] Redundant transitions in 8 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:39:07] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:07] [INFO ] Invariant cache hit.
[2024-05-29 13:39:07] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5967 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:14] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:39:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:39:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13723 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 20130ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 20132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/151 places, 164/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20308 ms. Remains : 22/151 places, 164/450 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-03
Product exploration explored 100000 steps with 12500 reset in 459 ms.
Product exploration explored 100000 steps with 12500 reset in 423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-29 13:39:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:29] [INFO ] Invariant cache hit.
[2024-05-29 13:39:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:39:29] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-29 13:39:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:39:29] [INFO ] [Real]Added 141 Read/Feed constraints in 13 ms returned sat
[2024-05-29 13:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:39:29] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-29 13:39:29] [INFO ] [Nat]Added 141 Read/Feed constraints in 15 ms returned sat
[2024-05-29 13:39:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 149 transitions) in 30 ms.
[2024-05-29 13:39:29] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 164/164 transitions.
Applied a total of 0 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 13:39:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:29] [INFO ] Invariant cache hit.
[2024-05-29 13:39:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:39:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:29] [INFO ] Invariant cache hit.
[2024-05-29 13:39:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:39:29] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 13:39:29] [INFO ] Redundant transitions in 7 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:39:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:29] [INFO ] Invariant cache hit.
[2024-05-29 13:39:29] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:39:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:39:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:32] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 6154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-05-29 13:39:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13721 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 20287ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 20289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20423 ms. Remains : 22/22 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-29 13:39:50] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:50] [INFO ] Invariant cache hit.
[2024-05-29 13:39:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:39:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-29 13:39:50] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:39:50] [INFO ] [Real]Added 141 Read/Feed constraints in 15 ms returned sat
[2024-05-29 13:39:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:39:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:39:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-29 13:39:50] [INFO ] [Nat]Added 141 Read/Feed constraints in 18 ms returned sat
[2024-05-29 13:39:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 149 transitions) in 15 ms.
[2024-05-29 13:39:50] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12500 reset in 362 ms.
Product exploration explored 100000 steps with 12500 reset in 373 ms.
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 164/164 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 13:39:51] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:51] [INFO ] Invariant cache hit.
[2024-05-29 13:39:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 13:39:51] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:51] [INFO ] Invariant cache hit.
[2024-05-29 13:39:51] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:39:51] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-29 13:39:51] [INFO ] Redundant transitions in 3 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:39:51] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:39:51] [INFO ] Invariant cache hit.
[2024-05-29 13:39:51] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13843 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 20020ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 20022ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20125 ms. Remains : 22/22 places, 164/164 transitions.
Treatment of property StigmergyCommit-PT-06a-LTLFireability-03 finished in 64127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p0||X(p1)))))))'
Support contains 9 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 148 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 148 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 146 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 146 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 145 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 145 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 144 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 144 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Applied a total of 16 rules in 12 ms. Remains 144 /151 variables (removed 7) and now considering 441/450 (removed 9) transitions.
[2024-05-29 13:40:11] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
// Phase 1: matrix 433 rows 144 cols
[2024-05-29 13:40:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:40:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 13:40:11] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2024-05-29 13:40:11] [INFO ] Invariant cache hit.
[2024-05-29 13:40:12] [INFO ] State equation strengthened by 317 read => feed constraints.
[2024-05-29 13:40:12] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-05-29 13:40:12] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2024-05-29 13:40:12] [INFO ] Invariant cache hit.
[2024-05-29 13:40:12] [INFO ] State equation strengthened by 317 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:40:16] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:23] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:40:26] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:40:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:27] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:40:27] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:40:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:40:30] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:40:31] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:40:34] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 12 (OVERLAPS) 432/576 variables, 144/257 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 316/573 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-29 13:40:43] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:40:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:40:43] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
SMT process timed out in 31595ms, After SMT, problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 31604ms
Starting structural reductions in LTL mode, iteration 1 : 144/151 places, 441/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32018 ms. Remains : 144/151 places, 441/450 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-05
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-05 finished in 32195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!(false U p0))) U p1))'
Support contains 8 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 148 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 148 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 148 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 147 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 146 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 146 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 145 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Applied a total of 14 rules in 15 ms. Remains 145 /151 variables (removed 6) and now considering 442/450 (removed 8) transitions.
[2024-05-29 13:40:44] [INFO ] Flow matrix only has 434 transitions (discarded 8 similar events)
// Phase 1: matrix 434 rows 145 cols
[2024-05-29 13:40:44] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:40:44] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 13:40:44] [INFO ] Flow matrix only has 434 transitions (discarded 8 similar events)
[2024-05-29 13:40:44] [INFO ] Invariant cache hit.
[2024-05-29 13:40:44] [INFO ] State equation strengthened by 317 read => feed constraints.
[2024-05-29 13:40:44] [INFO ] Implicit Places using invariants and state equation in 412 ms returned [144]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/151 places, 442/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 124 transition count 422
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 124 transition count 422
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 124 transition count 415
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 117 transition count 408
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 117 transition count 408
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 110 transition count 401
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 110 transition count 401
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 103 transition count 394
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 103 transition count 394
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 96 transition count 387
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 96 transition count 387
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 90 transition count 381
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 90 transition count 381
Applied a total of 115 rules in 11 ms. Remains 90 /144 variables (removed 54) and now considering 381/442 (removed 61) transitions.
[2024-05-29 13:40:44] [INFO ] Flow matrix only has 373 transitions (discarded 8 similar events)
// Phase 1: matrix 373 rows 90 cols
[2024-05-29 13:40:44] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 13:40:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 13:40:44] [INFO ] Flow matrix only has 373 transitions (discarded 8 similar events)
[2024-05-29 13:40:44] [INFO ] Invariant cache hit.
[2024-05-29 13:40:44] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:40:44] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/151 places, 381/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 678 ms. Remains : 90/151 places, 381/450 transitions.
Stuttering acceptance computed with spot in 123 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 164 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) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 16061 steps (4 resets) in 216 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 9 factoid took 237 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLFireability-06 finished in 1707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||G(F(p1)))))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 441
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 439
Applied a total of 19 rules in 9 ms. Remains 143 /151 variables (removed 8) and now considering 439/450 (removed 11) transitions.
[2024-05-29 13:40:45] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:40:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:40:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 13:40:45] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:40:45] [INFO ] Invariant cache hit.
[2024-05-29 13:40:45] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:40:46] [INFO ] Implicit Places using invariants and state equation in 444 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 496 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 12 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:40:46] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:40:46] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:40:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 13:40:46] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:40:46] [INFO ] Invariant cache hit.
[2024-05-29 13:40:46] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:40:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 661 ms. Remains : 88/151 places, 378/450 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-07
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-07 finished in 829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 441
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 439
Applied a total of 19 rules in 13 ms. Remains 143 /151 variables (removed 8) and now considering 439/450 (removed 11) transitions.
[2024-05-29 13:40:46] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:40:46] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:40:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 13:40:46] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:40:46] [INFO ] Invariant cache hit.
[2024-05-29 13:40:46] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:40:47] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 501 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 14 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:40:47] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:40:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:40:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 13:40:47] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:40:47] [INFO ] Invariant cache hit.
[2024-05-29 13:40:47] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:40:47] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 684 ms. Remains : 88/151 places, 378/450 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-08 finished in 914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&((F(G(p2))&&p1) U (p0 U p2)))))'
Support contains 8 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 149 transition count 376
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 91 rules applied. Total rules applied 165 place count 76 transition count 358
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 14 rules applied. Total rules applied 179 place count 70 transition count 350
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 68 transition count 348
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 183 place count 68 transition count 342
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 195 place count 62 transition count 342
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 209 place count 48 transition count 328
Iterating global reduction 4 with 14 rules applied. Total rules applied 223 place count 48 transition count 328
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 4 with 128 rules applied. Total rules applied 351 place count 48 transition count 200
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 351 place count 48 transition count 193
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 365 place count 41 transition count 193
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 383 place count 32 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 390 place count 32 transition count 175
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 404 place count 25 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 405 place count 24 transition count 167
Applied a total of 405 rules in 45 ms. Remains 24 /151 variables (removed 127) and now considering 167/450 (removed 283) transitions.
[2024-05-29 13:40:47] [INFO ] Flow matrix only has 159 transitions (discarded 8 similar events)
// Phase 1: matrix 159 rows 24 cols
[2024-05-29 13:40:47] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:40:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 13:40:47] [INFO ] Flow matrix only has 159 transitions (discarded 8 similar events)
[2024-05-29 13:40:47] [INFO ] Invariant cache hit.
[2024-05-29 13:40:47] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-05-29 13:40:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-29 13:40:47] [INFO ] Redundant transitions in 2 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-29 13:40:47] [INFO ] Flow matrix only has 159 transitions (discarded 8 similar events)
[2024-05-29 13:40:47] [INFO ] Invariant cache hit.
[2024-05-29 13:40:47] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:40:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 158/182 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 141/208 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 13 (OVERLAPS) 1/183 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 15 (OVERLAPS) 0/183 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 209 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 158/182 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 141/213 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 160/373 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 374 constraints, problems are : Problem set: 0 solved, 160 unsolved in 11301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 47/47 constraints]
After SMT, in 18809ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 18811ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/151 places, 167/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18945 ms. Remains : 24/151 places, 167/450 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-09 finished in 19197 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((X(!p1)&&p0))))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 441
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 439
Applied a total of 19 rules in 10 ms. Remains 143 /151 variables (removed 8) and now considering 439/450 (removed 11) transitions.
[2024-05-29 13:41:06] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:41:06] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:41:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 13:41:06] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:41:06] [INFO ] Invariant cache hit.
[2024-05-29 13:41:06] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:41:07] [INFO ] Implicit Places using invariants and state equation in 463 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 529 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 14 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:41:07] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:41:07] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:41:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:41:07] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:41:07] [INFO ] Invariant cache hit.
[2024-05-29 13:41:07] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:41:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 697 ms. Remains : 88/151 places, 378/450 transitions.
Stuttering acceptance computed with spot in 119 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Product exploration explored 100000 steps with 33333 reset in 129 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 p0 (NOT p1)), (X p0), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 82 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-06a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLFireability-11 finished in 1170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(X(p1) U ((!p0&&X(p1))||X(G(p1))))))'
Support contains 8 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 441
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 439
Applied a total of 19 rules in 12 ms. Remains 143 /151 variables (removed 8) and now considering 439/450 (removed 11) transitions.
[2024-05-29 13:41:07] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:41:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:41:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 13:41:07] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:41:07] [INFO ] Invariant cache hit.
[2024-05-29 13:41:08] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:41:08] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 520 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/450 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 108 place count 89 transition count 379
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 89 transition count 379
Applied a total of 113 rules in 14 ms. Remains 89 /142 variables (removed 53) and now considering 379/439 (removed 60) transitions.
[2024-05-29 13:41:08] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
// Phase 1: matrix 371 rows 89 cols
[2024-05-29 13:41:08] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:41:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 13:41:08] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
[2024-05-29 13:41:08] [INFO ] Invariant cache hit.
[2024-05-29 13:41:08] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:41:08] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/151 places, 379/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 693 ms. Remains : 89/151 places, 379/450 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), p0]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-12 finished in 980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&(p0||G(F(p1))))) U p1))'
Support contains 8 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 149 transition count 375
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 94 rules applied. Total rules applied 169 place count 75 transition count 355
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 16 rules applied. Total rules applied 185 place count 68 transition count 346
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 189 place count 66 transition count 344
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 189 place count 66 transition count 338
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 201 place count 60 transition count 338
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 214 place count 47 transition count 325
Iterating global reduction 4 with 13 rules applied. Total rules applied 227 place count 47 transition count 325
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 4 with 127 rules applied. Total rules applied 354 place count 47 transition count 198
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 354 place count 47 transition count 191
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 368 place count 40 transition count 191
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 384 place count 32 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 391 place count 32 transition count 175
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 405 place count 25 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 406 place count 24 transition count 167
Applied a total of 406 rules in 45 ms. Remains 24 /151 variables (removed 127) and now considering 167/450 (removed 283) transitions.
[2024-05-29 13:41:08] [INFO ] Flow matrix only has 159 transitions (discarded 8 similar events)
// Phase 1: matrix 159 rows 24 cols
[2024-05-29 13:41:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:41:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 13:41:08] [INFO ] Flow matrix only has 159 transitions (discarded 8 similar events)
[2024-05-29 13:41:08] [INFO ] Invariant cache hit.
[2024-05-29 13:41:08] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-05-29 13:41:08] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-29 13:41:08] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-29 13:41:08] [INFO ] Flow matrix only has 159 transitions (discarded 8 similar events)
[2024-05-29 13:41:08] [INFO ] Invariant cache hit.
[2024-05-29 13:41:08] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:41:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 158/182 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 141/201 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 1/183 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 202 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-29 13:41:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 158/182 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 141/213 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 160/373 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 1/183 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 374 constraints, problems are : Problem set: 0 solved, 160 unsolved in 14451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 47/47 constraints]
After SMT, in 20663ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 20666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/151 places, 167/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20802 ms. Remains : 24/151 places, 167/450 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLFireability-13 finished in 21031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 450/450 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 76 rules applied. Total rules applied 76 place count 149 transition count 374
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 95 rules applied. Total rules applied 171 place count 74 transition count 354
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 16 rules applied. Total rules applied 187 place count 67 transition count 345
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 65 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 191 place count 65 transition count 337
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 203 place count 59 transition count 337
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 217 place count 45 transition count 323
Iterating global reduction 4 with 14 rules applied. Total rules applied 231 place count 45 transition count 323
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 4 with 128 rules applied. Total rules applied 359 place count 45 transition count 195
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 359 place count 45 transition count 188
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 373 place count 38 transition count 188
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 389 place count 30 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 396 place count 30 transition count 172
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 410 place count 23 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 22 transition count 164
Applied a total of 411 rules in 38 ms. Remains 22 /151 variables (removed 129) and now considering 164/450 (removed 286) transitions.
[2024-05-29 13:41:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
// Phase 1: matrix 156 rows 22 cols
[2024-05-29 13:41:29] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:41:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 13:41:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:41:29] [INFO ] Invariant cache hit.
[2024-05-29 13:41:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:41:29] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-29 13:41:29] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:41:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:41:29] [INFO ] Invariant cache hit.
[2024-05-29 13:41:30] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 19056ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 19058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/151 places, 164/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19201 ms. Remains : 22/151 places, 164/450 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLFireability-15
Product exploration explored 100000 steps with 12500 reset in 334 ms.
Product exploration explored 100000 steps with 12500 reset in 337 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-29 13:41:50] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:41:50] [INFO ] Invariant cache hit.
[2024-05-29 13:41:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:41:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 13:41:50] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:41:50] [INFO ] [Real]Added 141 Read/Feed constraints in 14 ms returned sat
[2024-05-29 13:41:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:41:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 13:41:50] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-29 13:41:50] [INFO ] [Nat]Added 141 Read/Feed constraints in 13 ms returned sat
[2024-05-29 13:41:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 149 transitions) in 14 ms.
[2024-05-29 13:41:50] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 164/164 transitions.
Applied a total of 0 rules in 5 ms. Remains 22 /22 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 13:41:50] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:41:50] [INFO ] Invariant cache hit.
[2024-05-29 13:41:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 13:41:50] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:41:50] [INFO ] Invariant cache hit.
[2024-05-29 13:41:50] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:41:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-29 13:41:50] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:41:50] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:41:50] [INFO ] Invariant cache hit.
[2024-05-29 13:41:50] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5788 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:41:56] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:41:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:41:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 19502ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 19504ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19600 ms. Remains : 22/22 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-29 13:42:10] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:42:10] [INFO ] Invariant cache hit.
[2024-05-29 13:42:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:42:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 13:42:10] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:42:10] [INFO ] [Real]Added 141 Read/Feed constraints in 14 ms returned sat
[2024-05-29 13:42:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:42:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 13:42:10] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-29 13:42:10] [INFO ] [Nat]Added 141 Read/Feed constraints in 14 ms returned sat
[2024-05-29 13:42:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 149 transitions) in 12 ms.
[2024-05-29 13:42:10] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12500 reset in 345 ms.
Product exploration explored 100000 steps with 12500 reset in 359 ms.
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 164/164 transitions.
Applied a total of 0 rules in 5 ms. Remains 22 /22 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 13:42:11] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:42:11] [INFO ] Invariant cache hit.
[2024-05-29 13:42:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 13:42:11] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:42:11] [INFO ] Invariant cache hit.
[2024-05-29 13:42:11] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 13:42:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-29 13:42:11] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 13:42:11] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 13:42:11] [INFO ] Invariant cache hit.
[2024-05-29 13:42:11] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:42:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 13:42:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:42:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:42:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 18865ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 18867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18957 ms. Remains : 22/22 places, 164/164 transitions.
Treatment of property StigmergyCommit-PT-06a-LTLFireability-15 finished in 60471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-29 13:42:30] [INFO ] Flatten gal took : 37 ms
[2024-05-29 13:42:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 13:42:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 450 transitions and 4171 arcs took 7 ms.
Total runtime 291370 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-06a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 151
TRANSITIONS: 450
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 3003
MODEL NAME: /home/mcc/execution/411/model
151 places, 450 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-06a-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-06a-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716990156368

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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