About the Execution of ITS-Tools for StigmergyElection-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15916.392 | 3003929.00 | 8759222.00 | 3118.30 | FFFFFTFTFFFTFFTT | 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.r400-tall-171690532100324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717008991216
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 18:56:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:56:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:56:32] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 18:56:32] [INFO ] Transformed 835 places.
[2024-05-29 18:56:32] [INFO ] Transformed 2416 transitions.
[2024-05-29 18:56:32] [INFO ] Found NUPN structural information;
[2024-05-29 18:56:32] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-06b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 104 place count 731 transition count 2312
Iterating global reduction 0 with 104 rules applied. Total rules applied 208 place count 731 transition count 2312
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 262 place count 677 transition count 2258
Iterating global reduction 0 with 54 rules applied. Total rules applied 316 place count 677 transition count 2258
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 327 place count 666 transition count 2247
Iterating global reduction 0 with 11 rules applied. Total rules applied 338 place count 666 transition count 2247
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 344 place count 660 transition count 2241
Iterating global reduction 0 with 6 rules applied. Total rules applied 350 place count 660 transition count 2241
Applied a total of 350 rules in 250 ms. Remains 660 /835 variables (removed 175) and now considering 2241/2416 (removed 175) transitions.
// Phase 1: matrix 2241 rows 660 cols
[2024-05-29 18:56:33] [INFO ] Computed 7 invariants in 50 ms
[2024-05-29 18:56:33] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-29 18:56:33] [INFO ] Invariant cache hit.
[2024-05-29 18:56:34] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 2240 sub problems to find dead transitions.
[2024-05-29 18:56:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/659 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
SMT process timed out in 50969ms, After SMT, problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 51106ms
Starting structural reductions in LTL mode, iteration 1 : 660/835 places, 2241/2416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52439 ms. Remains : 660/835 places, 2241/2416 transitions.
Support contains 48 out of 660 places after structural reductions.
[2024-05-29 18:57:25] [INFO ] Flatten gal took : 262 ms
[2024-05-29 18:57:25] [INFO ] Flatten gal took : 176 ms
[2024-05-29 18:57:26] [INFO ] Input system was already deterministic with 2241 transitions.
RANDOM walk for 40000 steps (378 resets) in 2559 ms. (15 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
[2024-05-29 18:57:27] [INFO ] Invariant cache hit.
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 617/660 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-29 18:57:28] [INFO ] Deduced a trap composed of 166 places in 584 ms of which 31 ms to minimize.
[2024-05-29 18:57:29] [INFO ] Deduced a trap composed of 165 places in 578 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2241/2901 variables, 660/669 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2901 variables, 0/669 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/2901 variables, 0/669 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2901/2901 variables, and 669 constraints, problems are : Problem set: 1 solved, 20 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 660/660 constraints, PredecessorRefiner: 21/20 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 617/660 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2241/2901 variables, 660/669 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2901 variables, 19/688 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2901/2901 variables, and 688 constraints, problems are : Problem set: 1 solved, 20 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 660/660 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 10082ms problems are : Problem set: 1 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 630 edges and 660 vertex of which 99 / 660 are part of one of the 17 SCC in 5 ms
Free SCC test removed 82 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Graph (complete) has 1386 edges and 578 vertex of which 573 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.19 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 373 rules applied. Total rules applied 375 place count 573 transition count 1758
Reduce places removed 368 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 378 rules applied. Total rules applied 753 place count 205 transition count 1748
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 760 place count 200 transition count 1746
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 762 place count 198 transition count 1746
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 762 place count 198 transition count 1718
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 818 place count 170 transition count 1718
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 880 place count 139 transition count 1687
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 891 place count 139 transition count 1676
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 900 place count 130 transition count 1667
Iterating global reduction 5 with 9 rules applied. Total rules applied 909 place count 130 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 910 place count 129 transition count 1665
Iterating global reduction 5 with 1 rules applied. Total rules applied 911 place count 129 transition count 1665
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 923 place count 123 transition count 1659
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 933 place count 118 transition count 1667
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 944 place count 118 transition count 1656
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 946 place count 117 transition count 1662
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 954 place count 117 transition count 1654
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 956 place count 116 transition count 1660
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 964 place count 116 transition count 1652
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 1008 place count 116 transition count 1608
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 1052 place count 72 transition count 1608
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1054 place count 72 transition count 1608
Applied a total of 1054 rules in 766 ms. Remains 72 /660 variables (removed 588) and now considering 1608/2241 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 72/660 places, 1608/2241 transitions.
RANDOM walk for 40000 steps (4426 resets) in 1376 ms. (29 steps per ms) remains 14/20 properties
BEST_FIRST walk for 40004 steps (23 resets) in 80 ms. (493 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (19 resets) in 73 ms. (540 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (23 resets) in 111 ms. (357 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 84 ms. (470 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (395 resets) in 124 ms. (320 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 54 ms. (727 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (24 resets) in 75 ms. (526 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 115 ms. (344 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (14 resets) in 57 ms. (689 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 55 ms. (714 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (15 resets) in 51 ms. (769 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (15 resets) in 56 ms. (701 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (21 resets) in 40 ms. (975 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1537 steps (16 resets) in 21 ms. (69 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 90 stabilizing places and 96 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 659 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 659 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 658 transition count 2239
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Applied a total of 6 rules in 129 ms. Remains 657 /660 variables (removed 3) and now considering 2238/2241 (removed 3) transitions.
// Phase 1: matrix 2238 rows 657 cols
[2024-05-29 18:57:39] [INFO ] Computed 7 invariants in 33 ms
[2024-05-29 18:57:40] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-29 18:57:40] [INFO ] Invariant cache hit.
[2024-05-29 18:57:41] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Running 2237 sub problems to find dead transitions.
[2024-05-29 18:57:41] [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 timeout
1.0)
(s342 1.0)
(s343 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2237 unsolved
SMT process timed out in 49971ms, After SMT, problems are : Problem set: 0 solved, 2237 unsolved
Search for dead transitions found 0 dead transitions in 49999ms
Starting structural reductions in LTL mode, iteration 1 : 657/660 places, 2238/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51541 ms. Remains : 657/660 places, 2238/2241 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-00
Product exploration explored 100000 steps with 952 reset in 329 ms.
Product exploration explored 100000 steps with 949 reset in 212 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (378 resets) in 328 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (59 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (59 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 404447 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 3
Probabilistic random walk after 404447 steps, saw 70304 distinct states, run finished after 3009 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-29 18:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 636/643 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/657 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2238/2895 variables, 657/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2895 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2895 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2895/2895 variables, and 664 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 657/657 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 636/643 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:58:37] [INFO ] Deduced a trap composed of 165 places in 616 ms of which 4 ms to minimize.
[2024-05-29 18:58:37] [INFO ] Deduced a trap composed of 221 places in 531 ms of which 4 ms to minimize.
[2024-05-29 18:58:38] [INFO ] Deduced a trap composed of 167 places in 501 ms of which 3 ms to minimize.
[2024-05-29 18:58:38] [INFO ] Deduced a trap composed of 168 places in 524 ms of which 3 ms to minimize.
[2024-05-29 18:58:39] [INFO ] Deduced a trap composed of 165 places in 547 ms of which 3 ms to minimize.
[2024-05-29 18:58:40] [INFO ] Deduced a trap composed of 168 places in 545 ms of which 4 ms to minimize.
[2024-05-29 18:58:40] [INFO ] Deduced a trap composed of 167 places in 593 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/657 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2238/2895 variables, 657/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2895 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2895/2895 variables, and 674 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 657/657 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 6275ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 2238/2238 transitions.
Graph (trivial) has 666 edges and 657 vertex of which 102 / 657 are part of one of the 18 SCC in 6 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Graph (complete) has 1380 edges and 573 vertex of which 567 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 404 rules applied. Total rules applied 406 place count 567 transition count 1721
Reduce places removed 398 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 410 rules applied. Total rules applied 816 place count 169 transition count 1709
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 822 place count 163 transition count 1709
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 822 place count 163 transition count 1678
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 884 place count 132 transition count 1678
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 885 place count 132 transition count 1677
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 947 place count 101 transition count 1646
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 958 place count 101 transition count 1635
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 978 place count 81 transition count 542
Iterating global reduction 5 with 20 rules applied. Total rules applied 998 place count 81 transition count 542
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1007 place count 81 transition count 533
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1012 place count 76 transition count 528
Iterating global reduction 6 with 5 rules applied. Total rules applied 1017 place count 76 transition count 528
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 6 with 14 rules applied. Total rules applied 1031 place count 69 transition count 521
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 6 with 6 rules applied. Total rules applied 1037 place count 66 transition count 529
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1046 place count 66 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1048 place count 65 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1056 place count 65 transition count 518
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1058 place count 64 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1066 place count 64 transition count 516
Free-agglomeration rule applied 35 times.
Iterating global reduction 6 with 35 rules applied. Total rules applied 1101 place count 64 transition count 481
Reduce places removed 35 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 6 with 44 rules applied. Total rules applied 1145 place count 29 transition count 472
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1151 place count 23 transition count 466
Iterating global reduction 7 with 6 rules applied. Total rules applied 1157 place count 23 transition count 466
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 7 with 39 rules applied. Total rules applied 1196 place count 23 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 8 with 50 rules applied. Total rules applied 1246 place count 23 transition count 377
Applied a total of 1246 rules in 244 ms. Remains 23 /657 variables (removed 634) and now considering 377/2238 (removed 1861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 23/657 places, 377/2238 transitions.
RANDOM walk for 481 steps (0 resets) in 14 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 2238/2238 transitions.
Graph (trivial) has 666 edges and 657 vertex of which 102 / 657 are part of one of the 18 SCC in 3 ms
Free SCC test removed 84 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 388 place count 572 transition count 1755
Reduce places removed 387 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 399 rules applied. Total rules applied 787 place count 185 transition count 1743
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 793 place count 179 transition count 1743
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 793 place count 179 transition count 1718
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 843 place count 154 transition count 1718
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 848 place count 149 transition count 1713
Iterating global reduction 3 with 5 rules applied. Total rules applied 853 place count 149 transition count 1713
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 911 place count 120 transition count 1684
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 930 place count 101 transition count 598
Iterating global reduction 3 with 19 rules applied. Total rules applied 949 place count 101 transition count 598
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 957 place count 101 transition count 590
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 962 place count 96 transition count 580
Iterating global reduction 4 with 5 rules applied. Total rules applied 967 place count 96 transition count 580
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 972 place count 91 transition count 570
Iterating global reduction 4 with 5 rules applied. Total rules applied 977 place count 91 transition count 570
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 4 with 22 rules applied. Total rules applied 999 place count 80 transition count 577
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1000 place count 79 transition count 563
Iterating global reduction 4 with 1 rules applied. Total rules applied 1001 place count 79 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1002 place count 79 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1009 place count 79 transition count 555
Applied a total of 1009 rules in 176 ms. Remains 79 /657 variables (removed 578) and now considering 555/2238 (removed 1683) transitions.
[2024-05-29 18:58:42] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
// Phase 1: matrix 547 rows 79 cols
[2024-05-29 18:58:42] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 18:58:42] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-29 18:58:42] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
[2024-05-29 18:58:42] [INFO ] Invariant cache hit.
[2024-05-29 18:58:42] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 18:58:42] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-29 18:58:42] [INFO ] Redundant transitions in 33 ms returned []
Running 538 sub problems to find dead transitions.
[2024-05-29 18:58:42] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
[2024-05-29 18:58:42] [INFO ] Invariant cache hit.
[2024-05-29 18:58:42] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
[2024-05-29 18:58:47] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 0 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:58:50] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:58:51] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:58:51] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:58:52] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:58:52] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:58:52] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-29 18:58:52] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:58:52] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 538 unsolved
[2024-05-29 18:58:53] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2024-05-29 18:58:54] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:58:55] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 6 (OVERLAPS) 546/625 variables, 79/104 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 9 (OVERLAPS) 1/626 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/626 variables, and 167 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (OVERLAPS) 546/625 variables, 79/104 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 538/704 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/626 variables, and 704 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 23/23 constraints]
After SMT, in 63002ms problems are : Problem set: 0 solved, 538 unsolved
Search for dead transitions found 0 dead transitions in 63007ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/657 places, 555/2238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63646 ms. Remains : 79/657 places, 555/2238 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (3552 resets) in 712 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (315 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (314 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (320 resets) in 21 ms. (1818 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 944748 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 3
Probabilistic random walk after 944748 steps, saw 170951 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
[2024-05-29 18:59:49] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
[2024-05-29 18:59:49] [INFO ] Invariant cache hit.
[2024-05-29 18:59:49] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:59:49] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2024-05-29 18:59:49] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:59:49] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:59:49] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 18:59:49] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 545/622 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 62/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/625 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/626 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/626 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 626/626 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 545/622 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 62/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/625 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/626 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/626 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 626/626 variables, and 152 constraints, problems are : Problem set: 0 solved, 3 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 1895ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 104 ms.
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 555/555 transitions.
Graph (complete) has 484 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 78 transition count 540
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 39 place count 66 transition count 528
Free-agglomeration rule applied 35 times.
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 66 transition count 493
Reduce places removed 36 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 1 with 45 rules applied. Total rules applied 119 place count 30 transition count 484
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 125 place count 24 transition count 478
Iterating global reduction 2 with 6 rules applied. Total rules applied 131 place count 24 transition count 478
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 170 place count 24 transition count 439
Performed 7 Post agglomeration using F-continuation condition with reduction of 289 identical transitions.
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 184 place count 17 transition count 143
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 3 with 67 rules applied. Total rules applied 251 place count 17 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 15 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 14 transition count 73
Applied a total of 256 rules in 58 ms. Remains 14 /79 variables (removed 65) and now considering 73/555 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 14/79 places, 73/555 transitions.
RANDOM walk for 240 steps (0 resets) in 4 ms. (48 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 8814 reset in 398 ms.
Product exploration explored 100000 steps with 8839 reset in 302 ms.
Built C files in :
/tmp/ltsmin5833320770050194857
[2024-05-29 18:59:52] [INFO ] Computing symmetric may disable matrix : 555 transitions.
[2024-05-29 18:59:52] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:59:52] [INFO ] Computing symmetric may enable matrix : 555 transitions.
[2024-05-29 18:59:52] [INFO ] Computation of Complete enable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:59:52] [INFO ] Computing Do-Not-Accords matrix : 555 transitions.
[2024-05-29 18:59:52] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:59:52] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5833320770050194857
Running compilation step : cd /tmp/ltsmin5833320770050194857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2499 ms.
Running link step : cd /tmp/ltsmin5833320770050194857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin5833320770050194857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14871042842374628996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 555/555 transitions.
Applied a total of 0 rules in 23 ms. Remains 79 /79 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-29 19:00:07] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
[2024-05-29 19:00:07] [INFO ] Invariant cache hit.
[2024-05-29 19:00:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 19:00:07] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
[2024-05-29 19:00:07] [INFO ] Invariant cache hit.
[2024-05-29 19:00:07] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:00:08] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-29 19:00:08] [INFO ] Redundant transitions in 7 ms returned []
Running 538 sub problems to find dead transitions.
[2024-05-29 19:00:08] [INFO ] Flow matrix only has 547 transitions (discarded 8 similar events)
[2024-05-29 19:00:08] [INFO ] Invariant cache hit.
[2024-05-29 19:00:08] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
[2024-05-29 19:00:12] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2024-05-29 19:00:12] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2024-05-29 19:00:13] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-05-29 19:00:14] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:00:14] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2024-05-29 19:00:14] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:00:14] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2024-05-29 19:00:17] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 538 unsolved
[2024-05-29 19:00:18] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 0 ms to minimize.
[2024-05-29 19:00:19] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:00:19] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 6 (OVERLAPS) 546/625 variables, 79/104 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 9 (OVERLAPS) 1/626 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/626 variables, and 167 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (OVERLAPS) 546/625 variables, 79/104 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 538/704 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/626 variables, and 704 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 23/23 constraints]
After SMT, in 62559ms problems are : Problem set: 0 solved, 538 unsolved
Search for dead transitions found 0 dead transitions in 62566ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63010 ms. Remains : 79/79 places, 555/555 transitions.
Built C files in :
/tmp/ltsmin567270506689941579
[2024-05-29 19:01:10] [INFO ] Computing symmetric may disable matrix : 555 transitions.
[2024-05-29 19:01:10] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:01:10] [INFO ] Computing symmetric may enable matrix : 555 transitions.
[2024-05-29 19:01:10] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:01:10] [INFO ] Computing Do-Not-Accords matrix : 555 transitions.
[2024-05-29 19:01:10] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:01:10] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin567270506689941579
Running compilation step : cd /tmp/ltsmin567270506689941579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2225 ms.
Running link step : cd /tmp/ltsmin567270506689941579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin567270506689941579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6804554322883589098.hoa' '--buchi-type=spotba'
LTSmin run took 9118 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06b-LTLFireability-00 finished in 222740 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) U p1)))'
Support contains 8 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 670 edges and 660 vertex of which 103 / 660 are part of one of the 18 SCC in 4 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 391 place count 574 transition count 1753
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 402 rules applied. Total rules applied 793 place count 184 transition count 1741
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 799 place count 178 transition count 1741
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 799 place count 178 transition count 1717
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 847 place count 154 transition count 1717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 852 place count 149 transition count 1712
Iterating global reduction 3 with 5 rules applied. Total rules applied 857 place count 149 transition count 1712
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 915 place count 120 transition count 1683
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 933 place count 102 transition count 1000
Iterating global reduction 3 with 18 rules applied. Total rules applied 951 place count 102 transition count 1000
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 957 place count 102 transition count 994
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 963 place count 96 transition count 982
Iterating global reduction 4 with 6 rules applied. Total rules applied 969 place count 96 transition count 982
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 974 place count 91 transition count 972
Iterating global reduction 4 with 5 rules applied. Total rules applied 979 place count 91 transition count 972
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 999 place count 81 transition count 981
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 1013 place count 81 transition count 967
Applied a total of 1013 rules in 153 ms. Remains 81 /660 variables (removed 579) and now considering 967/2241 (removed 1274) transitions.
[2024-05-29 19:01:22] [INFO ] Flow matrix only has 960 transitions (discarded 7 similar events)
// Phase 1: matrix 960 rows 81 cols
[2024-05-29 19:01:22] [INFO ] Computed 2 invariants in 18 ms
[2024-05-29 19:01:22] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-29 19:01:22] [INFO ] Flow matrix only has 960 transitions (discarded 7 similar events)
[2024-05-29 19:01:22] [INFO ] Invariant cache hit.
[2024-05-29 19:01:22] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:01:23] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-29 19:01:23] [INFO ] Redundant transitions in 39 ms returned []
Running 949 sub problems to find dead transitions.
[2024-05-29 19:01:23] [INFO ] Flow matrix only has 960 transitions (discarded 7 similar events)
[2024-05-29 19:01:23] [INFO ] Invariant cache hit.
[2024-05-29 19:01:23] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:01:38] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 1 ms to minimize.
[2024-05-29 19:01:39] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 0 ms to minimize.
[2024-05-29 19:01:39] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 1 ms to minimize.
[2024-05-29 19:01:39] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:01:39] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 0 ms to minimize.
[2024-05-29 19:01:40] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 1 ms to minimize.
[2024-05-29 19:01:40] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 1 ms to minimize.
[2024-05-29 19:01:40] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 1 ms to minimize.
[2024-05-29 19:01:40] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2024-05-29 19:01:41] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 1 ms to minimize.
[2024-05-29 19:01:41] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2024-05-29 19:01:41] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 0 ms to minimize.
[2024-05-29 19:01:42] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 1 ms to minimize.
[2024-05-29 19:01:42] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2024-05-29 19:01:42] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 0 ms to minimize.
[2024-05-29 19:01:42] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2024-05-29 19:01:43] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 1 ms to minimize.
[2024-05-29 19:01:43] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 1 ms to minimize.
[2024-05-29 19:01:43] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 1 ms to minimize.
[2024-05-29 19:01:43] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:01:45] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2024-05-29 19:01:46] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2024-05-29 19:01:49] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 1 ms to minimize.
[2024-05-29 19:01:50] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 1 ms to minimize.
[2024-05-29 19:01:50] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 1 ms to minimize.
[2024-05-29 19:01:50] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 7 (OVERLAPS) 959/1040 variables, 81/111 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 62/173 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 1 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 1 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/1041 variables, and 176 constraints, problems are : Problem set: 0 solved, 949 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 949/949 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 949 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 0 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-05-29 19:02:08] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:02:12] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 5 ms to minimize.
[2024-05-29 19:02:15] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 1 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 1 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 0 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 8 (OVERLAPS) 959/1040 variables, 81/126 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 62/188 constraints. Problems are: Problem set: 0 solved, 949 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/1041 variables, and 1137 constraints, problems are : Problem set: 0 solved, 949 unsolved in 32282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 949/949 constraints, Known Traps: 43/43 constraints]
After SMT, in 73206ms problems are : Problem set: 0 solved, 949 unsolved
Search for dead transitions found 0 dead transitions in 73217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/660 places, 967/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74079 ms. Remains : 81/660 places, 967/2241 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-01 finished in 74239 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))&&F(p1)))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 79 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 19:02:36] [INFO ] Computed 7 invariants in 24 ms
[2024-05-29 19:02:36] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-29 19:02:36] [INFO ] Invariant cache hit.
[2024-05-29 19:02:38] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:02:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 52027ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 52050ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53714 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-02 finished in 53885 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 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 671 edges and 660 vertex of which 103 / 660 are part of one of the 18 SCC in 2 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 392 place count 574 transition count 1752
Reduce places removed 391 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 403 rules applied. Total rules applied 795 place count 183 transition count 1740
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 801 place count 177 transition count 1740
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 801 place count 177 transition count 1716
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 849 place count 153 transition count 1716
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 854 place count 148 transition count 1711
Iterating global reduction 3 with 5 rules applied. Total rules applied 859 place count 148 transition count 1711
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 917 place count 119 transition count 1682
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 939 place count 97 transition count 414
Iterating global reduction 3 with 22 rules applied. Total rules applied 961 place count 97 transition count 414
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 971 place count 97 transition count 404
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 977 place count 91 transition count 392
Iterating global reduction 4 with 6 rules applied. Total rules applied 983 place count 91 transition count 392
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 989 place count 85 transition count 380
Iterating global reduction 4 with 6 rules applied. Total rules applied 995 place count 85 transition count 380
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1015 place count 75 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1016 place count 74 transition count 375
Iterating global reduction 4 with 1 rules applied. Total rules applied 1017 place count 74 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1018 place count 74 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1024 place count 74 transition count 368
Applied a total of 1024 rules in 122 ms. Remains 74 /660 variables (removed 586) and now considering 368/2241 (removed 1873) transitions.
[2024-05-29 19:03:30] [INFO ] Flow matrix only has 361 transitions (discarded 7 similar events)
// Phase 1: matrix 361 rows 74 cols
[2024-05-29 19:03:30] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:03:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 19:03:30] [INFO ] Flow matrix only has 361 transitions (discarded 7 similar events)
[2024-05-29 19:03:30] [INFO ] Invariant cache hit.
[2024-05-29 19:03:30] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:03:30] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-29 19:03:30] [INFO ] Redundant transitions in 3 ms returned []
Running 351 sub problems to find dead transitions.
[2024-05-29 19:03:30] [INFO ] Flow matrix only has 361 transitions (discarded 7 similar events)
[2024-05-29 19:03:30] [INFO ] Invariant cache hit.
[2024-05-29 19:03:30] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:03:32] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:03:33] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:03:36] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:03:36] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:03:36] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:03:37] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2024-05-29 19:03:37] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:03:37] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:03:37] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:03:37] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (OVERLAPS) 360/434 variables, 74/105 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 62/167 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:03:40] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 10 (OVERLAPS) 1/435 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 169 constraints, problems are : Problem set: 0 solved, 351 unsolved in 25447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 360/434 variables, 74/106 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 351/519 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:04:12] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 520 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 31/31 constraints]
After SMT, in 56373ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 56377ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/660 places, 368/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56792 ms. Remains : 74/660 places, 368/2241 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-03
Product exploration explored 100000 steps with 7182 reset in 180 ms.
Product exploration explored 100000 steps with 8815 reset in 205 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3533 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (314 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1902609 steps, run visited all 1 properties in 2680 ms. (steps per millisecond=709 )
Probabilistic random walk after 1902609 steps, saw 336151 distinct states, run finished after 2684 ms. (steps per millisecond=708 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 368/368 transitions.
Applied a total of 0 rules in 17 ms. Remains 74 /74 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-29 19:04:30] [INFO ] Flow matrix only has 361 transitions (discarded 7 similar events)
[2024-05-29 19:04:30] [INFO ] Invariant cache hit.
[2024-05-29 19:04:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 19:04:30] [INFO ] Flow matrix only has 361 transitions (discarded 7 similar events)
[2024-05-29 19:04:30] [INFO ] Invariant cache hit.
[2024-05-29 19:04:30] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:04:30] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-29 19:04:30] [INFO ] Redundant transitions in 1 ms returned []
Running 351 sub problems to find dead transitions.
[2024-05-29 19:04:30] [INFO ] Flow matrix only has 361 transitions (discarded 7 similar events)
[2024-05-29 19:04:30] [INFO ] Invariant cache hit.
[2024-05-29 19:04:30] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:04:34] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:04:35] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:04:36] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:04:36] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:04:36] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (OVERLAPS) 360/434 variables, 74/105 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 62/167 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 10 (OVERLAPS) 1/435 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 169 constraints, problems are : Problem set: 0 solved, 351 unsolved in 26072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 360/434 variables, 74/106 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 351/519 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 520 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 31/31 constraints]
After SMT, in 56866ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 56869ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57215 ms. Remains : 74/74 places, 368/368 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3525 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (311 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1902609 steps, run visited all 1 properties in 2666 ms. (steps per millisecond=713 )
Probabilistic random walk after 1902609 steps, saw 336151 distinct states, run finished after 2666 ms. (steps per millisecond=713 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8813 reset in 190 ms.
Product exploration explored 100000 steps with 8781 reset in 200 ms.
Built C files in :
/tmp/ltsmin16851973122613572973
[2024-05-29 19:05:31] [INFO ] Computing symmetric may disable matrix : 368 transitions.
[2024-05-29 19:05:31] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:05:31] [INFO ] Computing symmetric may enable matrix : 368 transitions.
[2024-05-29 19:05:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:05:31] [INFO ] Computing Do-Not-Accords matrix : 368 transitions.
[2024-05-29 19:05:31] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:05:31] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16851973122613572973
Running compilation step : cd /tmp/ltsmin16851973122613572973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1131 ms.
Running link step : cd /tmp/ltsmin16851973122613572973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16851973122613572973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5452432810239882821.hoa' '--buchi-type=spotba'
LTSmin run took 729 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06b-LTLFireability-03 finished in 123033 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((G(F(p0)) U (G((p2||X(p2)))&&p1))))'
Support contains 8 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 71 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 19:05:33] [INFO ] Computed 7 invariants in 27 ms
[2024-05-29 19:05:33] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 19:05:33] [INFO ] Invariant cache hit.
[2024-05-29 19:05:34] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:05:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 51820ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 51842ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53283 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-04
Stuttering criterion allowed to conclude after 354 steps with 3 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-04 finished in 53578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 67 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
[2024-05-29 19:06:27] [INFO ] Invariant cache hit.
[2024-05-29 19:06:27] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-29 19:06:27] [INFO ] Invariant cache hit.
[2024-05-29 19:06:28] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 51970ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 51993ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53426 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-05 finished in 54154 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)||G((p1||X(F(p0))))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 669 edges and 660 vertex of which 103 / 660 are part of one of the 18 SCC in 1 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 390 place count 574 transition count 1754
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 401 rules applied. Total rules applied 791 place count 185 transition count 1742
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 797 place count 179 transition count 1742
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 797 place count 179 transition count 1718
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 845 place count 155 transition count 1718
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 850 place count 150 transition count 1713
Iterating global reduction 3 with 5 rules applied. Total rules applied 855 place count 150 transition count 1713
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 913 place count 121 transition count 1684
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 936 place count 98 transition count 338
Iterating global reduction 3 with 23 rules applied. Total rules applied 959 place count 98 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 971 place count 98 transition count 326
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 976 place count 93 transition count 316
Iterating global reduction 4 with 5 rules applied. Total rules applied 981 place count 93 transition count 316
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 986 place count 88 transition count 306
Iterating global reduction 4 with 5 rules applied. Total rules applied 991 place count 88 transition count 306
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 4 with 22 rules applied. Total rules applied 1013 place count 77 transition count 313
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1014 place count 76 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 1015 place count 76 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1016 place count 76 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1022 place count 76 transition count 292
Applied a total of 1022 rules in 101 ms. Remains 76 /660 variables (removed 584) and now considering 292/2241 (removed 1949) transitions.
[2024-05-29 19:07:21] [INFO ] Flow matrix only has 284 transitions (discarded 8 similar events)
// Phase 1: matrix 284 rows 76 cols
[2024-05-29 19:07:21] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:07:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 19:07:21] [INFO ] Flow matrix only has 284 transitions (discarded 8 similar events)
[2024-05-29 19:07:21] [INFO ] Invariant cache hit.
[2024-05-29 19:07:21] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:07:21] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-29 19:07:21] [INFO ] Redundant transitions in 2 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-29 19:07:21] [INFO ] Flow matrix only has 284 transitions (discarded 8 similar events)
[2024-05-29 19:07:21] [INFO ] Invariant cache hit.
[2024-05-29 19:07:21] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 19:07:22] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:07:22] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:07:23] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:07:24] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 19:07:25] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:07:25] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:07:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:07:26] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:07:26] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:07:26] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 283/359 variables, 76/104 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 19:07:29] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 168 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 283/359 variables, 76/106 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 275/443 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 19:08:04] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 19:08:11] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:08:11] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:08:12] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 448 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 32/32 constraints]
After SMT, in 50860ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 50863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/660 places, 292/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51203 ms. Remains : 76/660 places, 292/2241 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-06 finished in 51305 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||G(F(p1))))))'
Support contains 15 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 662 edges and 660 vertex of which 103 / 660 are part of one of the 18 SCC in 0 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 382 rules applied. Total rules applied 383 place count 574 transition count 1761
Reduce places removed 382 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 394 rules applied. Total rules applied 777 place count 192 transition count 1749
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 783 place count 186 transition count 1749
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 783 place count 186 transition count 1725
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 831 place count 162 transition count 1725
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 836 place count 157 transition count 1720
Iterating global reduction 3 with 5 rules applied. Total rules applied 841 place count 157 transition count 1720
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 899 place count 128 transition count 1691
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 913 place count 114 transition count 1187
Iterating global reduction 3 with 14 rules applied. Total rules applied 927 place count 114 transition count 1187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 929 place count 114 transition count 1185
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 935 place count 108 transition count 1173
Iterating global reduction 4 with 6 rules applied. Total rules applied 941 place count 108 transition count 1173
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 947 place count 102 transition count 1161
Iterating global reduction 4 with 6 rules applied. Total rules applied 953 place count 102 transition count 1161
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 973 place count 92 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 974 place count 91 transition count 1156
Iterating global reduction 4 with 1 rules applied. Total rules applied 975 place count 91 transition count 1156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 976 place count 91 transition count 1155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 982 place count 91 transition count 1149
Applied a total of 982 rules in 155 ms. Remains 91 /660 variables (removed 569) and now considering 1149/2241 (removed 1092) transitions.
[2024-05-29 19:08:12] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
// Phase 1: matrix 1142 rows 91 cols
[2024-05-29 19:08:12] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 19:08:12] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 19:08:12] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:08:12] [INFO ] Invariant cache hit.
[2024-05-29 19:08:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:08:13] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-29 19:08:13] [INFO ] Redundant transitions in 21 ms returned []
Running 1132 sub problems to find dead transitions.
[2024-05-29 19:08:13] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:08:13] [INFO ] Invariant cache hit.
[2024-05-29 19:08:13] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-05-29 19:08:29] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 0 ms to minimize.
[2024-05-29 19:08:29] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 0 ms to minimize.
[2024-05-29 19:08:32] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 1 ms to minimize.
[2024-05-29 19:08:32] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2024-05-29 19:08:32] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 0 ms to minimize.
[2024-05-29 19:08:32] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 0 ms to minimize.
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 0 ms to minimize.
[2024-05-29 19:08:40] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:08:40] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2024-05-29 19:08:40] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 1 ms to minimize.
[2024-05-29 19:08:41] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 1 ms to minimize.
[2024-05-29 19:08:41] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 0 ms to minimize.
[2024-05-29 19:08:41] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1232 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 62/174 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1232/1233 variables, and 174 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 1132/1090 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-05-29 19:09:02] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 6 (OVERLAPS) 1141/1232 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 62/175 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1232/1233 variables, and 1265 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30549 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 1132/1090 constraints, Known Traps: 20/20 constraints]
After SMT, in 71556ms problems are : Problem set: 0 solved, 1132 unsolved
Search for dead transitions found 0 dead transitions in 71567ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/660 places, 1149/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72436 ms. Remains : 91/660 places, 1149/2241 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-07
Product exploration explored 100000 steps with 8217 reset in 390 ms.
Product exploration explored 100000 steps with 8239 reset in 309 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3276 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (295 resets) in 513 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (283 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (268 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 420608 steps, run timeout after 3006 ms. (steps per millisecond=139 ) properties seen :0 out of 3
Probabilistic random walk after 420608 steps, saw 89198 distinct states, run finished after 3006 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-29 19:09:29] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:09:29] [INFO ] Invariant cache hit.
[2024-05-29 19:09:29] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1229 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/1232 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1233 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1233 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1233 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1233/1233 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1229 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/1232 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1233 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1233/1233 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3395ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1149/1149 transitions.
Applied a total of 0 rules in 36 ms. Remains 91 /91 variables (removed 0) and now considering 1149/1149 (removed 0) transitions.
[2024-05-29 19:09:33] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:09:33] [INFO ] Invariant cache hit.
[2024-05-29 19:09:33] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-29 19:09:33] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:09:33] [INFO ] Invariant cache hit.
[2024-05-29 19:09:33] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:09:33] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-29 19:09:33] [INFO ] Redundant transitions in 22 ms returned []
Running 1132 sub problems to find dead transitions.
[2024-05-29 19:09:33] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:09:33] [INFO ] Invariant cache hit.
[2024-05-29 19:09:33] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-05-29 19:09:49] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:09:49] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:09:50] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 1 ms to minimize.
[2024-05-29 19:09:50] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2024-05-29 19:09:50] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 0 ms to minimize.
[2024-05-29 19:09:50] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 0 ms to minimize.
[2024-05-29 19:09:51] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 1 ms to minimize.
[2024-05-29 19:09:51] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 1 ms to minimize.
[2024-05-29 19:09:51] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 1 ms to minimize.
[2024-05-29 19:09:52] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2024-05-29 19:09:52] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 1 ms to minimize.
[2024-05-29 19:09:52] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 0 ms to minimize.
[2024-05-29 19:09:53] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 1 ms to minimize.
[2024-05-29 19:09:58] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 0 ms to minimize.
[2024-05-29 19:09:58] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 2 ms to minimize.
[2024-05-29 19:09:59] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 1 ms to minimize.
[2024-05-29 19:09:59] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 1 ms to minimize.
[2024-05-29 19:09:59] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 1 ms to minimize.
[2024-05-29 19:10:00] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1232 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 62/174 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1232/1233 variables, and 174 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 1132/1090 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 6 (OVERLAPS) 1141/1232 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 62/175 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1232/1233 variables, and 1265 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 1132/1090 constraints, Known Traps: 20/20 constraints]
After SMT, in 71460ms problems are : Problem set: 0 solved, 1132 unsolved
Search for dead transitions found 0 dead transitions in 71472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72216 ms. Remains : 91/91 places, 1149/1149 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3312 resets) in 842 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (263 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (274 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (269 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 446499 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 3
Probabilistic random walk after 446499 steps, saw 94185 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-29 19:10:48] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:10:48] [INFO ] Invariant cache hit.
[2024-05-29 19:10:48] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1229 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/1232 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1233 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1233 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1233 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1233/1233 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1229 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/1232 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1233 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1233/1233 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3282ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 3 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8259 reset in 332 ms.
Product exploration explored 100000 steps with 8251 reset in 307 ms.
Built C files in :
/tmp/ltsmin10789959609418520307
[2024-05-29 19:10:53] [INFO ] Computing symmetric may disable matrix : 1149 transitions.
[2024-05-29 19:10:53] [INFO ] Computation of Complete disable matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:10:53] [INFO ] Computing symmetric may enable matrix : 1149 transitions.
[2024-05-29 19:10:53] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:10:53] [INFO ] Computing Do-Not-Accords matrix : 1149 transitions.
[2024-05-29 19:10:53] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:10:53] [INFO ] Built C files in 459ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10789959609418520307
Running compilation step : cd /tmp/ltsmin10789959609418520307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10789959609418520307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10789959609418520307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 15 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1149/1149 transitions.
Applied a total of 0 rules in 37 ms. Remains 91 /91 variables (removed 0) and now considering 1149/1149 (removed 0) transitions.
[2024-05-29 19:10:56] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:10:56] [INFO ] Invariant cache hit.
[2024-05-29 19:10:56] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 19:10:56] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:10:56] [INFO ] Invariant cache hit.
[2024-05-29 19:10:57] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:10:57] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-29 19:10:57] [INFO ] Redundant transitions in 20 ms returned []
Running 1132 sub problems to find dead transitions.
[2024-05-29 19:10:57] [INFO ] Flow matrix only has 1142 transitions (discarded 7 similar events)
[2024-05-29 19:10:57] [INFO ] Invariant cache hit.
[2024-05-29 19:10:57] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-05-29 19:11:13] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 1 ms to minimize.
[2024-05-29 19:11:14] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 0 ms to minimize.
[2024-05-29 19:11:14] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2024-05-29 19:11:14] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2024-05-29 19:11:14] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 1 ms to minimize.
[2024-05-29 19:11:15] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 0 ms to minimize.
[2024-05-29 19:11:15] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 0 ms to minimize.
[2024-05-29 19:11:15] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 0 ms to minimize.
[2024-05-29 19:11:16] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2024-05-29 19:11:16] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 1 ms to minimize.
[2024-05-29 19:11:16] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 1 ms to minimize.
[2024-05-29 19:11:17] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 15 ms to minimize.
[2024-05-29 19:11:17] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 1 ms to minimize.
[2024-05-29 19:11:24] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 1 ms to minimize.
[2024-05-29 19:11:24] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:11:25] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 1 ms to minimize.
[2024-05-29 19:11:25] [INFO ] Deduced a trap composed of 27 places in 302 ms of which 1 ms to minimize.
[2024-05-29 19:11:25] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 2 ms to minimize.
[2024-05-29 19:11:25] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1232 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 62/174 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1232/1233 variables, and 174 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 1132/1090 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-05-29 19:11:46] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 6 (OVERLAPS) 1141/1232 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 62/175 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1232/1233 variables, and 1265 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 1132/1090 constraints, Known Traps: 20/20 constraints]
After SMT, in 71828ms problems are : Problem set: 0 solved, 1132 unsolved
Search for dead transitions found 0 dead transitions in 71839ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72585 ms. Remains : 91/91 places, 1149/1149 transitions.
Built C files in :
/tmp/ltsmin7532415868195843756
[2024-05-29 19:12:09] [INFO ] Computing symmetric may disable matrix : 1149 transitions.
[2024-05-29 19:12:09] [INFO ] Computation of Complete disable matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:12:09] [INFO ] Computing symmetric may enable matrix : 1149 transitions.
[2024-05-29 19:12:09] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:12:09] [INFO ] Computing Do-Not-Accords matrix : 1149 transitions.
[2024-05-29 19:12:09] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:12:09] [INFO ] Built C files in 458ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7532415868195843756
Running compilation step : cd /tmp/ltsmin7532415868195843756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7532415868195843756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7532415868195843756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 19:12:13] [INFO ] Flatten gal took : 116 ms
[2024-05-29 19:12:13] [INFO ] Flatten gal took : 103 ms
[2024-05-29 19:12:13] [INFO ] Time to serialize gal into /tmp/LTL2880365450857613519.gal : 28 ms
[2024-05-29 19:12:13] [INFO ] Time to serialize properties into /tmp/LTL3529216787341616263.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2880365450857613519.gal' '-t' 'CGAL' '-hoa' '/tmp/aut918267144258223129.hoa' '-atoms' '/tmp/LTL3529216787341616263.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3529216787341616263.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut918267144258223129.hoa
Detected timeout of ITS tools.
[2024-05-29 19:12:28] [INFO ] Flatten gal took : 98 ms
[2024-05-29 19:12:28] [INFO ] Flatten gal took : 95 ms
[2024-05-29 19:12:28] [INFO ] Time to serialize gal into /tmp/LTL2647223408030604253.gal : 15 ms
[2024-05-29 19:12:28] [INFO ] Time to serialize properties into /tmp/LTL13432367217089467398.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2647223408030604253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13432367217089467398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(((((p54==0)||(p176==0))||((p311==0)||(p446==0)))||((p594==0)||(p704==0)))&&((((p101==0)||(p236==0))||((p346==0)||(p493==...272
Formula 0 simplified : FG(!"(((((p54==0)||(p176==0))||((p311==0)||(p446==0)))||((p594==0)||(p704==0)))&&((((p101==0)||(p236==0))||((p346==0)||(p493==0)))||...260
Detected timeout of ITS tools.
[2024-05-29 19:12:43] [INFO ] Flatten gal took : 86 ms
[2024-05-29 19:12:43] [INFO ] Applying decomposition
[2024-05-29 19:12:43] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12412903523754226928.txt' '-o' '/tmp/graph12412903523754226928.bin' '-w' '/tmp/graph12412903523754226928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12412903523754226928.bin' '-l' '-1' '-v' '-w' '/tmp/graph12412903523754226928.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:12:44] [INFO ] Decomposing Gal with order
[2024-05-29 19:12:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:12:44] [INFO ] Removed a total of 6235 redundant transitions.
[2024-05-29 19:12:44] [INFO ] Flatten gal took : 354 ms
[2024-05-29 19:12:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 53 ms.
[2024-05-29 19:12:44] [INFO ] Time to serialize gal into /tmp/LTL9595458797899182671.gal : 6 ms
[2024-05-29 19:12:44] [INFO ] Time to serialize properties into /tmp/LTL13328362207025600174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9595458797899182671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13328362207025600174.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(((((u0.p54==0)||(u4.p176==0))||((u6.p311==0)||(u9.p446==0)))||((i0.u14.p594==0)||(i0.u16.p704==0)))&&((((u0.p101==0)||(u...360
Formula 0 simplified : FG(!"(((((u0.p54==0)||(u4.p176==0))||((u6.p311==0)||(u9.p446==0)))||((i0.u14.p594==0)||(i0.u16.p704==0)))&&((((u0.p101==0)||(u4.p236...348
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-06b-LTLFireability-07 finished in 287259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 8 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 69 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 19:12:59] [INFO ] Computed 7 invariants in 29 ms
[2024-05-29 19:13:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-29 19:13:00] [INFO ] Invariant cache hit.
[2024-05-29 19:13:01] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:13:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 50548ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 50572ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52015 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-10 finished in 52181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 73 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
[2024-05-29 19:13:51] [INFO ] Invariant cache hit.
[2024-05-29 19:13:52] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-29 19:13:52] [INFO ] Invariant cache hit.
[2024-05-29 19:13:53] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:13:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 52148ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 52173ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53837 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 89 ms :[p1, p1, true]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-11 finished in 54601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((X(F(p1))&&p0)))))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 73 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
[2024-05-29 19:14:46] [INFO ] Invariant cache hit.
[2024-05-29 19:14:46] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-29 19:14:46] [INFO ] Invariant cache hit.
[2024-05-29 19:14:47] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:14:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 50460ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 50528ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52086 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-12 finished in 52442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
Support contains 12 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 665 edges and 660 vertex of which 103 / 660 are part of one of the 18 SCC in 0 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 386 place count 574 transition count 1758
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 397 rules applied. Total rules applied 783 place count 189 transition count 1746
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 789 place count 183 transition count 1746
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 789 place count 183 transition count 1722
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 837 place count 159 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 842 place count 154 transition count 1717
Iterating global reduction 3 with 5 rules applied. Total rules applied 847 place count 154 transition count 1717
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 905 place count 125 transition count 1688
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 920 place count 110 transition count 1022
Iterating global reduction 3 with 15 rules applied. Total rules applied 935 place count 110 transition count 1022
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 938 place count 110 transition count 1019
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 944 place count 104 transition count 1007
Iterating global reduction 4 with 6 rules applied. Total rules applied 950 place count 104 transition count 1007
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 956 place count 98 transition count 995
Iterating global reduction 4 with 6 rules applied. Total rules applied 962 place count 98 transition count 995
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 982 place count 88 transition count 1002
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 983 place count 87 transition count 990
Iterating global reduction 4 with 1 rules applied. Total rules applied 984 place count 87 transition count 990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 985 place count 87 transition count 989
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 991 place count 87 transition count 983
Applied a total of 991 rules in 145 ms. Remains 87 /660 variables (removed 573) and now considering 983/2241 (removed 1258) transitions.
[2024-05-29 19:15:39] [INFO ] Flow matrix only has 976 transitions (discarded 7 similar events)
// Phase 1: matrix 976 rows 87 cols
[2024-05-29 19:15:39] [INFO ] Computed 2 invariants in 14 ms
[2024-05-29 19:15:39] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 19:15:39] [INFO ] Flow matrix only has 976 transitions (discarded 7 similar events)
[2024-05-29 19:15:39] [INFO ] Invariant cache hit.
[2024-05-29 19:15:39] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:15:39] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-29 19:15:39] [INFO ] Redundant transitions in 14 ms returned []
Running 966 sub problems to find dead transitions.
[2024-05-29 19:15:39] [INFO ] Flow matrix only has 976 transitions (discarded 7 similar events)
[2024-05-29 19:15:39] [INFO ] Invariant cache hit.
[2024-05-29 19:15:39] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-29 19:15:51] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 2 ms to minimize.
[2024-05-29 19:15:51] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 1 ms to minimize.
[2024-05-29 19:15:52] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 1 ms to minimize.
[2024-05-29 19:15:52] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 2 ms to minimize.
[2024-05-29 19:15:52] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2024-05-29 19:15:52] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 1 ms to minimize.
[2024-05-29 19:15:53] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 1 ms to minimize.
[2024-05-29 19:15:53] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 0 ms to minimize.
[2024-05-29 19:15:53] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 1 ms to minimize.
[2024-05-29 19:15:54] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 1 ms to minimize.
[2024-05-29 19:15:54] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 1 ms to minimize.
[2024-05-29 19:15:54] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 1 ms to minimize.
[2024-05-29 19:15:54] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 1 ms to minimize.
[2024-05-29 19:15:55] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 1 ms to minimize.
[2024-05-29 19:15:55] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2024-05-29 19:15:55] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2024-05-29 19:15:55] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 1 ms to minimize.
[2024-05-29 19:15:59] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 0 ms to minimize.
[2024-05-29 19:16:00] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 0 ms to minimize.
[2024-05-29 19:16:00] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-29 19:16:02] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2024-05-29 19:16:02] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 1 ms to minimize.
[2024-05-29 19:16:03] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 1 ms to minimize.
[2024-05-29 19:16:03] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 0 ms to minimize.
[2024-05-29 19:16:03] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 1 ms to minimize.
[2024-05-29 19:16:04] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 1 ms to minimize.
[2024-05-29 19:16:04] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2024-05-29 19:16:04] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 1 ms to minimize.
[2024-05-29 19:16:04] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2024-05-29 19:16:08] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 975/1062 variables, 87/119 constraints. Problems are: Problem set: 0 solved, 966 unsolved
SMT process timed out in 37501ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 37510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/660 places, 983/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38307 ms. Remains : 87/660 places, 983/2241 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 669 steps with 125 reset in 2 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-13 finished in 38474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 87 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 19:16:17] [INFO ] Computed 7 invariants in 19 ms
[2024-05-29 19:16:17] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-29 19:16:17] [INFO ] Invariant cache hit.
[2024-05-29 19:16:18] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 19:16:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 55546ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 55566ms
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57175 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-15 finished in 57888 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||G(F(p1))))))'
[2024-05-29 19:17:15] [INFO ] Flatten gal took : 109 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4883188530402780512
[2024-05-29 19:17:15] [INFO ] Too many transitions (2241) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:17:15] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4883188530402780512
Running compilation step : cd /tmp/ltsmin4883188530402780512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 19:17:15] [INFO ] Applying decomposition
[2024-05-29 19:17:15] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18279827114856753685.txt' '-o' '/tmp/graph18279827114856753685.bin' '-w' '/tmp/graph18279827114856753685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18279827114856753685.bin' '-l' '-1' '-v' '-w' '/tmp/graph18279827114856753685.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:17:16] [INFO ] Decomposing Gal with order
[2024-05-29 19:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:17:16] [INFO ] Removed a total of 9225 redundant transitions.
[2024-05-29 19:17:16] [INFO ] Flatten gal took : 211 ms
[2024-05-29 19:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 66 ms.
[2024-05-29 19:17:16] [INFO ] Time to serialize gal into /tmp/LTLFireability12336891704938695444.gal : 14 ms
[2024-05-29 19:17:16] [INFO ] Time to serialize properties into /tmp/LTLFireability5060544134355532411.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12336891704938695444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5060544134355532411.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i0.u13.p88==1)&&(i0.u44.p236==1))&&((i0.u109.p346==1)&&(i0.u151.p481==1)))&&((i0.u194.p616==1)&&(i0.u215.p763==1)))")||(G...407
Formula 0 simplified : FG(!"(((((i0.u3.p54==0)||(i0.u55.p176==0))||((i0.u87.p311==0)||(i0.u131.p446==0)))||((i0.u172.p594==0)||(i6.u221.p704==0)))&&((((i0....395
Compilation finished in 7525 ms.
Running link step : cd /tmp/ltsmin4883188530402780512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4883188530402780512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t75, t120, t121, t158, t159, t176, t255, t257, t274, t353, t355, t372, t417, t451, t453, t470...617
Computing Next relation with stutter on 810360 deadlock states
Detected timeout of ITS tools.
[2024-05-29 19:44:11] [INFO ] Applying decomposition
[2024-05-29 19:44:11] [INFO ] Flatten gal took : 222 ms
[2024-05-29 19:44:11] [INFO ] Decomposing Gal with order
[2024-05-29 19:44:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:44:12] [INFO ] Removed a total of 9129 redundant transitions.
[2024-05-29 19:44:12] [INFO ] Flatten gal took : 747 ms
[2024-05-29 19:44:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 64 ms.
[2024-05-29 19:44:12] [INFO ] Time to serialize gal into /tmp/LTLFireability3939252439968321115.gal : 20 ms
[2024-05-29 19:44:12] [INFO ] Time to serialize properties into /tmp/LTLFireability14574045391416282236.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3939252439968321115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14574045391416282236.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i0.i0.i0.i0.i0.u6.p88==1)&&(i0.i0.i0.i0.i0.u7.p236==1))&&((i0.i0.i0.i0.u8.p346==1)&&(i0.i0.i0.u9.p481==1)))&&((i0.i0.u10....512
Formula 0 simplified : FG(!"(((((i0.i0.i0.i0.i0.u6.p54==0)||(i0.i0.i0.i0.i0.u7.p176==0))||((i0.i0.i0.i0.u8.p311==0)||(i0.i0.i0.u9.p446==0)))||((i0.i0.u10.p...500
Reverse transition relation is NOT exact ! Due to transitions t679, i0.u11.t75, i0.u11.t84, i0.u11.t118, i0.u11.t120, i0.u11.t121, i0.u11.t158, i0.u11.t159...1081
Computing Next relation with stutter on 810360 deadlock states
174 unique states visited
0 strongly connected components in search stack
346 transitions explored
174 items max in DFS search stack
5185 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,51.8984,821172,1,0,349126,2.11113e+06,10188,997793,5850,9.44652e+06,171783
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-06b-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3002678 ms.
BK_STOP 1717011995145
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-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 r400-tall-171690532100324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-06b.tgz
mv StigmergyElection-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 '
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 ;