MCC'2024- Execution of r536-tall-171690531600124

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
767.855	280361.00	343253.00	840.00	TFFFFFTTFTFFFFFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 227K 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-04a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717229326072

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:08:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:08:47] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-01 08:08:47] [INFO ] Transformed 184 places.
[2024-06-01 08:08:47] [INFO ] Transformed 592 transitions.
[2024-06-01 08:08:47] [INFO ] Found NUPN structural information;
[2024-06-01 08:08:47] [INFO ] Parsed PT model containing 184 places and 592 transitions and 4011 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyCommit-PT-04a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 301/301 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 148 transition count 263
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 148 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 148 transition count 258
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 92 place count 133 transition count 241
Iterating global reduction 1 with 15 rules applied. Total rules applied 107 place count 133 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 133 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 130 transition count 233
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 130 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 127 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 127 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 124 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 124 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 121 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 121 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 139 place count 121 transition count 221
Applied a total of 139 rules in 89 ms. Remains 121 /184 variables (removed 63) and now considering 221/301 (removed 80) transitions.
[2024-06-01 08:08:47] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
// Phase 1: matrix 212 rows 121 cols
[2024-06-01 08:08:47] [INFO ] Computed 2 invariants in 18 ms
[2024-06-01 08:08:47] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-01 08:08:47] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2024-06-01 08:08:47] [INFO ] Invariant cache hit.
[2024-06-01 08:08:47] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-01 08:08:48] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 08:08:48] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2024-06-01 08:08:48] [INFO ] Invariant cache hit.
[2024-06-01 08:08:48] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 12 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:08:49] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:08:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 4 ms to minimize.
[2024-06-01 08:08:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:08:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:08:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:08:51] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:08:51] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 08:08:52] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:08:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 08:08:52] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:08:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:08:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 211/332 variables, 121/168 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 08:08:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 08:08:58] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 1/333 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 14 (OVERLAPS) 0/333 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 283 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 211/332 variables, 121/170 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 112/282 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 220/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 503 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 47/47 constraints]
After SMT, in 32424ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 32446ms
Starting structural reductions in LTL mode, iteration 1 : 121/184 places, 221/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32952 ms. Remains : 121/184 places, 221/301 transitions.
Support contains 21 out of 121 places after structural reductions.
[2024-06-01 08:09:20] [INFO ] Flatten gal took : 42 ms
[2024-06-01 08:09:20] [INFO ] Flatten gal took : 22 ms
[2024-06-01 08:09:20] [INFO ] Input system was already deterministic with 221 transitions.
Support contains 20 out of 121 places (down from 21) after GAL structural reductions.
RANDOM walk for 40000 steps (50 resets) in 854 ms. (46 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (36 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (33 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
[2024-06-01 08:09:21] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2024-06-01 08:09:21] [INFO ] Invariant cache hit.
[2024-06-01 08:09:21] [INFO ] State equation strengthened by 113 read => feed constraints.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 114/120 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/332 variables, 121/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 112/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 236 constraints, problems are : Problem set: 1 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 120/333 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/121 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA StigmergyCommit-PT-04a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 31 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((p0 U X((X(X(p1))||(!p2&&F(G(!p0))))))))'
Support contains 8 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 115 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 115 transition count 212
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 110 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 108 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 108 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 104 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 104 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 104 transition count 197
Applied a total of 35 rules in 11 ms. Remains 104 /121 variables (removed 17) and now considering 197/221 (removed 24) transitions.
[2024-06-01 08:09:21] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
// Phase 1: matrix 191 rows 104 cols
[2024-06-01 08:09:21] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:09:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 08:09:21] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-06-01 08:09:21] [INFO ] Invariant cache hit.
[2024-06-01 08:09:21] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 08:09:21] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 08:09:21] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-06-01 08:09:21] [INFO ] Invariant cache hit.
[2024-06-01 08:09:21] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:09:22] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:09:22] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:09:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:09:24] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:09:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:26] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 190/294 variables, 104/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 106/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 1/295 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/295 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 260 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:35] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 190/294 variables, 104/159 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 106/265 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 196/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 1/295 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/295 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 462 constraints, problems are : Problem set: 0 solved, 196 unsolved in 13148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 53/53 constraints]
After SMT, in 26043ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 26048ms
Starting structural reductions in LTL mode, iteration 1 : 104/121 places, 197/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26239 ms. Remains : 104/121 places, 197/221 transitions.
Stuttering acceptance computed with spot in 826 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), p0]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Computed a total of 32 stabilizing places and 31 stable transitions
Computed a total of 32 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 263 ms. Reduced automaton from 19 states, 36 edges and 3 AP (stutter sensitive) to 19 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 658 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), p0]
RANDOM walk for 40000 steps (74 resets) in 322 ms. (123 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (72 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2024-06-01 08:09:50] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-06-01 08:09:50] [INFO ] Invariant cache hit.
[2024-06-01 08:09:50] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 104/295 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/107 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 591 ms. Reduced automaton from 19 states, 36 edges and 3 AP (stutter sensitive) to 16 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 583 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 559 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-06-01 08:09:51] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-06-01 08:09:51] [INFO ] Invariant cache hit.
[2024-06-01 08:09:52] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 08:09:52] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-06-01 08:09:52] [INFO ] Invariant cache hit.
[2024-06-01 08:09:52] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 08:09:52] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 08:09:52] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-06-01 08:09:52] [INFO ] Invariant cache hit.
[2024-06-01 08:09:52] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 190/294 variables, 104/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 106/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 1/295 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/295 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 260 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:10:05] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 08:10:06] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:10:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:10:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:10:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:10:06] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 190/294 variables, 104/159 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 106/265 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 196/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 1/295 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/295 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 462 constraints, problems are : Problem set: 0 solved, 196 unsolved in 13155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 53/53 constraints]
After SMT, in 25932ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 25934ms
Finished structural reductions in LTL mode , in 1 iterations and 26091 ms. Remains : 104/104 places, 197/197 transitions.
Computed a total of 32 stabilizing places and 31 stable transitions
Computed a total of 32 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 16 states, 25 edges and 3 AP (stutter sensitive) to 16 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 575 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
RANDOM walk for 18618 steps (28 resets) in 122 ms. (151 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 16 states, 25 edges and 3 AP (stutter sensitive) to 16 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 559 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 556 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 542 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Stack based approach found an accepted trace after 311 steps with 0 reset with depth 312 and stack size 192 in 1 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-01 finished in 59278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 115 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 115 transition count 212
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 110 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 108 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 108 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 104 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 104 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 104 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 103 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 103 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 103 transition count 195
Applied a total of 38 rules in 21 ms. Remains 103 /121 variables (removed 18) and now considering 195/221 (removed 26) transitions.
[2024-06-01 08:10:20] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-06-01 08:10:20] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 08:10:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 08:10:21] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-06-01 08:10:21] [INFO ] Invariant cache hit.
[2024-06-01 08:10:21] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 08:10:21] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 08:10:21] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-06-01 08:10:21] [INFO ] Invariant cache hit.
[2024-06-01 08:10:21] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:10:23] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:10:24] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:10:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:10:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 188/291 variables, 103/155 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 105/260 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:10:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (OVERLAPS) 1/292 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/292 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 16 (OVERLAPS) 0/292 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 265 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 08:10:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 188/291 variables, 103/166 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 105/271 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 194/465 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/292 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/292 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 466 constraints, problems are : Problem set: 0 solved, 194 unsolved in 14937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 61/61 constraints]
After SMT, in 32807ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 32808ms
Starting structural reductions in LTL mode, iteration 1 : 103/121 places, 195/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33073 ms. Remains : 103/121 places, 195/221 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-03
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-03 finished in 33236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 119 transition count 158
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 77 rules applied. Total rules applied 140 place count 57 transition count 143
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 148 place count 53 transition count 139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 148 place count 53 transition count 129
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 168 place count 43 transition count 129
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 178 place count 33 transition count 116
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 33 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 192 place count 33 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 192 place count 33 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 31 transition count 110
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 28 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 28 transition count 104
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 230 place count 28 transition count 76
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 242 place count 22 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 247 place count 22 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 257 place count 17 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 16 transition count 58
Applied a total of 258 rules in 42 ms. Remains 16 /121 variables (removed 105) and now considering 58/221 (removed 163) transitions.
[2024-06-01 08:10:54] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2024-06-01 08:10:54] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:10:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:10:54] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 08:10:54] [INFO ] Invariant cache hit.
[2024-06-01 08:10:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 08:10:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 08:10:54] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 08:10:54] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 08:10:54] [INFO ] Invariant cache hit.
[2024-06-01 08:10:54] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:10:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2647ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/121 places, 58/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2764 ms. Remains : 16/121 places, 58/221 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-04
Stuttering criterion allowed to conclude after 252 steps with 41 reset in 2 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-04 finished in 2837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(F(p1))))))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 115 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 115 transition count 212
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 110 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 108 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 108 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 104 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 104 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 104 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 103 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 103 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 103 transition count 195
Applied a total of 38 rules in 18 ms. Remains 103 /121 variables (removed 18) and now considering 195/221 (removed 26) transitions.
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-06-01 08:10:57] [INFO ] Computed 2 invariants in 6 ms
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-06-01 08:10:57] [INFO ] Invariant cache hit.
[2024-06-01 08:10:57] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 248 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/121 places, 195/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 65 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 65 transition count 153
Applied a total of 79 rules in 9 ms. Remains 65 /102 variables (removed 37) and now considering 153/195 (removed 42) transitions.
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 147 transitions (discarded 6 similar events)
// Phase 1: matrix 147 rows 65 cols
[2024-06-01 08:10:57] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 147 transitions (discarded 6 similar events)
[2024-06-01 08:10:57] [INFO ] Invariant cache hit.
[2024-06-01 08:10:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/121 places, 153/221 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 65/121 places, 153/221 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-05
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-05 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(!p0))))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 115 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 115 transition count 212
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 110 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 108 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 108 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 104 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 104 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 104 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 103 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 103 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 103 transition count 195
Applied a total of 38 rules in 9 ms. Remains 103 /121 variables (removed 18) and now considering 195/221 (removed 26) transitions.
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-06-01 08:10:57] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-06-01 08:10:57] [INFO ] Invariant cache hit.
[2024-06-01 08:10:57] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/121 places, 195/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 5 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-06-01 08:10:57] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:10:57] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:10:57] [INFO ] Invariant cache hit.
[2024-06-01 08:10:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:10:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/121 places, 152/221 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 64/121 places, 152/221 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, true, p0, (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-06
Product exploration explored 100000 steps with 5423 reset in 206 ms.
Product exploration explored 100000 steps with 5387 reset in 138 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 132 steps (0 resets) in 4 ms. (26 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 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:10:58] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:10:58] [INFO ] Invariant cache hit.
[2024-06-01 08:10:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:10:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 08:10:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:10:59] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2024-06-01 08:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:10:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 08:10:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:10:59] [INFO ] Computed and/alt/rep : 67/82/67 causal constraints (skipped 78 transitions) in 10 ms.
[2024-06-01 08:10:59] [INFO ] Added : 52 causal constraints over 11 iterations in 128 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 152/152 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-06-01 08:10:59] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:10:59] [INFO ] Invariant cache hit.
[2024-06-01 08:10:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:10:59] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:10:59] [INFO ] Invariant cache hit.
[2024-06-01 08:10:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:10:59] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-06-01 08:10:59] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:10:59] [INFO ] Invariant cache hit.
[2024-06-01 08:10:59] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:10:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 4 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:11:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 145/209 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 163 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 145/209 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 151/313 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 314 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 32/32 constraints]
After SMT, in 15698ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 15700ms
Finished structural reductions in LTL mode , in 1 iterations and 15785 ms. Remains : 64/64 places, 152/152 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 132 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:11:15] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:11:15] [INFO ] Invariant cache hit.
[2024-06-01 08:11:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:11:15] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 08:11:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:11:15] [INFO ] [Real]Added 66 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:11:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:11:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:11:15] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 08:11:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2024-06-01 08:11:15] [INFO ] Computed and/alt/rep : 67/82/67 causal constraints (skipped 78 transitions) in 10 ms.
[2024-06-01 08:11:15] [INFO ] Added : 52 causal constraints over 11 iterations in 116 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2941 reset in 88 ms.
Product exploration explored 100000 steps with 2941 reset in 95 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 152/152 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 152
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 16 place count 64 transition count 157
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 64 transition count 157
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 31 place count 54 transition count 147
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 54 transition count 147
Performed 21 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 62 place count 54 transition count 152
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 103 place count 54 transition count 111
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 42 transition count 99
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 42 transition count 99
Deduced a syphon composed of 20 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 place count 42 transition count 89
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 42 transition count 89
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 32 transition count 79
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 32 transition count 79
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 162 rules in 26 ms. Remains 32 /64 variables (removed 32) and now considering 79/152 (removed 73) transitions.
[2024-06-01 08:11:16] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 08:11:16] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
// Phase 1: matrix 73 rows 32 cols
[2024-06-01 08:11:16] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:11:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 3 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 10 (OVERLAPS) 72/104 variables, 32/63 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 40/103 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 1/105 variables, 1/104 constraints. Problems are: Problem set: 20 solved, 58 unsolved
[2024-06-01 08:11:18] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 1/105 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 16 (OVERLAPS) 0/105 variables, 0/105 constraints. Problems are: Problem set: 20 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 105 constraints, problems are : Problem set: 20 solved, 58 unsolved in 2851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 20 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 16/32 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 31/32 constraints. Problems are: Problem set: 20 solved, 58 unsolved
[2024-06-01 08:11:19] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 72/104 variables, 32/65 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 40/105 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 58/163 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/163 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 1/105 variables, 1/164 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/164 constraints. Problems are: Problem set: 20 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/164 constraints. Problems are: Problem set: 20 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 164 constraints, problems are : Problem set: 20 solved, 58 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 58/78 constraints, Known Traps: 32/32 constraints]
After SMT, in 5018ms problems are : Problem set: 20 solved, 58 unsolved
Search for dead transitions found 20 dead transitions in 5019ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 32/64 places, 59/152 transitions.
Graph (complete) has 101 edges and 32 vertex of which 17 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 17 /32 variables (removed 15) and now considering 59/59 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/64 places, 59/152 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5058 ms. Remains : 17/64 places, 59/152 transitions.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 152/152 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-06-01 08:11:21] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-06-01 08:11:21] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:11:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 08:11:21] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:11:21] [INFO ] Invariant cache hit.
[2024-06-01 08:11:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:11:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-06-01 08:11:21] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:11:21] [INFO ] Invariant cache hit.
[2024-06-01 08:11:21] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 08:11:23] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:11:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 145/209 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 163 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 145/209 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 151/313 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 314 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 32/32 constraints]
After SMT, in 15506ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 15508ms
Finished structural reductions in LTL mode , in 1 iterations and 15591 ms. Remains : 64/64 places, 152/152 transitions.
Treatment of property StigmergyCommit-PT-04a-LTLFireability-06 finished in 39532 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) U X((F(p0)||G(p1)))))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 116 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 116 transition count 213
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 111 transition count 205
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 111 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 108 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 108 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 108 transition count 201
Applied a total of 27 rules in 6 ms. Remains 108 /121 variables (removed 13) and now considering 201/221 (removed 20) transitions.
[2024-06-01 08:11:37] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
// Phase 1: matrix 195 rows 108 cols
[2024-06-01 08:11:37] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:11:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 08:11:37] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:11:37] [INFO ] Invariant cache hit.
[2024-06-01 08:11:37] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-01 08:11:37] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 08:11:37] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:11:37] [INFO ] Invariant cache hit.
[2024-06-01 08:11:37] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:11:38] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:11:40] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:11:40] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:11:40] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:11:40] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:11:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:41] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:11:41] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:11:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:11:41] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:11:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:11:41] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:42] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:11:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:11:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:11:42] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:11:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:11:42] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:43] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:11:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:44] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (OVERLAPS) 194/302 variables, 108/168 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 108/276 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:47] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:11:47] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:11:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 280 constraints, problems are : Problem set: 0 solved, 200 unsolved in 19988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:11:59] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:00] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:01] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:12:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 194/302 variables, 108/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 108/284 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 200/484 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (OVERLAPS) 1/303 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 0/303 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 485 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 66/66 constraints]
After SMT, in 38561ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 38563ms
Starting structural reductions in LTL mode, iteration 1 : 108/121 places, 201/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38800 ms. Remains : 108/121 places, 201/221 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-07
Product exploration explored 100000 steps with 2941 reset in 105 ms.
Product exploration explored 100000 steps with 2941 reset in 114 ms.
Computed a total of 32 stabilizing places and 31 stable transitions
Computed a total of 32 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 132 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:12:16] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:12:16] [INFO ] Invariant cache hit.
[2024-06-01 08:12:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 08:12:17] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 08:12:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:12:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 08:12:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 08:12:17] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-01 08:12:17] [INFO ] [Nat]Added 109 Read/Feed constraints in 23 ms returned sat
[2024-06-01 08:12:17] [INFO ] Computed and/alt/rep : 116/176/116 causal constraints (skipped 78 transitions) in 14 ms.
[2024-06-01 08:12:17] [INFO ] Added : 35 causal constraints over 8 iterations in 121 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-06-01 08:12:17] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:12:17] [INFO ] Invariant cache hit.
[2024-06-01 08:12:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:12:17] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:12:17] [INFO ] Invariant cache hit.
[2024-06-01 08:12:17] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-01 08:12:17] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 08:12:17] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:12:17] [INFO ] Invariant cache hit.
[2024-06-01 08:12:17] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:12:22] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:12:22] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:12:22] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:12:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:12:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:24] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:12:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:24] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (OVERLAPS) 194/302 variables, 108/168 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 108/276 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:28] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:12:28] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:12:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 280 constraints, problems are : Problem set: 0 solved, 200 unsolved in 20467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:41] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 194/302 variables, 108/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 108/284 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 200/484 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (OVERLAPS) 1/303 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 0/303 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 485 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 66/66 constraints]
After SMT, in 39172ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 39174ms
Finished structural reductions in LTL mode , in 1 iterations and 39343 ms. Remains : 108/108 places, 201/201 transitions.
Computed a total of 32 stabilizing places and 31 stable transitions
Computed a total of 32 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 132 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:12:57] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2024-06-01 08:12:57] [INFO ] Invariant cache hit.
[2024-06-01 08:12:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 08:12:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 08:12:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:12:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 08:12:57] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 08:12:57] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-01 08:12:57] [INFO ] [Nat]Added 109 Read/Feed constraints in 20 ms returned sat
[2024-06-01 08:12:57] [INFO ] Computed and/alt/rep : 116/176/116 causal constraints (skipped 78 transitions) in 17 ms.
[2024-06-01 08:12:57] [INFO ] Added : 35 causal constraints over 8 iterations in 118 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2941 reset in 105 ms.
Product exploration explored 100000 steps with 2941 reset in 108 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 201/201 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 108 transition count 197
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 8 place count 108 transition count 197
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 30 place count 108 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 107 transition count 196
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 107 transition count 196
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 107 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 107 transition count 211
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 57 place count 99 transition count 203
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 99 transition count 203
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 96 place count 99 transition count 172
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 99 place count 96 transition count 169
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 102 place count 96 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 96 transition count 167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 95 transition count 166
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 95 transition count 166
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 111 place count 95 transition count 161
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 116 place count 95 transition count 161
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 121 place count 90 transition count 156
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 126 place count 90 transition count 156
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 126 rules in 44 ms. Remains 90 /108 variables (removed 18) and now considering 156/201 (removed 45) transitions.
[2024-06-01 08:12:58] [INFO ] Redundant transitions in 4 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-01 08:12:58] [INFO ] Flow matrix only has 150 transitions (discarded 6 similar events)
// Phase 1: matrix 150 rows 90 cols
[2024-06-01 08:12:58] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:12:58] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 08:12:58] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:12:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:12:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 08:12:59] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:13:00] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:13:00] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:13:00] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:13:00] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:13:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 5 (OVERLAPS) 149/239 variables, 90/118 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 102/220 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/220 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/221 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/221 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/221 constraints. Problems are: Problem set: 55 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 221 constraints, problems are : Problem set: 55 solved, 100 unsolved in 4968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 55 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 41/90 variables, 2/2 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 26/28 constraints. Problems are: Problem set: 55 solved, 100 unsolved
[2024-06-01 08:13:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:13:03] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:13:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 3/31 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/31 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 149/239 variables, 90/121 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 102/223 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 100/323 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/323 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/240 variables, 1/324 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/324 constraints. Problems are: Problem set: 55 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/324 constraints. Problems are: Problem set: 55 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 324 constraints, problems are : Problem set: 55 solved, 100 unsolved in 4889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 100/155 constraints, Known Traps: 29/29 constraints]
After SMT, in 9922ms problems are : Problem set: 55 solved, 100 unsolved
Search for dead transitions found 55 dead transitions in 9934ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 90/108 places, 101/201 transitions.
Graph (complete) has 249 edges and 90 vertex of which 50 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 50 /90 variables (removed 40) and now considering 101/101 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/108 places, 101/201 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9998 ms. Remains : 50/108 places, 101/201 transitions.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 106 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 106 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 105 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 105 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 104 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 104 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 103 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 103 transition count 196
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 103 transition count 195
Applied a total of 11 rules in 5 ms. Remains 103 /108 variables (removed 5) and now considering 195/201 (removed 6) transitions.
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-06-01 08:13:08] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:13:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-06-01 08:13:08] [INFO ] Invariant cache hit.
[2024-06-01 08:13:08] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 08:13:08] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 195/201 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 10 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-06-01 08:13:08] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:13:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:13:08] [INFO ] Invariant cache hit.
[2024-06-01 08:13:08] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:13:08] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/108 places, 152/201 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 64/108 places, 152/201 transitions.
Treatment of property StigmergyCommit-PT-04a-LTLFireability-07 finished in 91359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 119 transition count 153
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 83 rules applied. Total rules applied 151 place count 52 transition count 137
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 164 place count 47 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 44 transition count 129
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 167 place count 44 transition count 123
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 179 place count 38 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 34 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 34 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 190 place count 34 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 190 place count 34 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 194 place count 32 transition count 112
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 196 place count 30 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 30 transition count 108
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 210 place count 30 transition count 96
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 224 place count 23 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 229 place count 23 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 7 with 47 rules applied. Total rules applied 276 place count 23 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 286 place count 18 transition count 31
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 291 place count 13 transition count 26
Applied a total of 291 rules in 13 ms. Remains 13 /121 variables (removed 108) and now considering 26/221 (removed 195) transitions.
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 13 cols
[2024-06-01 08:13:08] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:13:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:08] [INFO ] Invariant cache hit.
[2024-06-01 08:13:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:13:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 08:13:08] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 08:13:08] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:08] [INFO ] Invariant cache hit.
[2024-06-01 08:13:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 19/32 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 25 constraints, problems are : Problem set: 0 solved, 15 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 47 constraints, problems are : Problem set: 0 solved, 15 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 17/17 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/121 places, 26/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 13/121 places, 26/221 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-08 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 217
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 117 transition count 213
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 12 place count 117 transition count 186
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 66 place count 90 transition count 186
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 84 transition count 177
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 84 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 80 transition count 170
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 80 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 77 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 77 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 99 place count 77 transition count 160
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 123 place count 65 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 61 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 61 transition count 143
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 155 place count 61 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 157 place count 59 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 59 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 59 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 58 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 58 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 58 transition count 110
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 177 place count 53 transition count 105
Applied a total of 177 rules in 27 ms. Remains 53 /121 variables (removed 68) and now considering 105/221 (removed 116) transitions.
[2024-06-01 08:13:09] [INFO ] Flow matrix only has 99 transitions (discarded 6 similar events)
// Phase 1: matrix 99 rows 53 cols
[2024-06-01 08:13:09] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:13:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 08:13:09] [INFO ] Flow matrix only has 99 transitions (discarded 6 similar events)
[2024-06-01 08:13:09] [INFO ] Invariant cache hit.
[2024-06-01 08:13:09] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 08:13:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 08:13:09] [INFO ] Redundant transitions in 4 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-01 08:13:09] [INFO ] Flow matrix only has 99 transitions (discarded 6 similar events)
[2024-06-01 08:13:09] [INFO ] Invariant cache hit.
[2024-06-01 08:13:09] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:13:09] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:13:10] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 98/151 variables, 53/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 85/167 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:13:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/152 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 169 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:13:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 98/151 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 85/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 104/273 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 274 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 29/29 constraints]
After SMT, in 8454ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 8455ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/121 places, 105/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8599 ms. Remains : 53/121 places, 105/221 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (597 resets) in 173 ms. (229 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (112 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 99 transitions (discarded 6 similar events)
[2024-06-01 08:13:18] [INFO ] Invariant cache hit.
[2024-06-01 08:13:18] [INFO ] State equation strengthened by 86 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) 46/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 151/152 variables, and 55 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04a-LTLFireability-09 finished in 9087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G(p1)))))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 116 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 116 transition count 214
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 112 transition count 208
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 112 transition count 208
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 110 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 110 transition count 206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 108 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 108 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 107 transition count 202
Applied a total of 29 rules in 8 ms. Remains 107 /121 variables (removed 14) and now considering 202/221 (removed 19) transitions.
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 195 transitions (discarded 7 similar events)
// Phase 1: matrix 195 rows 107 cols
[2024-06-01 08:13:18] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:13:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 195 transitions (discarded 7 similar events)
[2024-06-01 08:13:18] [INFO ] Invariant cache hit.
[2024-06-01 08:13:18] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 08:13:18] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 198 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/121 places, 202/221 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 93 transition count 189
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 93 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 93 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 88 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 88 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 83 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 83 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 78 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 78 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 73 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 73 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 69 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 69 transition count 160
Applied a total of 79 rules in 8 ms. Remains 69 /106 variables (removed 37) and now considering 160/202 (removed 42) transitions.
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 153 transitions (discarded 7 similar events)
// Phase 1: matrix 153 rows 69 cols
[2024-06-01 08:13:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:13:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 153 transitions (discarded 7 similar events)
[2024-06-01 08:13:18] [INFO ] Invariant cache hit.
[2024-06-01 08:13:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:13:18] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 69/121 places, 160/221 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 309 ms. Remains : 69/121 places, 160/221 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-10
Stuttering criterion allowed to conclude after 209 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-10 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 119 transition count 156
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 79 rules applied. Total rules applied 144 place count 55 transition count 141
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 156 place count 50 transition count 134
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 159 place count 48 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 47 transition count 133
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 160 place count 47 transition count 127
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 172 place count 41 transition count 127
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 178 place count 35 transition count 118
Iterating global reduction 5 with 6 rules applied. Total rules applied 184 place count 35 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 187 place count 35 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 187 place count 35 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 191 place count 33 transition count 113
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 194 place count 30 transition count 107
Iterating global reduction 6 with 3 rules applied. Total rules applied 197 place count 30 transition count 107
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 225 place count 30 transition count 79
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 239 place count 23 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 243 place count 23 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 245 place count 22 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 246 place count 22 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 9 with 35 rules applied. Total rules applied 281 place count 22 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 291 place count 17 transition count 25
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 295 place count 13 transition count 21
Applied a total of 295 rules in 16 ms. Remains 13 /121 variables (removed 108) and now considering 21/221 (removed 200) transitions.
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
// Phase 1: matrix 16 rows 13 cols
[2024-06-01 08:13:18] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:13:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2024-06-01 08:13:18] [INFO ] Invariant cache hit.
[2024-06-01 08:13:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:13:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 08:13:18] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 08:13:18] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2024-06-01 08:13:18] [INFO ] Invariant cache hit.
[2024-06-01 08:13:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:13:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/28 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 15/28 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/29 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/29 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 52 constraints, problems are : Problem set: 0 solved, 13 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 24/24 constraints]
After SMT, in 835ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 835ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/121 places, 21/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 914 ms. Remains : 13/121 places, 21/221 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 42 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-11 finished in 1013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 119 transition count 153
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 83 rules applied. Total rules applied 151 place count 52 transition count 137
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 164 place count 47 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 44 transition count 129
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 167 place count 44 transition count 123
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 179 place count 38 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 34 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 34 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 190 place count 34 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 190 place count 34 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 194 place count 32 transition count 112
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 196 place count 30 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 30 transition count 108
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 210 place count 30 transition count 96
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 224 place count 23 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 229 place count 23 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 7 with 47 rules applied. Total rules applied 276 place count 23 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 286 place count 18 transition count 31
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 291 place count 13 transition count 26
Applied a total of 291 rules in 19 ms. Remains 13 /121 variables (removed 108) and now considering 26/221 (removed 195) transitions.
[2024-06-01 08:13:19] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 13 cols
[2024-06-01 08:13:19] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:13:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:13:19] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:19] [INFO ] Invariant cache hit.
[2024-06-01 08:13:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:13:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 08:13:19] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 08:13:19] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:19] [INFO ] Invariant cache hit.
[2024-06-01 08:13:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:19] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:13:20] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 19/32 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 18/18 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/121 places, 26/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 737 ms. Remains : 13/121 places, 26/221 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 39 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 178 steps (28 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 1 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-06-01 08:13:21] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:21] [INFO ] Invariant cache hit.
[2024-06-01 08:13:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:13:21] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:21] [INFO ] Invariant cache hit.
[2024-06-01 08:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:13:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 08:13:21] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 08:13:21] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-01 08:13:21] [INFO ] Invariant cache hit.
[2024-06-01 08:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:21] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 19/32 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 19/32 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 18/18 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 651ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 707 ms. Remains : 13/13 places, 26/26 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 138 steps (12 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 39 ms.
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-13 finished in 2467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 115 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 115 transition count 212
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 110 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 108 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 108 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 104 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 104 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 104 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 103 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 103 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 103 transition count 195
Applied a total of 38 rules in 7 ms. Remains 103 /121 variables (removed 18) and now considering 195/221 (removed 26) transitions.
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-06-01 08:13:22] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:13:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-06-01 08:13:22] [INFO ] Invariant cache hit.
[2024-06-01 08:13:22] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 08:13:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/121 places, 195/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 3 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-06-01 08:13:22] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:13:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-06-01 08:13:22] [INFO ] Invariant cache hit.
[2024-06-01 08:13:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:13:22] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/121 places, 152/221 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 274 ms. Remains : 64/121 places, 152/221 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-14 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 119 transition count 158
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 77 rules applied. Total rules applied 140 place count 57 transition count 143
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 148 place count 53 transition count 139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 148 place count 53 transition count 129
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 168 place count 43 transition count 129
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 178 place count 33 transition count 116
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 33 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 192 place count 33 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 192 place count 33 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 31 transition count 110
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 28 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 28 transition count 104
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 230 place count 28 transition count 76
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 242 place count 22 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 247 place count 22 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 257 place count 17 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 16 transition count 58
Applied a total of 258 rules in 19 ms. Remains 16 /121 variables (removed 105) and now considering 58/221 (removed 163) transitions.
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2024-06-01 08:13:22] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:13:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 08:13:22] [INFO ] Invariant cache hit.
[2024-06-01 08:13:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 08:13:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-01 08:13:22] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 08:13:22] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 08:13:22] [INFO ] Invariant cache hit.
[2024-06-01 08:13:22] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:13:22] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:13:22] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:13:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:13:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:13:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:13:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:13:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 08:13:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:13:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2469ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/121 places, 58/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2560 ms. Remains : 16/121 places, 58/221 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLFireability-15
Stuttering criterion allowed to conclude after 156 steps with 25 reset in 2 ms.
FORMULA StigmergyCommit-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLFireability-15 finished in 2641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(!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) U X((F(p0)||G(p1)))))'
[2024-06-01 08:13:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 08:13:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 08:13:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 221 transitions and 1085 arcs took 3 ms.
Total runtime 278413 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-04a-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04a-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717229606433

--------------------
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
mcc2024
ltl formula name StigmergyCommit-PT-04a-LTLFireability-06
ltl formula formula --ltl=/tmp/3863/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 121 places, 221 transitions and 1085 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3863/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3863/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3863/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3863/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 123 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 122, there are 256 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~34 levels ~10000 states ~180620 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~20000 states ~382856 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21610
pnml2lts-mc( 0/ 4): unique states count: 21610
pnml2lts-mc( 0/ 4): unique transitions count: 415521
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 396234
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21885
pnml2lts-mc( 0/ 4): - cum. max stack depth: 133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21885 states 421836 transitions, fanout: 19.275
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95152, Transitions per second: 1834070
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 8.2 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 221 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-04a-LTLFireability-07
ltl formula formula --ltl=/tmp/3863/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 121 places, 221 transitions and 1085 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3863/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3863/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3863/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3863/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 123 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 122, there are 302 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~33 levels ~10000 states ~149712 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~20000 states ~362428 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21610
pnml2lts-mc( 0/ 4): unique states count: 21610
pnml2lts-mc( 0/ 4): unique transitions count: 415525
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 394958
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21783
pnml2lts-mc( 0/ 4): - cum. max stack depth: 131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21783 states 419525 transitions, fanout: 19.259
pnml2lts-mc( 0/ 4): Total exploration time 0.210 sec (0.190 sec minimum, 0.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 103729, Transitions per second: 1997738
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 8.2 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 221 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-04a, 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 r536-tall-171690531600124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04a.tgz
mv StigmergyCommit-PT-04a 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 ;