fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690529700164
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for StigmergyCommit-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15935.756 3470202.00 5362804.00 7443.80 T??TF?FFTFFTFFTF 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.r399-tall-171690529700164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529700164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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-06b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716990431090

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:47:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 13:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:47:12] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2024-05-29 13:47:12] [INFO ] Transformed 2140 places.
[2024-05-29 13:47:12] [INFO ] Transformed 6760 transitions.
[2024-05-29 13:47:12] [INFO ] Found NUPN structural information;
[2024-05-29 13:47:12] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 557 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-06b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 1970 transition count 6590
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 1970 transition count 6590
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 445 place count 1865 transition count 6485
Iterating global reduction 0 with 105 rules applied. Total rules applied 550 place count 1865 transition count 6485
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 612 place count 1803 transition count 6423
Iterating global reduction 0 with 62 rules applied. Total rules applied 674 place count 1803 transition count 6423
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 728 place count 1749 transition count 6369
Iterating global reduction 0 with 54 rules applied. Total rules applied 782 place count 1749 transition count 6369
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 828 place count 1703 transition count 6323
Iterating global reduction 0 with 46 rules applied. Total rules applied 874 place count 1703 transition count 6323
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 918 place count 1659 transition count 6279
Iterating global reduction 0 with 44 rules applied. Total rules applied 962 place count 1659 transition count 6279
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 1006 place count 1615 transition count 6235
Iterating global reduction 0 with 44 rules applied. Total rules applied 1050 place count 1615 transition count 6235
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 1094 place count 1571 transition count 6191
Iterating global reduction 0 with 44 rules applied. Total rules applied 1138 place count 1571 transition count 6191
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1177 place count 1532 transition count 6152
Iterating global reduction 0 with 39 rules applied. Total rules applied 1216 place count 1532 transition count 6152
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 1248 place count 1500 transition count 6120
Iterating global reduction 0 with 32 rules applied. Total rules applied 1280 place count 1500 transition count 6120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1286 place count 1500 transition count 6114
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 1298 place count 1488 transition count 6102
Iterating global reduction 1 with 12 rules applied. Total rules applied 1310 place count 1488 transition count 6102
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 1322 place count 1476 transition count 6090
Iterating global reduction 1 with 12 rules applied. Total rules applied 1334 place count 1476 transition count 6090
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1340 place count 1470 transition count 6084
Iterating global reduction 1 with 6 rules applied. Total rules applied 1346 place count 1470 transition count 6084
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1352 place count 1464 transition count 6078
Iterating global reduction 1 with 6 rules applied. Total rules applied 1358 place count 1464 transition count 6078
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1364 place count 1458 transition count 6072
Iterating global reduction 1 with 6 rules applied. Total rules applied 1370 place count 1458 transition count 6072
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1375 place count 1453 transition count 6067
Iterating global reduction 1 with 5 rules applied. Total rules applied 1380 place count 1453 transition count 6067
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1384 place count 1449 transition count 6063
Iterating global reduction 1 with 4 rules applied. Total rules applied 1388 place count 1449 transition count 6063
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1392 place count 1445 transition count 6059
Iterating global reduction 1 with 4 rules applied. Total rules applied 1396 place count 1445 transition count 6059
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1400 place count 1441 transition count 6055
Iterating global reduction 1 with 4 rules applied. Total rules applied 1404 place count 1441 transition count 6055
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1408 place count 1437 transition count 6051
Iterating global reduction 1 with 4 rules applied. Total rules applied 1412 place count 1437 transition count 6051
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1416 place count 1433 transition count 6047
Iterating global reduction 1 with 4 rules applied. Total rules applied 1420 place count 1433 transition count 6047
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1424 place count 1429 transition count 6043
Iterating global reduction 1 with 4 rules applied. Total rules applied 1428 place count 1429 transition count 6043
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1432 place count 1429 transition count 6039
Applied a total of 1432 rules in 2286 ms. Remains 1429 /2140 variables (removed 711) and now considering 6039/6760 (removed 721) transitions.
// Phase 1: matrix 6039 rows 1429 cols
[2024-05-29 13:47:15] [INFO ] Computed 8 invariants in 133 ms
[2024-05-29 13:47:15] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-29 13:47:15] [INFO ] Invariant cache hit.
[2024-05-29 13:47:18] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned []
Implicit Place search using SMT with State Equation took 2624 ms to find 0 implicit places.
Running 6038 sub problems to find dead transitions.
[2024-05-29 13:47:18] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/7468 variables, and 0 constraints, problems are : Problem set: 0 solved, 6038 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1429 constraints, PredecessorRefiner: 6038/1650 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6038 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/7468 variables, and 0 constraints, problems are : Problem set: 0 solved, 6038 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1429 constraints, PredecessorRefiner: 4388/1650 constraints, Known Traps: 0/0 constraints]
After SMT, in 122073ms problems are : Problem set: 0 solved, 6038 unsolved
Search for dead transitions found 0 dead transitions in 122179ms
Starting structural reductions in LTL mode, iteration 1 : 1429/2140 places, 6039/6760 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127144 ms. Remains : 1429/2140 places, 6039/6760 transitions.
Support contains 54 out of 1429 places after structural reductions.
[2024-05-29 13:49:21] [INFO ] Flatten gal took : 728 ms
[2024-05-29 13:49:21] [INFO ] Flatten gal took : 374 ms
[2024-05-29 13:49:22] [INFO ] Input system was already deterministic with 6039 transitions.
Support contains 53 out of 1429 places (down from 54) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (304 resets) in 2041 ms. (19 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
[2024-05-29 13:49:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 1379/1429 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1429 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 6039/7468 variables, 1429/1437 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7468/7468 variables, and 1437 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1429/1429 constraints, PredecessorRefiner: 27/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1379/1429 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1429 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 6039/7468 variables, 1429/1437 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7468 variables, 6/1443 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7468/7468 variables, and 1443 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1429/1429 constraints, PredecessorRefiner: 26/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 10539ms problems are : Problem set: 1 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1369 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 11 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2585 edges and 1331 vertex of which 1324 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.76 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 949 transitions
Trivial Post-agglo rules discarded 949 transitions
Performed 949 trivial Post agglomeration. Transition count delta: 949
Iterating post reduction 0 with 956 rules applied. Total rules applied 958 place count 1324 transition count 4950
Reduce places removed 949 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 971 rules applied. Total rules applied 1929 place count 375 transition count 4928
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 1939 place count 368 transition count 4925
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1942 place count 365 transition count 4925
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 1942 place count 365 transition count 4842
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 2108 place count 282 transition count 4842
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2109 place count 282 transition count 4841
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2209 place count 232 transition count 4791
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2222 place count 232 transition count 4778
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 2248 place count 206 transition count 4739
Iterating global reduction 6 with 26 rules applied. Total rules applied 2274 place count 206 transition count 4739
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2279 place count 206 transition count 4734
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2299 place count 186 transition count 4714
Iterating global reduction 7 with 20 rules applied. Total rules applied 2319 place count 186 transition count 4714
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2333 place count 172 transition count 4700
Iterating global reduction 7 with 14 rules applied. Total rules applied 2347 place count 172 transition count 4700
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2354 place count 172 transition count 4693
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2370 place count 164 transition count 4685
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2376 place count 161 transition count 4693
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 2431 place count 161 transition count 4638
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 2486 place count 106 transition count 4638
Drop transitions (Redundant composition of simpler transitions.) removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 9 with 127 rules applied. Total rules applied 2613 place count 106 transition count 4511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2615 place count 105 transition count 4510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2617 place count 104 transition count 4513
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2620 place count 104 transition count 4510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2623 place count 101 transition count 4510
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2630 place count 101 transition count 4510
Applied a total of 2630 rules in 1722 ms. Remains 101 /1429 variables (removed 1328) and now considering 4510/6039 (removed 1529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1723 ms. Remains : 101/1429 places, 4510/6039 transitions.
RANDOM walk for 40000 steps (2405 resets) in 1219 ms. (32 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (22 resets) in 29 ms. (133 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (26 resets) in 31 ms. (125 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (22 resets) in 21 ms. (182 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 26 ms. (148 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (18 resets) in 28 ms. (138 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4002 steps (18 resets) in 58 ms. (67 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4002 steps (23 resets) in 11 ms. (333 steps per ms) remains 7/8 properties
// Phase 1: matrix 4510 rows 101 cols
[2024-05-29 13:49:36] [INFO ] Computed 8 invariants in 37 ms
[2024-05-29 13:49:36] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 83/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4510/4611 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4611 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4611 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/4611 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4611/4611 variables, and 114 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 83/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4510/4611 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4611 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4611 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4611 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 13:49:40] [INFO ] Deduced a trap composed of 23 places in 1172 ms of which 8 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/4611 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4611 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/4611 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4611/4611 variables, and 120 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 5943ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 5 properties in 595 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 4510/4510 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 101 transition count 4506
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 97 transition count 4506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 97 transition count 4505
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 96 transition count 4505
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 25 place count 81 transition count 386
Iterating global reduction 2 with 15 rules applied. Total rules applied 40 place count 81 transition count 386
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 54 place count 81 transition count 372
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 78 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 78 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 77 transition count 365
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 77 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 70 place count 77 transition count 360
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 76 transition count 358
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 76 transition count 358
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 101 place count 76 transition count 329
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 4 with 158 rules applied. Total rules applied 259 place count 47 transition count 200
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 266 place count 40 transition count 193
Iterating global reduction 5 with 7 rules applied. Total rules applied 273 place count 40 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 40 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 40 transition count 192
Applied a total of 275 rules in 179 ms. Remains 40 /101 variables (removed 61) and now considering 192/4510 (removed 4318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 40/101 places, 192/4510 transitions.
RANDOM walk for 2182 steps (0 resets) in 180 ms. (12 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA StigmergyCommit-PT-06b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 287 stabilizing places and 301 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p1&&(p2||X(X(p1))))))||p0)))'
Support contains 11 out of 1429 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1422 transition count 6032
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1422 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1415 transition count 6025
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1415 transition count 6025
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1408 transition count 6018
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1408 transition count 6018
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1401 transition count 6011
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1401 transition count 6011
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1395 transition count 6005
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1395 transition count 6005
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1389 transition count 5999
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1389 transition count 5999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 1389 transition count 5998
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 1384 transition count 5993
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 1384 transition count 5993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 1384 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1383 transition count 5990
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1383 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1382 transition count 5989
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 1374 transition count 5980
Applied a total of 114 rules in 1366 ms. Remains 1374 /1429 variables (removed 55) and now considering 5980/6039 (removed 59) transitions.
// Phase 1: matrix 5980 rows 1374 cols
[2024-05-29 13:49:45] [INFO ] Computed 8 invariants in 73 ms
[2024-05-29 13:49:46] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2024-05-29 13:49:46] [INFO ] Invariant cache hit.
[2024-05-29 13:49:49] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 4473 ms to find 0 implicit places.
Running 5979 sub problems to find dead transitions.
[2024-05-29 13:49:49] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)timeout

(s956 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1373/7354 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 5979/1591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1373/7354 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 4388/1591 constraints, Known Traps: 0/0 constraints]
After SMT, in 125304ms problems are : Problem set: 0 solved, 5979 unsolved
Search for dead transitions found 0 dead transitions in 125367ms
Starting structural reductions in LTL mode, iteration 1 : 1374/1429 places, 5980/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131240 ms. Remains : 1374/1429 places, 5980/6039 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 619 ms.
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-00 finished in 132942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0 U p1))||F(G(p2))))'
Support contains 15 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1411 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 976 transitions
Trivial Post-agglo rules discarded 976 transitions
Performed 976 trivial Post agglomeration. Transition count delta: 976
Iterating post reduction 0 with 976 rules applied. Total rules applied 977 place count 1330 transition count 4950
Reduce places removed 976 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 998 rules applied. Total rules applied 1975 place count 354 transition count 4928
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1983 place count 347 transition count 4927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1984 place count 346 transition count 4927
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1984 place count 346 transition count 4852
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 2134 place count 271 transition count 4852
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2145 place count 260 transition count 4841
Iterating global reduction 4 with 11 rules applied. Total rules applied 2156 place count 260 transition count 4841
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2157 place count 260 transition count 4840
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2161 place count 256 transition count 4836
Iterating global reduction 5 with 4 rules applied. Total rules applied 2165 place count 256 transition count 4836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2167 place count 256 transition count 4834
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 2273 place count 203 transition count 4780
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 2301 place count 175 transition count 3289
Iterating global reduction 6 with 28 rules applied. Total rules applied 2329 place count 175 transition count 3289
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2336 place count 175 transition count 3282
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2358 place count 153 transition count 3253
Iterating global reduction 7 with 22 rules applied. Total rules applied 2380 place count 153 transition count 3253
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2402 place count 131 transition count 3224
Iterating global reduction 7 with 22 rules applied. Total rules applied 2424 place count 131 transition count 3224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2432 place count 131 transition count 3216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2454 place count 120 transition count 3223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2455 place count 119 transition count 3209
Iterating global reduction 8 with 1 rules applied. Total rules applied 2456 place count 119 transition count 3209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2457 place count 119 transition count 3208
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 2464 place count 119 transition count 3201
Applied a total of 2464 rules in 1406 ms. Remains 119 /1429 variables (removed 1310) and now considering 3201/6039 (removed 2838) transitions.
[2024-05-29 13:51:58] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
// Phase 1: matrix 3193 rows 119 cols
[2024-05-29 13:51:58] [INFO ] Computed 2 invariants in 48 ms
[2024-05-29 13:51:58] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-29 13:51:58] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:51:58] [INFO ] Invariant cache hit.
[2024-05-29 13:51:59] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:52:00] [INFO ] Implicit Places using invariants and state equation in 2323 ms returned []
Implicit Place search using SMT with State Equation took 2932 ms to find 0 implicit places.
[2024-05-29 13:52:01] [INFO ] Redundant transitions in 237 ms returned []
Running 3184 sub problems to find dead transitions.
[2024-05-29 13:52:01] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:52:01] [INFO ] Invariant cache hit.
[2024-05-29 13:52:01] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
[2024-05-29 13:53:01] [INFO ] Deduced a trap composed of 19 places in 1019 ms of which 5 ms to minimize.
[2024-05-29 13:53:02] [INFO ] Deduced a trap composed of 27 places in 1019 ms of which 8 ms to minimize.
[2024-05-29 13:53:03] [INFO ] Deduced a trap composed of 28 places in 984 ms of which 1 ms to minimize.
[2024-05-29 13:53:04] [INFO ] Deduced a trap composed of 36 places in 947 ms of which 1 ms to minimize.
[2024-05-29 13:53:05] [INFO ] Deduced a trap composed of 19 places in 978 ms of which 1 ms to minimize.
[2024-05-29 13:53:06] [INFO ] Deduced a trap composed of 35 places in 973 ms of which 1 ms to minimize.
[2024-05-29 13:53:07] [INFO ] Deduced a trap composed of 29 places in 947 ms of which 1 ms to minimize.
[2024-05-29 13:53:08] [INFO ] Deduced a trap composed of 26 places in 921 ms of which 1 ms to minimize.
[2024-05-29 13:53:09] [INFO ] Deduced a trap composed of 31 places in 915 ms of which 1 ms to minimize.
[2024-05-29 13:53:10] [INFO ] Deduced a trap composed of 24 places in 879 ms of which 1 ms to minimize.
[2024-05-29 13:53:11] [INFO ] Deduced a trap composed of 30 places in 977 ms of which 3 ms to minimize.
SMT process timed out in 70314ms, After SMT, problems are : Problem set: 0 solved, 3184 unsolved
Search for dead transitions found 0 dead transitions in 70343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1429 places, 3201/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74938 ms. Remains : 119/1429 places, 3201/6039 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-01
Product exploration explored 100000 steps with 7354 reset in 518 ms.
Product exploration explored 100000 steps with 7369 reset in 626 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (OR p1 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0) p2)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2936 resets) in 1490 ms. (26 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (232 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (242 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (235 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
[2024-05-29 13:53:13] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:53:13] [INFO ] Invariant cache hit.
[2024-05-29 13:53:14] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9247ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Graph (complete) has 791 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 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 0 with 17 rules applied. Total rules applied 18 place count 118 transition count 3183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 116 transition count 3183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 109 transition count 3176
Free-agglomeration rule applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 82 place count 109 transition count 3128
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 89 rules applied. Total rules applied 171 place count 60 transition count 3088
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 178 place count 53 transition count 3088
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 185 place count 46 transition count 3081
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 46 transition count 3081
Performed 14 Post agglomeration using F-continuation condition with reduction of 2069 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 220 place count 32 transition count 998
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 585 transitions
Reduce isomorphic transitions removed 592 transitions.
Iterating post reduction 4 with 592 rules applied. Total rules applied 812 place count 32 transition count 406
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 815 place count 29 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 818 place count 29 transition count 403
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 832 place count 22 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 839 place count 22 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 840 place count 21 transition count 268
Applied a total of 840 rules in 345 ms. Remains 21 /119 variables (removed 98) and now considering 268/3201 (removed 2933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 21/119 places, 268/3201 transitions.
RANDOM walk for 14502 steps (1667 resets) in 111 ms. (129 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (OR p1 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0) p2)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 414 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 15 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Applied a total of 0 rules in 151 ms. Remains 119 /119 variables (removed 0) and now considering 3201/3201 (removed 0) transitions.
[2024-05-29 13:53:24] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:53:24] [INFO ] Invariant cache hit.
[2024-05-29 13:53:24] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-29 13:53:24] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:53:24] [INFO ] Invariant cache hit.
[2024-05-29 13:53:25] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:53:27] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 2890 ms to find 0 implicit places.
[2024-05-29 13:53:27] [INFO ] Redundant transitions in 117 ms returned []
Running 3184 sub problems to find dead transitions.
[2024-05-29 13:53:27] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:53:27] [INFO ] Invariant cache hit.
[2024-05-29 13:53:27] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
[2024-05-29 13:54:26] [INFO ] Deduced a trap composed of 19 places in 1042 ms of which 5 ms to minimize.
[2024-05-29 13:54:27] [INFO ] Deduced a trap composed of 27 places in 999 ms of which 1 ms to minimize.
[2024-05-29 13:54:28] [INFO ] Deduced a trap composed of 28 places in 989 ms of which 1 ms to minimize.
[2024-05-29 13:54:29] [INFO ] Deduced a trap composed of 36 places in 988 ms of which 1 ms to minimize.
[2024-05-29 13:54:30] [INFO ] Deduced a trap composed of 19 places in 968 ms of which 1 ms to minimize.
[2024-05-29 13:54:31] [INFO ] Deduced a trap composed of 35 places in 956 ms of which 1 ms to minimize.
[2024-05-29 13:54:32] [INFO ] Deduced a trap composed of 29 places in 962 ms of which 1 ms to minimize.
[2024-05-29 13:54:33] [INFO ] Deduced a trap composed of 26 places in 926 ms of which 0 ms to minimize.
[2024-05-29 13:54:34] [INFO ] Deduced a trap composed of 31 places in 902 ms of which 1 ms to minimize.
[2024-05-29 13:54:35] [INFO ] Deduced a trap composed of 24 places in 870 ms of which 1 ms to minimize.
[2024-05-29 13:54:36] [INFO ] Deduced a trap composed of 30 places in 1113 ms of which 1 ms to minimize.
[2024-05-29 13:54:37] [INFO ] Deduced a trap composed of 36 places in 916 ms of which 0 ms to minimize.
SMT process timed out in 70325ms, After SMT, problems are : Problem set: 0 solved, 3184 unsolved
Search for dead transitions found 0 dead transitions in 70353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73524 ms. Remains : 119/119 places, 3201/3201 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 141 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2938 resets) in 394 ms. (101 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (244 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (245 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (242 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
[2024-05-29 13:54:38] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:54:38] [INFO ] Invariant cache hit.
[2024-05-29 13:54:38] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4538 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9122ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Graph (complete) has 791 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 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 0 with 17 rules applied. Total rules applied 18 place count 118 transition count 3183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 116 transition count 3183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 109 transition count 3176
Free-agglomeration rule applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 82 place count 109 transition count 3128
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 89 rules applied. Total rules applied 171 place count 60 transition count 3088
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 178 place count 53 transition count 3088
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 185 place count 46 transition count 3081
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 46 transition count 3081
Performed 14 Post agglomeration using F-continuation condition with reduction of 2069 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 220 place count 32 transition count 998
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 585 transitions
Reduce isomorphic transitions removed 592 transitions.
Iterating post reduction 4 with 592 rules applied. Total rules applied 812 place count 32 transition count 406
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 815 place count 29 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 818 place count 29 transition count 403
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 832 place count 22 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 839 place count 22 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 840 place count 21 transition count 268
Applied a total of 840 rules in 355 ms. Remains 21 /119 variables (removed 98) and now considering 268/3201 (removed 2933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 21/119 places, 268/3201 transitions.
RANDOM walk for 12929 steps (1500 resets) in 112 ms. (114 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 361 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7340 reset in 468 ms.
Product exploration explored 100000 steps with 7339 reset in 515 ms.
Support contains 15 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Applied a total of 0 rules in 148 ms. Remains 119 /119 variables (removed 0) and now considering 3201/3201 (removed 0) transitions.
[2024-05-29 13:54:49] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:54:49] [INFO ] Invariant cache hit.
[2024-05-29 13:54:50] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-05-29 13:54:50] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:54:50] [INFO ] Invariant cache hit.
[2024-05-29 13:54:50] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:54:52] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 2936 ms to find 0 implicit places.
[2024-05-29 13:54:52] [INFO ] Redundant transitions in 209 ms returned []
Running 3184 sub problems to find dead transitions.
[2024-05-29 13:54:52] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:54:52] [INFO ] Invariant cache hit.
[2024-05-29 13:54:52] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
[2024-05-29 13:55:52] [INFO ] Deduced a trap composed of 19 places in 1071 ms of which 4 ms to minimize.
[2024-05-29 13:55:53] [INFO ] Deduced a trap composed of 27 places in 957 ms of which 1 ms to minimize.
[2024-05-29 13:55:54] [INFO ] Deduced a trap composed of 28 places in 958 ms of which 0 ms to minimize.
[2024-05-29 13:55:55] [INFO ] Deduced a trap composed of 36 places in 938 ms of which 3 ms to minimize.
[2024-05-29 13:55:56] [INFO ] Deduced a trap composed of 19 places in 939 ms of which 1 ms to minimize.
[2024-05-29 13:55:57] [INFO ] Deduced a trap composed of 35 places in 931 ms of which 1 ms to minimize.
[2024-05-29 13:55:58] [INFO ] Deduced a trap composed of 29 places in 938 ms of which 1 ms to minimize.
[2024-05-29 13:55:59] [INFO ] Deduced a trap composed of 26 places in 892 ms of which 1 ms to minimize.
[2024-05-29 13:56:00] [INFO ] Deduced a trap composed of 31 places in 910 ms of which 1 ms to minimize.
[2024-05-29 13:56:01] [INFO ] Deduced a trap composed of 24 places in 864 ms of which 1 ms to minimize.
[2024-05-29 13:56:02] [INFO ] Deduced a trap composed of 30 places in 959 ms of which 1 ms to minimize.
[2024-05-29 13:56:03] [INFO ] Deduced a trap composed of 36 places in 924 ms of which 1 ms to minimize.
SMT process timed out in 70307ms, After SMT, problems are : Problem set: 0 solved, 3184 unsolved
Search for dead transitions found 0 dead transitions in 70335ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73641 ms. Remains : 119/119 places, 3201/3201 transitions.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-01 finished in 247040 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)||(X((G(!p0)||(!p0&&F(!p2))))&&p1))))'
Support contains 20 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 1310 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 13:56:05] [INFO ] Computed 8 invariants in 100 ms
[2024-05-29 13:56:06] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-29 13:56:06] [INFO ] Invariant cache hit.
[2024-05-29 13:56:08] [INFO ] Implicit Places using invariants and state equation in 2865 ms returned []
Implicit Place search using SMT with State Equation took 3944 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:56:09] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 timeout
1.0)
(s965 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 119040ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 119090ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124364 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 120 ms :[p0, p0, (AND p0 p2)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 772 reset in 359 ms.
Product exploration explored 100000 steps with 778 reset in 420 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 116 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p0 p2)]
RANDOM walk for 40000 steps (307 resets) in 303 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (45 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (43 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (43 resets) in 694 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (44 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 98220 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 9
Probabilistic random walk after 98220 steps, saw 24519 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-29 13:58:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 1338/1358 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1338/1358 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 0)
(t3 0)
(t4 0)
(t5 0)
(t6 1)
(t7 1)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 1)
(t13 1)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 1)
(t23 1)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 1)
(t37 1)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 1)
(t47 1)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 1)
(t53 1)
(t54 0)
(t55 0)
(t56 1)
(t57 13)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 12)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 1)
(t77 1)
(t78 1)
(t79 1)
(t80 1)
(t81 1)
(t82 1)
(t83 1)
(t84 1)
(t85 1)
(t86 1)
(t87 1)
(t88 1)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 1)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 1)
(t154 1)
(t155 1)
(t156 1)
(t157 1)
(t158 1)
(t159 1)
(t160 1)
(t161 1)
(t162 1)
(t163 1)
(t164 1)
(t165 1)
(t166 1)
(t167 1)
(t168 1)
(t169 1)
(t170 1)
(t171 1)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 1)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 1)
(t238 1)
(t239 0)
(t240 1)
(t241 0)
(t242 0)
(t243 1)
(t244 1)
(t245 1)
(t246 1)
(t247 1)
(t248 1)
(t249 1)
(t250 1)
(t251 1)
(t252 1)
(t253 1)
(t254 1)
(t255 1)
(t256 1)
(t257 1)
(t258 1)
(t259 1)
(t260 1)
(t261 1)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 1)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 1)
(t298 1)
(t299 1)
(t300 1)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 1)
(t308 1)
(t309 1)
(t310 1)
(t311 1)
(t312 1)
(t313 1)
(t314 1)
(t315 1)
(t316 1)
(t317 1)
(t318 1)
(t319 1)
(t320 1)
(t321 1)
(t322 1)
(t323 1)
(t324 1)
(t325 1)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 1)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 1)
(t411 1)
(t412 0)
(t413 1)
(t414 0)
(t415 0)
(t416 1)
(t417 1)
(t418 1)
(t419 1)
(t420 1)
(t421 1)
(t422 1)
(t423 1)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 1)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 1)
(t500 1)
(t501 1)
(t502 1)
(t503 1)
(t504 1)
(t505 1)
(t506 1)
(t507 1)
(t508 1)
(t509 1)
(t510 1)
(t511 1)
(t512 1)
(t513 1)
(t514 1)
(t515 1)
(t516 1)
(t517 1)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 1)
(t585 0)
(t586 1)
(t587 0)
(t588 0)
(t589 1)
(t590 1)
(t591 1)
(t592 1)
(t593 1)
(t594 1)
(t595 1)
(t596 1)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 1)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 1)
(t651 1)
(t652 1)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 1)
(t758 0)
(t759 1)
(t760 0)
(t761 0)
(t762 1)
(t763 1)
(t764 1)
(t765 1)
(t766 1)
(t767 1)
(t768 1)
(t769 1)
(t770 1)
(t771 1)
(t772 1)
(t773 1)
(t774 1)
(t775 1)
(t776 1)
(t777 1)
(t778 1)
(t779 1)
(t780 1)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 1)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 1)
(t817 1)
(t818 1)
(t819 1)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 1)
(t827 1)
(t828 1)
(t829 1)
(t830 1)
(t831 1)
(t832 1)
(t833 1)
(t834 1)
(t835 1)
(t836 1)
(t837 1)
(t838 1)
(t839 1)
(t840 1)
(t841 1)
(t842 1)
(t843 1)
(t844 1)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 1)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 0)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 0)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 1)
(t930 1)
(t931 0)
(t932 1)
(t933 0)
(t934 0)
(t935 1)
(t936 1)
(t937 1)
(t938 1)
(t939 1)
(t940 1)
(t941 1)
(t942 1)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 0)
(t962 0)
(t963 0)
(t964 0)
(t965 1)
(t966 0)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10177ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 842 ms.
Support contains 14 out of 1372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1357 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 0 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 947 transitions
Trivial Post-agglo rules discarded 947 transitions
Performed 947 trivial Post agglomeration. Transition count delta: 947
Iterating post reduction 0 with 954 rules applied. Total rules applied 956 place count 1267 transition count 4891
Reduce places removed 947 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 968 rules applied. Total rules applied 1924 place count 320 transition count 4870
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1931 place count 313 transition count 4870
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1931 place count 313 transition count 4792
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2087 place count 235 transition count 4792
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2088 place count 235 transition count 4791
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2188 place count 185 transition count 4741
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2202 place count 185 transition count 4727
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 2237 place count 150 transition count 1607
Iterating global reduction 5 with 35 rules applied. Total rules applied 2272 place count 150 transition count 1607
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2286 place count 150 transition count 1593
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2307 place count 129 transition count 1572
Iterating global reduction 6 with 21 rules applied. Total rules applied 2328 place count 129 transition count 1572
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2342 place count 115 transition count 1558
Iterating global reduction 6 with 14 rules applied. Total rules applied 2356 place count 115 transition count 1558
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2363 place count 115 transition count 1551
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2377 place count 108 transition count 1544
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2383 place count 105 transition count 1552
Free-agglomeration rule applied 44 times.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2427 place count 105 transition count 1508
Reduce places removed 44 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2480 place count 61 transition count 1499
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2487 place count 54 transition count 1492
Iterating global reduction 8 with 7 rules applied. Total rules applied 2494 place count 54 transition count 1492
Drop transitions (Redundant composition of simpler transitions.) removed 186 transitions
Redundant transition composition rules discarded 186 transitions
Iterating global reduction 8 with 186 rules applied. Total rules applied 2680 place count 54 transition count 1306
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 2682 place count 53 transition count 1305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2686 place count 51 transition count 1323
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2689 place count 51 transition count 1320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2692 place count 48 transition count 1320
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2697 place count 48 transition count 1320
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2701 place count 48 transition count 1316
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2704 place count 45 transition count 1310
Iterating global reduction 9 with 3 rules applied. Total rules applied 2707 place count 45 transition count 1310
Applied a total of 2707 rules in 1350 ms. Remains 45 /1372 variables (removed 1327) and now considering 1310/5978 (removed 4668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1350 ms. Remains : 45/1372 places, 1310/5978 transitions.
RANDOM walk for 27696 steps (1310 resets) in 574 ms. (48 steps per ms) remains 0/5 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 20 factoid took 387 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Stuttering acceptance computed with spot in 155 ms :[p0, p0]
Support contains 14 out of 1372 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Applied a total of 0 rules in 79 ms. Remains 1372 /1372 variables (removed 0) and now considering 5978/5978 (removed 0) transitions.
[2024-05-29 13:58:26] [INFO ] Invariant cache hit.
[2024-05-29 13:58:27] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-29 13:58:27] [INFO ] Invariant cache hit.
[2024-05-29 13:58:29] [INFO ] Implicit Places using invariants and state equation in 2831 ms returned []
Implicit Place search using SMT with State Equation took 3649 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:58:30] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 118855ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 118905ms
Finished structural reductions in LTL mode , in 1 iterations and 122651 ms. Remains : 1372/1372 places, 5978/5978 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
RANDOM walk for 40000 steps (304 resets) in 649 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (43 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (45 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 126324 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 4
Probabilistic random walk after 126324 steps, saw 30515 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-29 14:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1344/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4486 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1344/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8608ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1329 ms.
Support contains 14 out of 1372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1357 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 947 transitions
Trivial Post-agglo rules discarded 947 transitions
Performed 947 trivial Post agglomeration. Transition count delta: 947
Iterating post reduction 0 with 954 rules applied. Total rules applied 956 place count 1267 transition count 4891
Reduce places removed 947 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 968 rules applied. Total rules applied 1924 place count 320 transition count 4870
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1931 place count 313 transition count 4870
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1931 place count 313 transition count 4792
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2087 place count 235 transition count 4792
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2088 place count 235 transition count 4791
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2188 place count 185 transition count 4741
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2202 place count 185 transition count 4727
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 2237 place count 150 transition count 1607
Iterating global reduction 5 with 35 rules applied. Total rules applied 2272 place count 150 transition count 1607
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2286 place count 150 transition count 1593
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2307 place count 129 transition count 1572
Iterating global reduction 6 with 21 rules applied. Total rules applied 2328 place count 129 transition count 1572
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2342 place count 115 transition count 1558
Iterating global reduction 6 with 14 rules applied. Total rules applied 2356 place count 115 transition count 1558
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2363 place count 115 transition count 1551
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2377 place count 108 transition count 1544
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2383 place count 105 transition count 1552
Free-agglomeration rule applied 44 times.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2427 place count 105 transition count 1508
Reduce places removed 44 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2480 place count 61 transition count 1499
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2487 place count 54 transition count 1492
Iterating global reduction 8 with 7 rules applied. Total rules applied 2494 place count 54 transition count 1492
Drop transitions (Redundant composition of simpler transitions.) removed 186 transitions
Redundant transition composition rules discarded 186 transitions
Iterating global reduction 8 with 186 rules applied. Total rules applied 2680 place count 54 transition count 1306
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 2682 place count 53 transition count 1305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2686 place count 51 transition count 1323
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2689 place count 51 transition count 1320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2692 place count 48 transition count 1320
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2697 place count 48 transition count 1320
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2701 place count 48 transition count 1316
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2704 place count 45 transition count 1310
Iterating global reduction 9 with 3 rules applied. Total rules applied 2707 place count 45 transition count 1310
Applied a total of 2707 rules in 1313 ms. Remains 45 /1372 variables (removed 1327) and now considering 1310/5978 (removed 4668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1313 ms. Remains : 45/1372 places, 1310/5978 transitions.
RANDOM walk for 19043 steps (886 resets) in 388 ms. (48 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Product exploration explored 100000 steps with 773 reset in 326 ms.
Product exploration explored 100000 steps with 774 reset in 394 ms.
Support contains 14 out of 1372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Applied a total of 0 rules in 78 ms. Remains 1372 /1372 variables (removed 0) and now considering 5978/5978 (removed 0) transitions.
[2024-05-29 14:00:45] [INFO ] Invariant cache hit.
[2024-05-29 14:00:46] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-29 14:00:46] [INFO ] Invariant cache hit.
[2024-05-29 14:00:49] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 4167 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 14:00:49] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 118891ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 118941ms
Finished structural reductions in LTL mode , in 1 iterations and 123208 ms. Remains : 1372/1372 places, 5978/5978 transitions.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-02 finished in 405358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||G(p1)))||G(p2)))'
Support contains 10 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1423 transition count 6033
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1423 transition count 6033
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1417 transition count 6027
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1417 transition count 6027
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1412 transition count 6022
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1412 transition count 6022
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1407 transition count 6017
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1407 transition count 6017
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1402 transition count 6012
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1402 transition count 6012
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1397 transition count 6007
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1397 transition count 6007
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1397 transition count 6006
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 1393 transition count 6002
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 1393 transition count 6002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 1393 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1392 transition count 6000
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1392 transition count 6000
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1391 transition count 5999
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1391 transition count 5999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1390 transition count 5998
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1390 transition count 5998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1389 transition count 5997
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1389 transition count 5997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1388 transition count 5996
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1388 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1387 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1387 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1386 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1386 transition count 5994
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1385 transition count 5993
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1385 transition count 5993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1384 transition count 5992
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1384 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 1383 transition count 5991
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 1383 transition count 5991
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1383 transition count 5990
Applied a total of 95 rules in 1358 ms. Remains 1383 /1429 variables (removed 46) and now considering 5990/6039 (removed 49) transitions.
// Phase 1: matrix 5990 rows 1383 cols
[2024-05-29 14:02:50] [INFO ] Computed 8 invariants in 89 ms
[2024-05-29 14:02:51] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-05-29 14:02:51] [INFO ] Invariant cache hit.
[2024-05-29 14:02:54] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 4260 ms to find 0 implicit places.
Running 5989 sub problems to find dead transitions.
[2024-05-29 14:02:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1382/7373 variables, and 0 constraints, problems are : Problem set: 0 solved, 5989 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1383 constraints, PredecessorRefiner: 5989/1601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5989 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1382/7373 variables, and 0 constraints, problems are : Problem set: 0 solved, 5989 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1383 constraints, PredecessorRefiner: 4388/1601 constraints, Known Traps: 0/0 constraints]
After SMT, in 118543ms problems are : Problem set: 0 solved, 5989 unsolved
Search for dead transitions found 0 dead transitions in 118592ms
Starting structural reductions in LTL mode, iteration 1 : 1383/1429 places, 5990/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124227 ms. Remains : 1383/1429 places, 5990/6039 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 982 steps with 7 reset in 4 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-04 finished in 124579 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 7 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1420 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 986 transitions
Trivial Post-agglo rules discarded 986 transitions
Performed 986 trivial Post agglomeration. Transition count delta: 986
Iterating post reduction 0 with 986 rules applied. Total rules applied 987 place count 1330 transition count 4940
Reduce places removed 986 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1008 rules applied. Total rules applied 1995 place count 344 transition count 4918
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 2002 place count 337 transition count 4918
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 2002 place count 337 transition count 4843
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2152 place count 262 transition count 4843
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2163 place count 251 transition count 4832
Iterating global reduction 3 with 11 rules applied. Total rules applied 2174 place count 251 transition count 4832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2175 place count 251 transition count 4831
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2179 place count 247 transition count 4827
Iterating global reduction 4 with 4 rules applied. Total rules applied 2183 place count 247 transition count 4827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2185 place count 247 transition count 4825
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2291 place count 194 transition count 4771
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2325 place count 160 transition count 1950
Iterating global reduction 5 with 34 rules applied. Total rules applied 2359 place count 160 transition count 1950
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2372 place count 160 transition count 1937
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2394 place count 138 transition count 1908
Iterating global reduction 6 with 22 rules applied. Total rules applied 2416 place count 138 transition count 1908
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2438 place count 116 transition count 1879
Iterating global reduction 6 with 22 rules applied. Total rules applied 2460 place count 116 transition count 1879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2468 place count 116 transition count 1871
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2490 place count 105 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2491 place count 104 transition count 1864
Iterating global reduction 7 with 1 rules applied. Total rules applied 2492 place count 104 transition count 1864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2493 place count 104 transition count 1863
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2500 place count 104 transition count 1856
Applied a total of 2500 rules in 527 ms. Remains 104 /1429 variables (removed 1325) and now considering 1856/6039 (removed 4183) transitions.
[2024-05-29 14:04:54] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
// Phase 1: matrix 1848 rows 104 cols
[2024-05-29 14:04:54] [INFO ] Computed 2 invariants in 17 ms
[2024-05-29 14:04:54] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 14:04:54] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:04:54] [INFO ] Invariant cache hit.
[2024-05-29 14:04:54] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:04:55] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2024-05-29 14:04:55] [INFO ] Redundant transitions in 39 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 14:04:55] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:04:55] [INFO ] Invariant cache hit.
[2024-05-29 14:04:55] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:05:26] [INFO ] Deduced a trap composed of 24 places in 579 ms of which 0 ms to minimize.
[2024-05-29 14:05:27] [INFO ] Deduced a trap composed of 16 places in 582 ms of which 1 ms to minimize.
[2024-05-29 14:05:27] [INFO ] Deduced a trap composed of 23 places in 548 ms of which 1 ms to minimize.
[2024-05-29 14:05:28] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 1 ms to minimize.
[2024-05-29 14:05:28] [INFO ] Deduced a trap composed of 16 places in 507 ms of which 1 ms to minimize.
[2024-05-29 14:05:29] [INFO ] Deduced a trap composed of 25 places in 517 ms of which 1 ms to minimize.
[2024-05-29 14:05:30] [INFO ] Deduced a trap composed of 17 places in 527 ms of which 1 ms to minimize.
[2024-05-29 14:05:30] [INFO ] Deduced a trap composed of 16 places in 478 ms of which 1 ms to minimize.
[2024-05-29 14:05:31] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 0 ms to minimize.
[2024-05-29 14:05:33] [INFO ] Deduced a trap composed of 16 places in 499 ms of which 1 ms to minimize.
[2024-05-29 14:05:40] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 0 ms to minimize.
[2024-05-29 14:05:41] [INFO ] Deduced a trap composed of 24 places in 398 ms of which 1 ms to minimize.
[2024-05-29 14:05:44] [INFO ] Deduced a trap composed of 24 places in 398 ms of which 0 ms to minimize.
[2024-05-29 14:05:45] [INFO ] Deduced a trap composed of 24 places in 539 ms of which 1 ms to minimize.
[2024-05-29 14:05:45] [INFO ] Deduced a trap composed of 28 places in 488 ms of which 1 ms to minimize.
[2024-05-29 14:05:46] [INFO ] Deduced a trap composed of 24 places in 473 ms of which 0 ms to minimize.
[2024-05-29 14:05:46] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
SMT process timed out in 51051ms, After SMT, problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 51068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/1429 places, 1856/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53214 ms. Remains : 104/1429 places, 1856/6039 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 7679 reset in 361 ms.
Product exploration explored 100000 steps with 7724 reset in 355 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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)]
RANDOM walk for 40000 steps (3093 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (256 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 730804 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 730804 steps, saw 129190 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2024-05-29 14:05:50] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:05:50] [INFO ] Invariant cache hit.
[2024-05-29 14:05:50] [INFO ] State equation strengthened by 127 read => feed constraints.
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) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2034ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 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 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 82 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 14:05:53] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:05:53] [INFO ] Invariant cache hit.
[2024-05-29 14:05:53] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-29 14:05:53] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:05:53] [INFO ] Invariant cache hit.
[2024-05-29 14:05:53] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:05:54] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2024-05-29 14:05:54] [INFO ] Redundant transitions in 38 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 14:05:54] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:05:54] [INFO ] Invariant cache hit.
[2024-05-29 14:05:54] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:06:25] [INFO ] Deduced a trap composed of 24 places in 558 ms of which 0 ms to minimize.
[2024-05-29 14:06:26] [INFO ] Deduced a trap composed of 16 places in 574 ms of which 1 ms to minimize.
[2024-05-29 14:06:26] [INFO ] Deduced a trap composed of 23 places in 559 ms of which 1 ms to minimize.
[2024-05-29 14:06:27] [INFO ] Deduced a trap composed of 16 places in 528 ms of which 1 ms to minimize.
[2024-05-29 14:06:28] [INFO ] Deduced a trap composed of 16 places in 512 ms of which 1 ms to minimize.
[2024-05-29 14:06:28] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 2 ms to minimize.
[2024-05-29 14:06:29] [INFO ] Deduced a trap composed of 17 places in 529 ms of which 1 ms to minimize.
[2024-05-29 14:06:29] [INFO ] Deduced a trap composed of 16 places in 590 ms of which 1 ms to minimize.
[2024-05-29 14:06:30] [INFO ] Deduced a trap composed of 17 places in 509 ms of which 1 ms to minimize.
[2024-05-29 14:06:32] [INFO ] Deduced a trap composed of 16 places in 505 ms of which 1 ms to minimize.
[2024-05-29 14:06:40] [INFO ] Deduced a trap composed of 27 places in 419 ms of which 1 ms to minimize.
[2024-05-29 14:06:40] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 0 ms to minimize.
[2024-05-29 14:06:44] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 1 ms to minimize.
[2024-05-29 14:06:45] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 0 ms to minimize.
[2024-05-29 14:06:45] [INFO ] Deduced a trap composed of 28 places in 496 ms of which 0 ms to minimize.
[2024-05-29 14:06:46] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 1 ms to minimize.
SMT process timed out in 51242ms, After SMT, problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 51258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52971 ms. Remains : 104/104 places, 1856/1856 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 40000 steps (3088 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (258 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727184 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727184 steps, saw 128396 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2024-05-29 14:06:49] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:06:49] [INFO ] Invariant cache hit.
[2024-05-29 14:06:49] [INFO ] State equation strengthened by 127 read => feed constraints.
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) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2004ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7658 reset in 351 ms.
Product exploration explored 100000 steps with 7698 reset in 358 ms.
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 75 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 14:06:52] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:06:52] [INFO ] Invariant cache hit.
[2024-05-29 14:06:52] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-29 14:06:52] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:06:52] [INFO ] Invariant cache hit.
[2024-05-29 14:06:52] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:06:53] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2024-05-29 14:06:53] [INFO ] Redundant transitions in 40 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 14:06:53] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:06:53] [INFO ] Invariant cache hit.
[2024-05-29 14:06:53] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:07:25] [INFO ] Deduced a trap composed of 24 places in 572 ms of which 1 ms to minimize.
[2024-05-29 14:07:25] [INFO ] Deduced a trap composed of 16 places in 588 ms of which 0 ms to minimize.
[2024-05-29 14:07:26] [INFO ] Deduced a trap composed of 23 places in 577 ms of which 1 ms to minimize.
[2024-05-29 14:07:26] [INFO ] Deduced a trap composed of 16 places in 520 ms of which 1 ms to minimize.
[2024-05-29 14:07:27] [INFO ] Deduced a trap composed of 16 places in 512 ms of which 0 ms to minimize.
[2024-05-29 14:07:27] [INFO ] Deduced a trap composed of 25 places in 520 ms of which 1 ms to minimize.
[2024-05-29 14:07:28] [INFO ] Deduced a trap composed of 17 places in 545 ms of which 0 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 16 places in 489 ms of which 0 ms to minimize.
[2024-05-29 14:07:29] [INFO ] Deduced a trap composed of 17 places in 468 ms of which 1 ms to minimize.
[2024-05-29 14:07:31] [INFO ] Deduced a trap composed of 16 places in 498 ms of which 0 ms to minimize.
[2024-05-29 14:07:39] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 1 ms to minimize.
[2024-05-29 14:07:39] [INFO ] Deduced a trap composed of 24 places in 421 ms of which 1 ms to minimize.
[2024-05-29 14:07:43] [INFO ] Deduced a trap composed of 24 places in 395 ms of which 1 ms to minimize.
[2024-05-29 14:07:44] [INFO ] Deduced a trap composed of 24 places in 548 ms of which 1 ms to minimize.
[2024-05-29 14:07:44] [INFO ] Deduced a trap composed of 28 places in 493 ms of which 0 ms to minimize.
[2024-05-29 14:07:45] [INFO ] Deduced a trap composed of 24 places in 462 ms of which 1 ms to minimize.
SMT process timed out in 51517ms, After SMT, problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 51532ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53240 ms. Remains : 104/104 places, 1856/1856 transitions.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-05 finished in 172206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1422 transition count 6032
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1422 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1415 transition count 6025
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1415 transition count 6025
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 1409 transition count 6019
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 1409 transition count 6019
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1403 transition count 6013
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1403 transition count 6013
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1398 transition count 6008
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1398 transition count 6008
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1393 transition count 6003
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1393 transition count 6003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1393 transition count 6002
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 1389 transition count 5998
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 1389 transition count 5998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1389 transition count 5996
Applied a total of 83 rules in 664 ms. Remains 1389 /1429 variables (removed 40) and now considering 5996/6039 (removed 43) transitions.
// Phase 1: matrix 5996 rows 1389 cols
[2024-05-29 14:07:46] [INFO ] Computed 8 invariants in 73 ms
[2024-05-29 14:07:47] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2024-05-29 14:07:47] [INFO ] Invariant cache hit.
[2024-05-29 14:07:51] [INFO ] Implicit Places using invariants and state equation in 3390 ms returned []
Implicit Place search using SMT with State Equation took 4858 ms to find 0 implicit places.
Running 5995 sub problems to find dead transitions.
[2024-05-29 14:07:51] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1388/7385 variables, and 0 constraints, problems are : Problem set: 0 solved, 5995 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1389 constraints, PredecessorRefiner: 5995/1607 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1388/7385 variables, and 0 constraints, problems are : Problem set: 0 solved, 5995 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1389 constraints, PredecessorRefiner: 4388/1607 constraints, Known Traps: 0/0 constraints]
After SMT, in 118336ms problems are : Problem set: 0 solved, 5995 unsolved
Search for dead transitions found 0 dead transitions in 118386ms
Starting structural reductions in LTL mode, iteration 1 : 1389/1429 places, 5996/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123923 ms. Remains : 1389/1429 places, 5996/6039 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-08 finished in 125247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X(G(!p1)))) U X(p2)))'
Support contains 21 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 1295 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 14:09:52] [INFO ] Computed 8 invariants in 68 ms
[2024-05-29 14:09:53] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-29 14:09:53] [INFO ] Invariant cache hit.
[2024-05-29 14:09:56] [INFO ] Implicit Places using invariants and state equation in 2787 ms returned []
Implicit Place search using SMT with State Equation took 3646 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 14:09:56] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 119647ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 119695ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124652 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR p1 p0), (OR (NOT p2) p0 p1), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-09
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-09 finished in 124929 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' '!(((p0 U X(p1))||X(G(p2))))'
Support contains 10 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1423 transition count 6033
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1423 transition count 6033
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1417 transition count 6027
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1417 transition count 6027
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1412 transition count 6022
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1412 transition count 6022
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1407 transition count 6017
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1407 transition count 6017
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1403 transition count 6013
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1403 transition count 6013
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1399 transition count 6009
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1399 transition count 6009
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 1399 transition count 6008
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1396 transition count 6005
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1396 transition count 6005
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1396 transition count 6004
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1395 transition count 6003
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1395 transition count 6003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1394 transition count 6002
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1394 transition count 6002
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1393 transition count 6001
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1393 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1392 transition count 6000
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1392 transition count 6000
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1391 transition count 5999
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1391 transition count 5999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1390 transition count 5998
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1390 transition count 5998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1389 transition count 5997
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1389 transition count 5997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1388 transition count 5996
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1388 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1387 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1387 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1386 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1386 transition count 5994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1386 transition count 5993
Applied a total of 89 rules in 1360 ms. Remains 1386 /1429 variables (removed 43) and now considering 5993/6039 (removed 46) transitions.
// Phase 1: matrix 5993 rows 1386 cols
[2024-05-29 14:11:57] [INFO ] Computed 8 invariants in 68 ms
[2024-05-29 14:11:58] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2024-05-29 14:11:58] [INFO ] Invariant cache hit.
[2024-05-29 14:12:01] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 4399 ms to find 0 implicit places.
Running 5992 sub problems to find dead transitions.
[2024-05-29 14:12:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1385/7379 variables, and 0 constraints, problems are : Problem set: 0 solved, 5992 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1386 constraints, PredecessorRefiner: 5992/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5992 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1385/7379 variables, and 0 constraints, problems are : Problem set: 0 solved, 5992 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1386 constraints, PredecessorRefiner: 4388/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 118402ms problems are : Problem set: 0 solved, 5992 unsolved
Search for dead transitions found 0 dead transitions in 118448ms
Starting structural reductions in LTL mode, iteration 1 : 1386/1429 places, 5993/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124272 ms. Remains : 1386/1429 places, 5993/6039 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-10 finished in 124569 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(F(p1))))))'
Support contains 11 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 1327 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 14:14:01] [INFO ] Computed 8 invariants in 72 ms
[2024-05-29 14:14:03] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-29 14:14:03] [INFO ] Invariant cache hit.
[2024-05-29 14:14:06] [INFO ] Implicit Places using invariants and state equation in 3101 ms returned []
Implicit Place search using SMT with State Equation took 4244 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 14:14:06] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 119132ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 119180ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124764 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 595 ms.
Product exploration explored 100000 steps with 33333 reset in 562 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-11 finished in 126125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(G(p1))&&p0)) U (G(!p2) U p3)))'
Support contains 13 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1422 transition count 6032
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1422 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1415 transition count 6025
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1415 transition count 6025
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 1409 transition count 6019
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 1409 transition count 6019
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1403 transition count 6013
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1403 transition count 6013
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1398 transition count 6008
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1398 transition count 6008
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1393 transition count 6003
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1393 transition count 6003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1393 transition count 6002
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 1389 transition count 5998
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 1389 transition count 5998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1389 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1388 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1388 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1387 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1387 transition count 5994
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1386 transition count 5993
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1386 transition count 5993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1385 transition count 5992
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1385 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1384 transition count 5991
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1384 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1383 transition count 5990
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1383 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1382 transition count 5989
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 1379 transition count 5985
Applied a total of 104 rules in 1490 ms. Remains 1379 /1429 variables (removed 50) and now considering 5985/6039 (removed 54) transitions.
// Phase 1: matrix 5985 rows 1379 cols
[2024-05-29 14:16:08] [INFO ] Computed 8 invariants in 65 ms
[2024-05-29 14:16:09] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2024-05-29 14:16:09] [INFO ] Invariant cache hit.
[2024-05-29 14:16:13] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned []
Implicit Place search using SMT with State Equation took 5250 ms to find 0 implicit places.
Running 5984 sub problems to find dead transitions.
[2024-05-29 14:16:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/7364 variables, and 0 constraints, problems are : Problem set: 0 solved, 5984 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 5984/1596 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5984 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/7364 variables, and 0 constraints, problems are : Problem set: 0 solved, 5984 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 4388/1596 constraints, Known Traps: 0/0 constraints]
After SMT, in 125116ms problems are : Problem set: 0 solved, 5984 unsolved
Search for dead transitions found 0 dead transitions in 125176ms
Starting structural reductions in LTL mode, iteration 1 : 1379/1429 places, 5985/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131933 ms. Remains : 1379/1429 places, 5985/6039 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p3), (OR (NOT p3) (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (NOT p3) p2), (OR (NOT p0) (NOT p1) (NOT p3)), p2, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-12 finished in 132245 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 14 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1413 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 979 transitions
Trivial Post-agglo rules discarded 979 transitions
Performed 979 trivial Post agglomeration. Transition count delta: 979
Iterating post reduction 0 with 979 rules applied. Total rules applied 980 place count 1330 transition count 4947
Reduce places removed 979 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1001 rules applied. Total rules applied 1981 place count 351 transition count 4925
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1988 place count 344 transition count 4925
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 1988 place count 344 transition count 4850
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2138 place count 269 transition count 4850
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2149 place count 258 transition count 4839
Iterating global reduction 3 with 11 rules applied. Total rules applied 2160 place count 258 transition count 4839
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2161 place count 258 transition count 4838
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2165 place count 254 transition count 4834
Iterating global reduction 4 with 4 rules applied. Total rules applied 2169 place count 254 transition count 4834
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2171 place count 254 transition count 4832
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2277 place count 201 transition count 4778
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 2307 place count 171 transition count 2315
Iterating global reduction 5 with 30 rules applied. Total rules applied 2337 place count 171 transition count 2315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2346 place count 171 transition count 2306
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2368 place count 149 transition count 2277
Iterating global reduction 6 with 22 rules applied. Total rules applied 2390 place count 149 transition count 2277
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2412 place count 127 transition count 2248
Iterating global reduction 6 with 22 rules applied. Total rules applied 2434 place count 127 transition count 2248
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2442 place count 127 transition count 2240
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2464 place count 116 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2465 place count 115 transition count 2233
Iterating global reduction 7 with 1 rules applied. Total rules applied 2466 place count 115 transition count 2233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2467 place count 115 transition count 2232
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2474 place count 115 transition count 2225
Applied a total of 2474 rules in 573 ms. Remains 115 /1429 variables (removed 1314) and now considering 2225/6039 (removed 3814) transitions.
[2024-05-29 14:18:19] [INFO ] Flow matrix only has 2217 transitions (discarded 8 similar events)
// Phase 1: matrix 2217 rows 115 cols
[2024-05-29 14:18:19] [INFO ] Computed 2 invariants in 20 ms
[2024-05-29 14:18:19] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 14:18:19] [INFO ] Flow matrix only has 2217 transitions (discarded 8 similar events)
[2024-05-29 14:18:19] [INFO ] Invariant cache hit.
[2024-05-29 14:18:20] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:18:21] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2024-05-29 14:18:21] [INFO ] Redundant transitions in 57 ms returned []
Running 2208 sub problems to find dead transitions.
[2024-05-29 14:18:21] [INFO ] Flow matrix only has 2217 transitions (discarded 8 similar events)
[2024-05-29 14:18:21] [INFO ] Invariant cache hit.
[2024-05-29 14:18:21] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
[2024-05-29 14:19:17] [INFO ] Deduced a trap composed of 16 places in 761 ms of which 1 ms to minimize.
[2024-05-29 14:19:17] [INFO ] Deduced a trap composed of 19 places in 772 ms of which 1 ms to minimize.
[2024-05-29 14:19:18] [INFO ] Deduced a trap composed of 18 places in 703 ms of which 1 ms to minimize.
[2024-05-29 14:19:19] [INFO ] Deduced a trap composed of 18 places in 674 ms of which 1 ms to minimize.
[2024-05-29 14:19:20] [INFO ] Deduced a trap composed of 18 places in 736 ms of which 1 ms to minimize.
[2024-05-29 14:19:20] [INFO ] Deduced a trap composed of 17 places in 741 ms of which 1 ms to minimize.
[2024-05-29 14:19:23] [INFO ] Deduced a trap composed of 26 places in 686 ms of which 1 ms to minimize.
[2024-05-29 14:19:24] [INFO ] Deduced a trap composed of 19 places in 647 ms of which 0 ms to minimize.
[2024-05-29 14:19:26] [INFO ] Deduced a trap composed of 26 places in 619 ms of which 1 ms to minimize.
[2024-05-29 14:19:27] [INFO ] Deduced a trap composed of 29 places in 696 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 115/2332 variables, and 12 constraints, problems are : Problem set: 0 solved, 2208 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/115 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2208/2041 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
[2024-05-29 14:19:59] [INFO ] Deduced a trap composed of 28 places in 722 ms of which 1 ms to minimize.
[2024-05-29 14:20:00] [INFO ] Deduced a trap composed of 28 places in 629 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 29 places in 610 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 28 places in 562 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 27 places in 534 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 28 places in 690 ms of which 1 ms to minimize.
SMT process timed out in 102062ms, After SMT, problems are : Problem set: 0 solved, 2208 unsolved
Search for dead transitions found 0 dead transitions in 102080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1429 places, 2225/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104590 ms. Remains : 115/1429 places, 2225/6039 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-13 finished in 104675 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 7 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1420 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 986 transitions
Trivial Post-agglo rules discarded 986 transitions
Performed 986 trivial Post agglomeration. Transition count delta: 986
Iterating post reduction 0 with 986 rules applied. Total rules applied 987 place count 1330 transition count 4940
Reduce places removed 986 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1008 rules applied. Total rules applied 1995 place count 344 transition count 4918
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 2002 place count 337 transition count 4918
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 2002 place count 337 transition count 4843
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2152 place count 262 transition count 4843
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2163 place count 251 transition count 4832
Iterating global reduction 3 with 11 rules applied. Total rules applied 2174 place count 251 transition count 4832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2175 place count 251 transition count 4831
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2179 place count 247 transition count 4827
Iterating global reduction 4 with 4 rules applied. Total rules applied 2183 place count 247 transition count 4827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2185 place count 247 transition count 4825
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2291 place count 194 transition count 4771
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2325 place count 160 transition count 1950
Iterating global reduction 5 with 34 rules applied. Total rules applied 2359 place count 160 transition count 1950
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2372 place count 160 transition count 1937
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2394 place count 138 transition count 1908
Iterating global reduction 6 with 22 rules applied. Total rules applied 2416 place count 138 transition count 1908
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2438 place count 116 transition count 1879
Iterating global reduction 6 with 22 rules applied. Total rules applied 2460 place count 116 transition count 1879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2468 place count 116 transition count 1871
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2490 place count 105 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2491 place count 104 transition count 1864
Iterating global reduction 7 with 1 rules applied. Total rules applied 2492 place count 104 transition count 1864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2493 place count 104 transition count 1863
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2500 place count 104 transition count 1856
Applied a total of 2500 rules in 553 ms. Remains 104 /1429 variables (removed 1325) and now considering 1856/6039 (removed 4183) transitions.
[2024-05-29 14:20:04] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
// Phase 1: matrix 1848 rows 104 cols
[2024-05-29 14:20:04] [INFO ] Computed 2 invariants in 19 ms
[2024-05-29 14:20:04] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-29 14:20:04] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:20:04] [INFO ] Invariant cache hit.
[2024-05-29 14:20:04] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:20:05] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
[2024-05-29 14:20:05] [INFO ] Redundant transitions in 43 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 14:20:05] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:20:05] [INFO ] Invariant cache hit.
[2024-05-29 14:20:06] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:20:39] [INFO ] Deduced a trap composed of 16 places in 625 ms of which 1 ms to minimize.
[2024-05-29 14:20:39] [INFO ] Deduced a trap composed of 16 places in 631 ms of which 1 ms to minimize.
[2024-05-29 14:20:40] [INFO ] Deduced a trap composed of 23 places in 612 ms of which 1 ms to minimize.
[2024-05-29 14:20:41] [INFO ] Deduced a trap composed of 16 places in 586 ms of which 1 ms to minimize.
[2024-05-29 14:20:41] [INFO ] Deduced a trap composed of 17 places in 548 ms of which 1 ms to minimize.
[2024-05-29 14:20:42] [INFO ] Deduced a trap composed of 32 places in 543 ms of which 1 ms to minimize.
[2024-05-29 14:20:42] [INFO ] Deduced a trap composed of 27 places in 628 ms of which 1 ms to minimize.
[2024-05-29 14:20:43] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 1 ms to minimize.
[2024-05-29 14:20:44] [INFO ] Deduced a trap composed of 24 places in 546 ms of which 1 ms to minimize.
[2024-05-29 14:20:44] [INFO ] Deduced a trap composed of 28 places in 605 ms of which 0 ms to minimize.
[2024-05-29 14:20:45] [INFO ] Deduced a trap composed of 30 places in 553 ms of which 0 ms to minimize.
[2024-05-29 14:20:45] [INFO ] Deduced a trap composed of 24 places in 585 ms of which 0 ms to minimize.
[2024-05-29 14:20:46] [INFO ] Deduced a trap composed of 24 places in 589 ms of which 2 ms to minimize.
[2024-05-29 14:20:47] [INFO ] Deduced a trap composed of 26 places in 583 ms of which 0 ms to minimize.
[2024-05-29 14:20:47] [INFO ] Deduced a trap composed of 26 places in 560 ms of which 1 ms to minimize.
[2024-05-29 14:20:48] [INFO ] Deduced a trap composed of 24 places in 559 ms of which 1 ms to minimize.
[2024-05-29 14:20:48] [INFO ] Deduced a trap composed of 24 places in 533 ms of which 1 ms to minimize.
[2024-05-29 14:20:49] [INFO ] Deduced a trap composed of 16 places in 600 ms of which 1 ms to minimize.
[2024-05-29 14:20:49] [INFO ] Deduced a trap composed of 17 places in 580 ms of which 0 ms to minimize.
[2024-05-29 14:20:50] [INFO ] Deduced a trap composed of 27 places in 608 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:20:55] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 1 ms to minimize.
[2024-05-29 14:20:56] [INFO ] Deduced a trap composed of 16 places in 644 ms of which 1 ms to minimize.
[2024-05-29 14:20:56] [INFO ] Deduced a trap composed of 24 places in 563 ms of which 1 ms to minimize.
[2024-05-29 14:20:57] [INFO ] Deduced a trap composed of 27 places in 525 ms of which 1 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/1952 variables, and 27 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1839/219 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 26 places in 426 ms of which 1 ms to minimize.
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 25 places in 524 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 25 places in 463 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 24 places in 475 ms of which 1 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 27 places in 621 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 26 places in 598 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 28 places in 591 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/1952 variables, and 37 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/219 constraints, Known Traps: 35/35 constraints]
After SMT, in 83474ms problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 83490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/1429 places, 1856/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85759 ms. Remains : 104/1429 places, 1856/6039 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-14
Product exploration explored 100000 steps with 7715 reset in 346 ms.
Product exploration explored 100000 steps with 7723 reset in 354 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3104 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (260 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 743623 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 743623 steps, saw 131305 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2024-05-29 14:21:33] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:21:33] [INFO ] Invariant cache hit.
[2024-05-29 14:21:33] [INFO ] State equation strengthened by 127 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) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1901ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 78 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 14:21:35] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:21:35] [INFO ] Invariant cache hit.
[2024-05-29 14:21:36] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-29 14:21:36] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:21:36] [INFO ] Invariant cache hit.
[2024-05-29 14:21:36] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:21:37] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
[2024-05-29 14:21:37] [INFO ] Redundant transitions in 53 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 14:21:37] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:21:37] [INFO ] Invariant cache hit.
[2024-05-29 14:21:37] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 16 places in 561 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 16 places in 565 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 23 places in 556 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 16 places in 526 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 17 places in 506 ms of which 0 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 32 places in 507 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 27 places in 500 ms of which 3 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 24 places in 518 ms of which 0 ms to minimize.
[2024-05-29 14:22:12] [INFO ] Deduced a trap composed of 24 places in 515 ms of which 1 ms to minimize.
[2024-05-29 14:22:12] [INFO ] Deduced a trap composed of 28 places in 509 ms of which 1 ms to minimize.
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 30 places in 524 ms of which 1 ms to minimize.
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 24 places in 511 ms of which 1 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 24 places in 524 ms of which 1 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 26 places in 495 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 26 places in 484 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 0 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 24 places in 470 ms of which 1 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 16 places in 523 ms of which 1 ms to minimize.
[2024-05-29 14:22:17] [INFO ] Deduced a trap composed of 17 places in 590 ms of which 1 ms to minimize.
[2024-05-29 14:22:17] [INFO ] Deduced a trap composed of 27 places in 553 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:22:23] [INFO ] Deduced a trap composed of 23 places in 534 ms of which 1 ms to minimize.
[2024-05-29 14:22:23] [INFO ] Deduced a trap composed of 16 places in 572 ms of which 1 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 24 places in 567 ms of which 0 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 27 places in 521 ms of which 1 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 27 places in 531 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/1952 variables, and 27 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1839/219 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:22:41] [INFO ] Deduced a trap composed of 26 places in 427 ms of which 1 ms to minimize.
[2024-05-29 14:22:41] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 0 ms to minimize.
[2024-05-29 14:22:48] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 1 ms to minimize.
[2024-05-29 14:22:48] [INFO ] Deduced a trap composed of 25 places in 524 ms of which 0 ms to minimize.
[2024-05-29 14:22:49] [INFO ] Deduced a trap composed of 25 places in 508 ms of which 1 ms to minimize.
[2024-05-29 14:22:49] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 1 ms to minimize.
[2024-05-29 14:22:50] [INFO ] Deduced a trap composed of 24 places in 480 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:22:51] [INFO ] Deduced a trap composed of 27 places in 623 ms of which 0 ms to minimize.
[2024-05-29 14:22:51] [INFO ] Deduced a trap composed of 26 places in 606 ms of which 0 ms to minimize.
[2024-05-29 14:22:52] [INFO ] Deduced a trap composed of 28 places in 605 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/1952 variables, and 37 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/219 constraints, Known Traps: 35/35 constraints]
After SMT, in 81038ms problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 81052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82770 ms. Remains : 104/104 places, 1856/1856 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3069 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (251 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 730713 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 730713 steps, saw 129091 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2024-05-29 14:23:01] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:23:01] [INFO ] Invariant cache hit.
[2024-05-29 14:23:01] [INFO ] State equation strengthened by 127 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) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7719 reset in 350 ms.
Product exploration explored 100000 steps with 7707 reset in 349 ms.
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 74 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 14:23:04] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:23:04] [INFO ] Invariant cache hit.
[2024-05-29 14:23:05] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 14:23:05] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:23:05] [INFO ] Invariant cache hit.
[2024-05-29 14:23:05] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:23:06] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2024-05-29 14:23:06] [INFO ] Redundant transitions in 43 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 14:23:06] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 14:23:06] [INFO ] Invariant cache hit.
[2024-05-29 14:23:06] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 16 places in 585 ms of which 1 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 16 places in 587 ms of which 1 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 23 places in 572 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 16 places in 595 ms of which 0 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 17 places in 588 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 32 places in 579 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 27 places in 568 ms of which 1 ms to minimize.
[2024-05-29 14:23:41] [INFO ] Deduced a trap composed of 24 places in 616 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 1 ms to minimize.
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 28 places in 589 ms of which 1 ms to minimize.
[2024-05-29 14:23:43] [INFO ] Deduced a trap composed of 30 places in 593 ms of which 0 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 24 places in 589 ms of which 1 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 24 places in 531 ms of which 1 ms to minimize.
[2024-05-29 14:23:45] [INFO ] Deduced a trap composed of 26 places in 524 ms of which 1 ms to minimize.
[2024-05-29 14:23:45] [INFO ] Deduced a trap composed of 26 places in 509 ms of which 0 ms to minimize.
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 24 places in 510 ms of which 0 ms to minimize.
[2024-05-29 14:23:46] [INFO ] Deduced a trap composed of 24 places in 495 ms of which 1 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 16 places in 602 ms of which 1 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 17 places in 589 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 27 places in 563 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 23 places in 554 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 16 places in 590 ms of which 1 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 1 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 27 places in 599 ms of which 1 ms to minimize.
[2024-05-29 14:23:56] [INFO ] Deduced a trap composed of 27 places in 596 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/1952 variables, and 27 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1839/219 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:24:10] [INFO ] Deduced a trap composed of 26 places in 457 ms of which 1 ms to minimize.
[2024-05-29 14:24:11] [INFO ] Deduced a trap composed of 23 places in 454 ms of which 1 ms to minimize.
[2024-05-29 14:24:17] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 1 ms to minimize.
[2024-05-29 14:24:18] [INFO ] Deduced a trap composed of 25 places in 527 ms of which 1 ms to minimize.
[2024-05-29 14:24:18] [INFO ] Deduced a trap composed of 25 places in 466 ms of which 0 ms to minimize.
[2024-05-29 14:24:18] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 1 ms to minimize.
[2024-05-29 14:24:19] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 14:24:20] [INFO ] Deduced a trap composed of 27 places in 561 ms of which 1 ms to minimize.
[2024-05-29 14:24:21] [INFO ] Deduced a trap composed of 26 places in 615 ms of which 1 ms to minimize.
[2024-05-29 14:24:21] [INFO ] Deduced a trap composed of 28 places in 587 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/1952 variables, and 37 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/219 constraints, Known Traps: 35/35 constraints]
After SMT, in 81233ms problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 81248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82968 ms. Remains : 104/104 places, 1856/1856 transitions.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-14 finished in 264538 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&&(X(X(G((p0||X(p0)))))||F(p1)))))'
Support contains 8 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 1373 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 14:24:29] [INFO ] Computed 8 invariants in 74 ms
[2024-05-29 14:24:30] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2024-05-29 14:24:30] [INFO ] Invariant cache hit.
[2024-05-29 14:24:34] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 4638 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 14:24:34] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 119209ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 119256ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125282 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 781 reset in 324 ms.
Product exploration explored 100000 steps with 773 reset in 331 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (304 resets) in 162 ms. (245 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (43 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-29 14:26:34] [INFO ] Invariant cache hit.
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) 1351/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1351/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 157 ms.
Support contains 7 out of 1372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1364 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 954 transitions
Trivial Post-agglo rules discarded 954 transitions
Performed 954 trivial Post agglomeration. Transition count delta: 954
Iterating post reduction 0 with 961 rules applied. Total rules applied 963 place count 1267 transition count 4884
Reduce places removed 954 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 975 rules applied. Total rules applied 1938 place count 313 transition count 4863
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1945 place count 306 transition count 4863
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1945 place count 306 transition count 4785
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2101 place count 228 transition count 4785
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2102 place count 228 transition count 4784
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2202 place count 178 transition count 4734
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2216 place count 178 transition count 4720
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 2254 place count 140 transition count 1404
Iterating global reduction 5 with 38 rules applied. Total rules applied 2292 place count 140 transition count 1404
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2309 place count 140 transition count 1387
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2330 place count 119 transition count 1366
Iterating global reduction 6 with 21 rules applied. Total rules applied 2351 place count 119 transition count 1366
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2365 place count 105 transition count 1352
Iterating global reduction 6 with 14 rules applied. Total rules applied 2379 place count 105 transition count 1352
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2386 place count 105 transition count 1345
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2400 place count 98 transition count 1338
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2406 place count 95 transition count 1346
Free-agglomeration rule applied 41 times.
Iterating global reduction 7 with 41 rules applied. Total rules applied 2447 place count 95 transition count 1305
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 74 rules applied. Total rules applied 2521 place count 54 transition count 1272
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2528 place count 47 transition count 1265
Iterating global reduction 8 with 7 rules applied. Total rules applied 2535 place count 47 transition count 1265
Drop transitions (Redundant composition of simpler transitions.) removed 238 transitions
Redundant transition composition rules discarded 238 transitions
Iterating global reduction 8 with 238 rules applied. Total rules applied 2773 place count 47 transition count 1027
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 2775 place count 46 transition count 1026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2779 place count 44 transition count 1044
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2782 place count 44 transition count 1041
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2785 place count 41 transition count 1041
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2790 place count 41 transition count 1041
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2794 place count 41 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2797 place count 38 transition count 1031
Iterating global reduction 9 with 3 rules applied. Total rules applied 2800 place count 38 transition count 1031
Applied a total of 2800 rules in 966 ms. Remains 38 /1372 variables (removed 1334) and now considering 1031/5978 (removed 4947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 38/1372 places, 1031/5978 transitions.
RANDOM walk for 164 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 224 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 8 out of 1372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Applied a total of 0 rules in 76 ms. Remains 1372 /1372 variables (removed 0) and now considering 5978/5978 (removed 0) transitions.
[2024-05-29 14:26:40] [INFO ] Invariant cache hit.
[2024-05-29 14:26:42] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-05-29 14:26:42] [INFO ] Invariant cache hit.
[2024-05-29 14:26:45] [INFO ] Implicit Places using invariants and state equation in 3176 ms returned []
Implicit Place search using SMT with State Equation took 4381 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 14:26:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 119162ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 119211ms
Finished structural reductions in LTL mode , in 1 iterations and 123678 ms. Remains : 1372/1372 places, 5978/5978 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (311 resets) in 190 ms. (209 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (45 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-05-29 14:28:45] [INFO ] Invariant cache hit.
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) 1351/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1351/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3843ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 7 out of 1372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1364 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 0 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 954 transitions
Trivial Post-agglo rules discarded 954 transitions
Performed 954 trivial Post agglomeration. Transition count delta: 954
Iterating post reduction 0 with 961 rules applied. Total rules applied 963 place count 1267 transition count 4884
Reduce places removed 954 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 975 rules applied. Total rules applied 1938 place count 313 transition count 4863
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1945 place count 306 transition count 4863
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1945 place count 306 transition count 4785
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2101 place count 228 transition count 4785
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2102 place count 228 transition count 4784
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2202 place count 178 transition count 4734
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2216 place count 178 transition count 4720
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 2254 place count 140 transition count 1404
Iterating global reduction 5 with 38 rules applied. Total rules applied 2292 place count 140 transition count 1404
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2309 place count 140 transition count 1387
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2330 place count 119 transition count 1366
Iterating global reduction 6 with 21 rules applied. Total rules applied 2351 place count 119 transition count 1366
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2365 place count 105 transition count 1352
Iterating global reduction 6 with 14 rules applied. Total rules applied 2379 place count 105 transition count 1352
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2386 place count 105 transition count 1345
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2400 place count 98 transition count 1338
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2406 place count 95 transition count 1346
Free-agglomeration rule applied 41 times.
Iterating global reduction 7 with 41 rules applied. Total rules applied 2447 place count 95 transition count 1305
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 74 rules applied. Total rules applied 2521 place count 54 transition count 1272
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2528 place count 47 transition count 1265
Iterating global reduction 8 with 7 rules applied. Total rules applied 2535 place count 47 transition count 1265
Drop transitions (Redundant composition of simpler transitions.) removed 238 transitions
Redundant transition composition rules discarded 238 transitions
Iterating global reduction 8 with 238 rules applied. Total rules applied 2773 place count 47 transition count 1027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2775 place count 46 transition count 1026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2779 place count 44 transition count 1044
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2782 place count 44 transition count 1041
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2785 place count 41 transition count 1041
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2790 place count 41 transition count 1041
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2794 place count 41 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2797 place count 38 transition count 1031
Iterating global reduction 9 with 3 rules applied. Total rules applied 2800 place count 38 transition count 1031
Applied a total of 2800 rules in 958 ms. Remains 38 /1372 variables (removed 1334) and now considering 1031/5978 (removed 4947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 958 ms. Remains : 38/1372 places, 1031/5978 transitions.
RANDOM walk for 268 steps (0 resets) in 9 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 772 reset in 312 ms.
Product exploration explored 100000 steps with 770 reset in 323 ms.
Support contains 8 out of 1372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Applied a total of 0 rules in 75 ms. Remains 1372 /1372 variables (removed 0) and now considering 5978/5978 (removed 0) transitions.
[2024-05-29 14:28:51] [INFO ] Invariant cache hit.
[2024-05-29 14:28:53] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2024-05-29 14:28:53] [INFO ] Invariant cache hit.
[2024-05-29 14:28:56] [INFO ] Implicit Places using invariants and state equation in 3314 ms returned []
Implicit Place search using SMT with State Equation took 4508 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 14:28:56] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 118765ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 118813ms
Finished structural reductions in LTL mode , in 1 iterations and 123412 ms. Remains : 1372/1372 places, 5978/5978 transitions.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-15 finished in 387427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0 U p1))||F(G(p2))))'
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)||(X((G(!p0)||(!p0&&F(!p2))))&&p1))))'
Found a Shortening insensitive property : StigmergyCommit-PT-06b-LTLFireability-02
Stuttering acceptance computed with spot in 111 ms :[p0, p0, (AND p0 p2)]
Support contains 20 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1407 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 973 transitions
Trivial Post-agglo rules discarded 973 transitions
Performed 973 trivial Post agglomeration. Transition count delta: 973
Iterating post reduction 0 with 973 rules applied. Total rules applied 974 place count 1330 transition count 4953
Reduce places removed 973 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 995 rules applied. Total rules applied 1969 place count 357 transition count 4931
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1976 place count 350 transition count 4931
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 1976 place count 350 transition count 4856
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2126 place count 275 transition count 4856
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2137 place count 264 transition count 4845
Iterating global reduction 3 with 11 rules applied. Total rules applied 2148 place count 264 transition count 4845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2149 place count 264 transition count 4844
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2153 place count 260 transition count 4840
Iterating global reduction 4 with 4 rules applied. Total rules applied 2157 place count 260 transition count 4840
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2159 place count 260 transition count 4838
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2265 place count 207 transition count 4784
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 2295 place count 177 transition count 2483
Iterating global reduction 5 with 30 rules applied. Total rules applied 2325 place count 177 transition count 2483
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2334 place count 177 transition count 2474
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2356 place count 155 transition count 2445
Iterating global reduction 6 with 22 rules applied. Total rules applied 2378 place count 155 transition count 2445
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2400 place count 133 transition count 2416
Iterating global reduction 6 with 22 rules applied. Total rules applied 2422 place count 133 transition count 2416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2430 place count 133 transition count 2408
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2452 place count 122 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2453 place count 121 transition count 2401
Iterating global reduction 7 with 1 rules applied. Total rules applied 2454 place count 121 transition count 2401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2455 place count 121 transition count 2400
Applied a total of 2455 rules in 422 ms. Remains 121 /1429 variables (removed 1308) and now considering 2400/6039 (removed 3639) transitions.
[2024-05-29 14:30:56] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
// Phase 1: matrix 2392 rows 121 cols
[2024-05-29 14:30:56] [INFO ] Computed 2 invariants in 24 ms
[2024-05-29 14:30:56] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-29 14:30:56] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:30:56] [INFO ] Invariant cache hit.
[2024-05-29 14:30:57] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:30:58] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Running 2383 sub problems to find dead transitions.
[2024-05-29 14:30:58] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:30:58] [INFO ] Invariant cache hit.
[2024-05-29 14:30:58] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
[2024-05-29 14:31:44] [INFO ] Deduced a trap composed of 27 places in 758 ms of which 1 ms to minimize.
[2024-05-29 14:31:45] [INFO ] Deduced a trap composed of 18 places in 712 ms of which 1 ms to minimize.
[2024-05-29 14:31:46] [INFO ] Deduced a trap composed of 28 places in 676 ms of which 2 ms to minimize.
[2024-05-29 14:31:47] [INFO ] Deduced a trap composed of 30 places in 664 ms of which 1 ms to minimize.
[2024-05-29 14:31:47] [INFO ] Deduced a trap composed of 24 places in 655 ms of which 1 ms to minimize.
[2024-05-29 14:31:48] [INFO ] Deduced a trap composed of 23 places in 642 ms of which 1 ms to minimize.
[2024-05-29 14:31:49] [INFO ] Deduced a trap composed of 30 places in 673 ms of which 1 ms to minimize.
[2024-05-29 14:31:49] [INFO ] Deduced a trap composed of 19 places in 628 ms of which 1 ms to minimize.
[2024-05-29 14:31:50] [INFO ] Deduced a trap composed of 19 places in 609 ms of which 0 ms to minimize.
[2024-05-29 14:31:50] [INFO ] Deduced a trap composed of 20 places in 638 ms of which 1 ms to minimize.
[2024-05-29 14:31:51] [INFO ] Deduced a trap composed of 19 places in 649 ms of which 1 ms to minimize.
[2024-05-29 14:31:52] [INFO ] Deduced a trap composed of 30 places in 613 ms of which 1 ms to minimize.
[2024-05-29 14:31:53] [INFO ] Deduced a trap composed of 19 places in 624 ms of which 1 ms to minimize.
[2024-05-29 14:31:56] [INFO ] Deduced a trap composed of 17 places in 638 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/2513 variables, and 16 constraints, problems are : Problem set: 0 solved, 2383 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/121 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2383/751 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
[2024-05-29 14:32:21] [INFO ] Deduced a trap composed of 30 places in 561 ms of which 1 ms to minimize.
[2024-05-29 14:32:22] [INFO ] Deduced a trap composed of 27 places in 535 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/2513 variables, and 18 constraints, problems are : Problem set: 0 solved, 2383 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/121 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1632/751 constraints, Known Traps: 16/16 constraints]
After SMT, in 91819ms problems are : Problem set: 0 solved, 2383 unsolved
Search for dead transitions found 0 dead transitions in 91840ms
Starting structural reductions in LI_LTL mode, iteration 1 : 121/1429 places, 2400/6039 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 94007 ms. Remains : 121/1429 places, 2400/6039 transitions.
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 7132 reset in 394 ms.
Product exploration explored 100000 steps with 7086 reset in 407 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 119 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[p0, p0, (AND p0 p2)]
RANDOM walk for 40000 steps (2844 resets) in 465 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (250 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (243 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (232 resets) in 408 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (232 resets) in 464 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (239 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (243 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (246 resets) in 272 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (239 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (238 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 169400 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 9
Probabilistic random walk after 169400 steps, saw 41395 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-29 14:32:35] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:32:35] [INFO ] Invariant cache hit.
[2024-05-29 14:32:35] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/119 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2390/2509 variables, 119/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2509 variables, 126/246 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2509 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/2512 variables, 2/248 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2512 variables, 1/249 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2512 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/2513 variables, 1/250 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2513 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/2513 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2513/2513 variables, and 250 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 9/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 99/119 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2390/2509 variables, 119/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2509 variables, 126/246 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2509 variables, 1/247 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2509 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/2512 variables, 2/249 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2512 variables, 1/250 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2512 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/2513 variables, 1/251 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2513 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/2513 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2513/2513 variables, and 251 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6468ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 7 properties in 95 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 20 factoid took 350 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Support contains 14 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 2400/2400 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 14:32:42] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:32:42] [INFO ] Invariant cache hit.
[2024-05-29 14:32:42] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-29 14:32:42] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:32:42] [INFO ] Invariant cache hit.
[2024-05-29 14:32:42] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:32:43] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 2383 sub problems to find dead transitions.
[2024-05-29 14:32:43] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:32:43] [INFO ] Invariant cache hit.
[2024-05-29 14:32:44] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
[2024-05-29 14:33:31] [INFO ] Deduced a trap composed of 27 places in 848 ms of which 1 ms to minimize.
[2024-05-29 14:33:32] [INFO ] Deduced a trap composed of 18 places in 804 ms of which 1 ms to minimize.
[2024-05-29 14:33:33] [INFO ] Deduced a trap composed of 28 places in 681 ms of which 1 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 30 places in 676 ms of which 1 ms to minimize.
[2024-05-29 14:33:34] [INFO ] Deduced a trap composed of 24 places in 680 ms of which 1 ms to minimize.
[2024-05-29 14:33:35] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 1 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 30 places in 681 ms of which 1 ms to minimize.
[2024-05-29 14:33:36] [INFO ] Deduced a trap composed of 19 places in 637 ms of which 1 ms to minimize.
[2024-05-29 14:33:37] [INFO ] Deduced a trap composed of 19 places in 714 ms of which 0 ms to minimize.
[2024-05-29 14:33:38] [INFO ] Deduced a trap composed of 20 places in 730 ms of which 2 ms to minimize.
[2024-05-29 14:33:38] [INFO ] Deduced a trap composed of 19 places in 737 ms of which 1 ms to minimize.
[2024-05-29 14:33:39] [INFO ] Deduced a trap composed of 30 places in 629 ms of which 1 ms to minimize.
[2024-05-29 14:33:40] [INFO ] Deduced a trap composed of 19 places in 739 ms of which 1 ms to minimize.
[2024-05-29 14:33:43] [INFO ] Deduced a trap composed of 17 places in 737 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/2513 variables, and 16 constraints, problems are : Problem set: 0 solved, 2383 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/121 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2383/751 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2383 unsolved
[2024-05-29 14:34:08] [INFO ] Deduced a trap composed of 30 places in 570 ms of which 0 ms to minimize.
[2024-05-29 14:34:09] [INFO ] Deduced a trap composed of 27 places in 557 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/2513 variables, and 18 constraints, problems are : Problem set: 0 solved, 2383 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/121 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1632/751 constraints, Known Traps: 16/16 constraints]
After SMT, in 92676ms problems are : Problem set: 0 solved, 2383 unsolved
Search for dead transitions found 0 dead transitions in 92699ms
Finished structural reductions in LTL mode , in 1 iterations and 94504 ms. Remains : 121/121 places, 2400/2400 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
RANDOM walk for 40000 steps (2852 resets) in 1874 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (239 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (230 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (237 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (245 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 278637 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 4
Probabilistic random walk after 278637 steps, saw 61448 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-29 14:34:20] [INFO ] Flow matrix only has 2392 transitions (discarded 8 similar events)
[2024-05-29 14:34:20] [INFO ] Invariant cache hit.
[2024-05-29 14:34:20] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 105/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2390/2509 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2509 variables, 126/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2509 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/2512 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2512 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2512 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/2513 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2513 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2513 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2513/2513 variables, and 250 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 105/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2390/2509 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2509 variables, 126/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2509 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2509 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/2512 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2512 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2512 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/2513 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2513 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2513 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2513/2513 variables, and 251 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4719ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 38 ms.
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 2400/2400 transitions.
Graph (complete) has 781 edges and 121 vertex of which 120 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 120 transition count 2371
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 42 place count 107 transition count 2371
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 101 transition count 1041
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 101 transition count 1041
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 101 transition count 1035
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 74 place count 94 transition count 1028
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 81 place count 94 transition count 1021
Free-agglomeration rule applied 40 times.
Iterating global reduction 4 with 40 rules applied. Total rules applied 121 place count 94 transition count 981
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 65 rules applied. Total rules applied 186 place count 53 transition count 957
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 193 place count 46 transition count 957
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 200 place count 39 transition count 950
Iterating global reduction 6 with 7 rules applied. Total rules applied 207 place count 39 transition count 950
Performed 14 Post agglomeration using F-continuation condition with reduction of 472 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 235 place count 25 transition count 464
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 6 with 192 rules applied. Total rules applied 427 place count 25 transition count 272
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 22 transition count 269
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 22 transition count 269
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 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 447 place count 15 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 454 place count 15 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 455 place count 14 transition count 134
Applied a total of 455 rules in 106 ms. Remains 14 /121 variables (removed 107) and now considering 134/2400 (removed 2266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 14/121 places, 134/2400 transitions.
RANDOM walk for 113 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Product exploration explored 100000 steps with 7098 reset in 388 ms.
Product exploration explored 100000 steps with 7118 reset in 398 ms.
Support contains 14 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 1590
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 1590
Applied a total of 4 rules in 19 ms. Remains 119 /121 variables (removed 2) and now considering 1590/2400 (removed 810) transitions.
[2024-05-29 14:34:26] [INFO ] Flow matrix only has 1582 transitions (discarded 8 similar events)
// Phase 1: matrix 1582 rows 119 cols
[2024-05-29 14:34:26] [INFO ] Computed 2 invariants in 12 ms
[2024-05-29 14:34:27] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 14:34:27] [INFO ] Flow matrix only has 1582 transitions (discarded 8 similar events)
[2024-05-29 14:34:27] [INFO ] Invariant cache hit.
[2024-05-29 14:34:27] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:34:28] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 1573 sub problems to find dead transitions.
[2024-05-29 14:34:28] [INFO ] Flow matrix only has 1582 transitions (discarded 8 similar events)
[2024-05-29 14:34:28] [INFO ] Invariant cache hit.
[2024-05-29 14:34:28] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
[2024-05-29 14:34:58] [INFO ] Deduced a trap composed of 17 places in 544 ms of which 1 ms to minimize.
[2024-05-29 14:34:58] [INFO ] Deduced a trap composed of 18 places in 508 ms of which 1 ms to minimize.
[2024-05-29 14:34:59] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 1 ms to minimize.
[2024-05-29 14:34:59] [INFO ] Deduced a trap composed of 25 places in 523 ms of which 1 ms to minimize.
[2024-05-29 14:35:00] [INFO ] Deduced a trap composed of 28 places in 518 ms of which 1 ms to minimize.
[2024-05-29 14:35:00] [INFO ] Deduced a trap composed of 17 places in 486 ms of which 1 ms to minimize.
[2024-05-29 14:35:01] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 1 ms to minimize.
[2024-05-29 14:35:01] [INFO ] Deduced a trap composed of 30 places in 432 ms of which 1 ms to minimize.
[2024-05-29 14:35:02] [INFO ] Deduced a trap composed of 30 places in 443 ms of which 0 ms to minimize.
[2024-05-29 14:35:02] [INFO ] Deduced a trap composed of 19 places in 483 ms of which 1 ms to minimize.
[2024-05-29 14:35:04] [INFO ] Deduced a trap composed of 19 places in 464 ms of which 2 ms to minimize.
[2024-05-29 14:35:07] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 1 ms to minimize.
[2024-05-29 14:35:09] [INFO ] Deduced a trap composed of 30 places in 438 ms of which 1 ms to minimize.
[2024-05-29 14:35:10] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 1 ms to minimize.
[2024-05-29 14:35:16] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 1 ms to minimize.
[2024-05-29 14:35:17] [INFO ] Deduced a trap composed of 28 places in 553 ms of which 1 ms to minimize.
[2024-05-29 14:35:18] [INFO ] Deduced a trap composed of 34 places in 529 ms of which 1 ms to minimize.
[2024-05-29 14:35:18] [INFO ] Deduced a trap composed of 33 places in 519 ms of which 1 ms to minimize.
[2024-05-29 14:35:19] [INFO ] Deduced a trap composed of 27 places in 487 ms of which 1 ms to minimize.
SMT process timed out in 50913ms, After SMT, problems are : Problem set: 0 solved, 1573 unsolved
Search for dead transitions found 0 dead transitions in 50927ms
Starting structural reductions in LTL mode, iteration 1 : 119/121 places, 1590/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52210 ms. Remains : 119/121 places, 1590/2400 transitions.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-02 finished in 263856 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)))'
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)))'
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&&(X(X(G((p0||X(p0)))))||F(p1)))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-06b-LTLFireability-15
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1418 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 983 transitions
Trivial Post-agglo rules discarded 983 transitions
Performed 983 trivial Post agglomeration. Transition count delta: 983
Iterating post reduction 0 with 983 rules applied. Total rules applied 984 place count 1330 transition count 4943
Reduce places removed 983 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1005 rules applied. Total rules applied 1989 place count 347 transition count 4921
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1997 place count 340 transition count 4920
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1998 place count 339 transition count 4920
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1998 place count 339 transition count 4845
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 2148 place count 264 transition count 4845
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2159 place count 253 transition count 4834
Iterating global reduction 4 with 11 rules applied. Total rules applied 2170 place count 253 transition count 4834
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2171 place count 253 transition count 4833
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2175 place count 249 transition count 4829
Iterating global reduction 5 with 4 rules applied. Total rules applied 2179 place count 249 transition count 4829
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2181 place count 249 transition count 4827
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 2287 place count 196 transition count 4773
Discarding 35 places :
Symmetric choice reduction at 6 with 35 rule applications. Total rules 2322 place count 161 transition count 1466
Iterating global reduction 6 with 35 rules applied. Total rules applied 2357 place count 161 transition count 1466
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2371 place count 161 transition count 1452
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2393 place count 139 transition count 1423
Iterating global reduction 7 with 22 rules applied. Total rules applied 2415 place count 139 transition count 1423
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2437 place count 117 transition count 1394
Iterating global reduction 7 with 22 rules applied. Total rules applied 2459 place count 117 transition count 1394
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2467 place count 117 transition count 1386
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2489 place count 106 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2490 place count 105 transition count 1379
Iterating global reduction 8 with 1 rules applied. Total rules applied 2491 place count 105 transition count 1379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2492 place count 105 transition count 1378
Applied a total of 2492 rules in 434 ms. Remains 105 /1429 variables (removed 1324) and now considering 1378/6039 (removed 4661) transitions.
[2024-05-29 14:35:20] [INFO ] Flow matrix only has 1370 transitions (discarded 8 similar events)
// Phase 1: matrix 1370 rows 105 cols
[2024-05-29 14:35:20] [INFO ] Computed 2 invariants in 18 ms
[2024-05-29 14:35:20] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-29 14:35:20] [INFO ] Flow matrix only has 1370 transitions (discarded 8 similar events)
[2024-05-29 14:35:20] [INFO ] Invariant cache hit.
[2024-05-29 14:35:21] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:35:21] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 1361 sub problems to find dead transitions.
[2024-05-29 14:35:21] [INFO ] Flow matrix only has 1370 transitions (discarded 8 similar events)
[2024-05-29 14:35:21] [INFO ] Invariant cache hit.
[2024-05-29 14:35:21] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-29 14:35:52] [INFO ] Deduced a trap composed of 24 places in 440 ms of which 1 ms to minimize.
[2024-05-29 14:35:53] [INFO ] Deduced a trap composed of 16 places in 432 ms of which 1 ms to minimize.
[2024-05-29 14:35:53] [INFO ] Deduced a trap composed of 16 places in 441 ms of which 0 ms to minimize.
[2024-05-29 14:35:53] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 1 ms to minimize.
[2024-05-29 14:35:54] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 0 ms to minimize.
[2024-05-29 14:35:54] [INFO ] Deduced a trap composed of 16 places in 384 ms of which 1 ms to minimize.
[2024-05-29 14:35:55] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 0 ms to minimize.
[2024-05-29 14:35:55] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 1 ms to minimize.
[2024-05-29 14:35:55] [INFO ] Deduced a trap composed of 16 places in 399 ms of which 1 ms to minimize.
[2024-05-29 14:35:56] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 1 ms to minimize.
[2024-05-29 14:35:56] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 1 ms to minimize.
[2024-05-29 14:35:57] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 1 ms to minimize.
[2024-05-29 14:35:57] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 1 ms to minimize.
[2024-05-29 14:35:57] [INFO ] Deduced a trap composed of 27 places in 363 ms of which 1 ms to minimize.
[2024-05-29 14:35:58] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 0 ms to minimize.
[2024-05-29 14:35:58] [INFO ] Deduced a trap composed of 27 places in 450 ms of which 0 ms to minimize.
[2024-05-29 14:35:59] [INFO ] Deduced a trap composed of 16 places in 388 ms of which 0 ms to minimize.
[2024-05-29 14:36:10] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2024-05-29 14:36:10] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2024-05-29 14:36:11] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-29 14:36:14] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 0 ms to minimize.
[2024-05-29 14:36:14] [INFO ] Deduced a trap composed of 29 places in 367 ms of which 1 ms to minimize.
[2024-05-29 14:36:15] [INFO ] Deduced a trap composed of 25 places in 374 ms of which 1 ms to minimize.
[2024-05-29 14:36:15] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 1 ms to minimize.
[2024-05-29 14:36:16] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 1 ms to minimize.
SMT process timed out in 54336ms, After SMT, problems are : Problem set: 0 solved, 1361 unsolved
Search for dead transitions found 0 dead transitions in 54350ms
Starting structural reductions in LI_LTL mode, iteration 1 : 105/1429 places, 1378/6039 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55934 ms. Remains : 105/1429 places, 1378/6039 transitions.
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 7615 reset in 352 ms.
Stuttering criterion allowed to conclude after 42612 steps with 3236 reset in 162 ms.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-15 finished in 56847 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-29 14:36:17] [INFO ] Flatten gal took : 371 ms
[2024-05-29 14:36:17] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-29 14:36:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1429 places, 6039 transitions and 66315 arcs took 52 ms.
Total runtime 2944838 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-06b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1429
TRANSITIONS: 6039
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.290s, Sys 0.027s]


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


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

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

Process ID: 3116
MODEL NAME: /home/mcc/execution/417/model
1429 places, 6039 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-06b-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-06b-LTLFireability-01 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-06b-LTLFireability-02 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-06b-LTLFireability-05 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-06b-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716993901292

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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