Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 428K 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-05b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717246609197

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:56:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:56:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:56:50] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-06-01 12:56:50] [INFO ] Transformed 699 places.
[2024-06-01 12:56:50] [INFO ] Transformed 1266 transitions.
[2024-06-01 12:56:50] [INFO ] Found NUPN structural information;
[2024-06-01 12:56:50] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (449 resets) in 1620 ms. (24 steps per ms) remains 15/16 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 499137 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :1 out of 15
Probabilistic random walk after 499137 steps, saw 84856 distinct states, run finished after 3012 ms. (steps per millisecond=165 ) properties seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1266 rows 699 cols
[2024-06-01 12:56:54] [INFO ] Computed 6 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 581/699 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 581/705 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1266/1965 variables, 699/1404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1965 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/1965 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 1404 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2092 ms.
Refiners :[Domain max(s): 699/699 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyElection-PT-05b-ReachabilityFireability-2024-04 is UNSAT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 581/699 variables, 6/124 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 581/705 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 189 places in 293 ms of which 33 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 192 places in 260 ms of which 3 ms to minimize.
Problem StigmergyElection-PT-05b-ReachabilityFireability-2024-07 is UNSAT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 190 places in 215 ms of which 3 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 190 places in 210 ms of which 3 ms to minimize.
Problem StigmergyElection-PT-05b-ReachabilityFireability-2024-12 is UNSAT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 4/709 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 193 places in 253 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 192 places in 225 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 192 places in 259 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 3/712 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 189 places in 241 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 1/713 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/699 variables, 0/713 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1266/1965 variables, 699/1412 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1965 variables, 11/1423 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-01 12:57:02] [INFO ] Deduced a trap composed of 244 places in 296 ms of which 3 ms to minimize.
SMT process timed out in 7674ms, After SMT, problems are : Problem set: 3 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 564 edges and 699 vertex of which 49 / 699 are part of one of the 9 SCC in 7 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 1235 edges and 659 vertex of which 651 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 351 rules applied. Total rules applied 353 place count 651 transition count 860
Reduce places removed 347 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 359 rules applied. Total rules applied 712 place count 304 transition count 848
Reduce places removed 6 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 44 rules applied. Total rules applied 756 place count 298 transition count 810
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 40 rules applied. Total rules applied 796 place count 260 transition count 808
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 797 place count 259 transition count 808
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 797 place count 259 transition count 787
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 839 place count 238 transition count 787
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 879 place count 198 transition count 747
Iterating global reduction 5 with 40 rules applied. Total rules applied 919 place count 198 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 920 place count 198 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 920 place count 198 transition count 745
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 922 place count 197 transition count 745
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 923 place count 196 transition count 744
Iterating global reduction 6 with 1 rules applied. Total rules applied 924 place count 196 transition count 744
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 956 place count 180 transition count 728
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 960 place count 176 transition count 724
Iterating global reduction 6 with 4 rules applied. Total rules applied 964 place count 176 transition count 724
Performed 11 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 986 place count 165 transition count 725
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 999 place count 165 transition count 712
Free-agglomeration rule applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1017 place count 165 transition count 694
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1035 place count 147 transition count 694
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1039 place count 147 transition count 694
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1040 place count 147 transition count 693
Applied a total of 1040 rules in 346 ms. Remains 147 /699 variables (removed 552) and now considering 693/1266 (removed 573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 147/699 places, 693/1266 transitions.
RANDOM walk for 40000 steps (2268 resets) in 419 ms. (95 steps per ms) remains 10/11 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (262 resets) in 98 ms. (404 steps per ms) remains 9/10 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (342 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (354 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (398 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (418 resets) in 62 ms. (634 steps per ms) remains 8/9 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (363 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (350 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (390 resets) in 67 ms. (588 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (353 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (352 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
// Phase 1: matrix 693 rows 147 cols
[2024-06-01 12:57:03] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 12:57:03] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 74/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 693/840 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 48/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 201 constraints, problems are : Problem set: 0 solved, 7 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 74/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 693/840 variables, 147/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 48/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/840 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 211 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2534 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 3089ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2137 ms.
Support contains 70 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 693/693 transitions.
Graph (trivial) has 17 edges and 147 vertex of which 4 / 147 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 145 transition count 685
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 141 transition count 682
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 138 transition count 682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 138 transition count 681
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 137 transition count 681
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 135 transition count 679
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 135 transition count 679
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 134 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 134 transition count 676
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 134 transition count 675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 133 transition count 675
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 29 place count 133 transition count 675
Applied a total of 29 rules in 89 ms. Remains 133 /147 variables (removed 14) and now considering 675/693 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 133/147 places, 675/693 transitions.
RANDOM walk for 40000 steps (2281 resets) in 180 ms. (220 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (352 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (362 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (397 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (367 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (342 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (354 resets) in 74 ms. (533 steps per ms) remains 5/6 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 675 rows 133 cols
[2024-06-01 12:57:08] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 12:57:08] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 675/808 variables, 133/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 48/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 187 constraints, problems are : Problem set: 0 solved, 5 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 1 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 675/808 variables, 133/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 48/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/808 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 194 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1843ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 447 ms.
Support contains 53 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 675/675 transitions.
Graph (trivial) has 35 edges and 133 vertex of which 12 / 133 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 518 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 125 transition count 658
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 121 transition count 653
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 22 place count 116 transition count 652
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 116 transition count 650
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 114 transition count 650
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 113 transition count 649
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 113 transition count 649
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 34 place count 110 transition count 646
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 38 place count 110 transition count 642
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 109 transition count 642
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 109 transition count 639
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 108 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 108 transition count 638
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 108 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 49 place count 106 transition count 636
Applied a total of 49 rules in 72 ms. Remains 106 /133 variables (removed 27) and now considering 636/675 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 106/133 places, 636/675 transitions.
RANDOM walk for 40000 steps (2615 resets) in 168 ms. (236 steps per ms) remains 3/5 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (371 resets) in 125 ms. (317 steps per ms) remains 2/3 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (459 resets) in 27 ms. (1428 steps per ms) remains 1/2 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 636 rows 106 cols
[2024-06-01 12:57:11] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 12:57:11] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 636/742 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/742 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/742 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/106 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 636/742 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/742 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/742 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 742/742 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/106 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 999ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 48 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 636/636 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 635
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 105 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 104 transition count 634
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 104 transition count 633
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 103 transition count 633
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 101 transition count 631
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 101 transition count 631
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 100 transition count 630
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 99 transition count 629
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 99 transition count 629
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 99 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 98 transition count 628
Applied a total of 16 rules in 47 ms. Remains 98 /106 variables (removed 8) and now considering 628/636 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 98/106 places, 628/636 transitions.
RANDOM walk for 40000 steps (2637 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (397 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1749479 steps, run timeout after 3001 ms. (steps per millisecond=582 ) properties seen :0 out of 1
Probabilistic random walk after 1749479 steps, saw 330783 distinct states, run finished after 3001 ms. (steps per millisecond=582 ) properties seen :0
// Phase 1: matrix 628 rows 98 cols
[2024-06-01 12:57:15] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 12:57:15] [INFO ] State equation strengthened by 125 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 628/726 variables, 98/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/726 variables, 125/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/726 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 628/726 variables, 98/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/726 variables, 125/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/726 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 988ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 48 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 628/628 transitions.
Applied a total of 0 rules in 17 ms. Remains 98 /98 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 98/98 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 628/628 transitions.
Applied a total of 0 rules in 17 ms. Remains 98 /98 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-06-01 12:57:16] [INFO ] Invariant cache hit.
[2024-06-01 12:57:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 12:57:16] [INFO ] Invariant cache hit.
[2024-06-01 12:57:16] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-06-01 12:57:16] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-01 12:57:16] [INFO ] Redundant transitions in 33 ms returned []
Running 626 sub problems to find dead transitions.
[2024-06-01 12:57:16] [INFO ] Invariant cache hit.
[2024-06-01 12:57:16] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 12:57:22] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2024-06-01 12:57:22] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2024-06-01 12:57:22] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 0 ms to minimize.
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 0 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2024-06-01 12:57:26] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (OVERLAPS) 628/726 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 125/243 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 7 (OVERLAPS) 0/726 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 626 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 243 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (OVERLAPS) 628/726 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 125/244 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 626/870 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 12:58:10] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2024-06-01 12:58:12] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2024-06-01 12:58:12] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 873 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 18/18 constraints]
After SMT, in 63241ms problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 63259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63626 ms. Remains : 98/98 places, 628/628 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 93 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 93 transition count 621
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 93 transition count 621
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 92 transition count 620
Applied a total of 18 rules in 46 ms. Remains 92 /98 variables (removed 6) and now considering 620/628 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 620 rows 92 cols
[2024-06-01 12:58:19] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 12:58:19] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:58:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 12:58:20] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:58:20] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:58:20] [INFO ] After 708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 836 ms.
[2024-06-01 12:58:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 12:58:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 628 transitions and 5464 arcs took 9 ms.
[2024-06-01 12:58:21] [INFO ] Flatten gal took : 170 ms
Total runtime 90744 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyElection-PT-05b-ReachabilityFireability-2024-02

BK_STOP 1717246701324

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/666/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532000311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;