Execution Chart

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

Trace from the execution

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

--------------------
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 1717010309152

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:18:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:18:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:18:30] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-29 19:18:30] [INFO ] Transformed 699 places.
[2024-05-29 19:18:30] [INFO ] Transformed 1266 transitions.
[2024-05-29 19:18:30] [INFO ] Found NUPN structural information;
[2024-05-29 19:18:30] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (449 resets) in 1731 ms. (23 steps per ms) remains 15/16 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 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 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 160 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 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 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 189 ms. (21 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 481339 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :1 out of 15
Probabilistic random walk after 481339 steps, saw 81985 distinct states, run finished after 3005 ms. (steps per millisecond=160 ) properties seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1266 rows 699 cols
[2024-05-29 19:18:34] [INFO ] Computed 6 invariants in 27 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 2144 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-05-29 19:18:38] [INFO ] Deduced a trap composed of 189 places in 344 ms of which 27 ms to minimize.
[2024-05-29 19:18:38] [INFO ] Deduced a trap composed of 192 places in 367 ms of which 4 ms to minimize.
Problem StigmergyElection-PT-05b-ReachabilityFireability-2024-07 is UNSAT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 19:18:39] [INFO ] Deduced a trap composed of 190 places in 325 ms of which 10 ms to minimize.
[2024-05-29 19:18:39] [INFO ] Deduced a trap composed of 190 places in 223 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-05-29 19:18:39] [INFO ] Deduced a trap composed of 193 places in 288 ms of which 3 ms to minimize.
[2024-05-29 19:18:39] [INFO ] Deduced a trap composed of 192 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:18:40] [INFO ] Deduced a trap composed of 192 places in 274 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-05-29 19:18:40] [INFO ] Deduced a trap composed of 189 places in 291 ms of which 3 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1965/1965 variables, and 1423 constraints, problems are : Problem set: 3 solved, 11 unsolved in 5008 ms.
Refiners :[Domain max(s): 699/699 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 8/8 constraints]
After SMT, in 7606ms 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 4 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 1 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 1 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 393 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 402 ms. Remains : 147/699 places, 693/1266 transitions.
RANDOM walk for 40000 steps (2283 resets) in 906 ms. (44 steps per ms) remains 9/11 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (339 resets) in 206 ms. (193 steps per ms) remains 8/9 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (359 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (389 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (410 resets) in 46 ms. (851 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (370 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (380 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (371 resets) in 29 ms. (1333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (337 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
// Phase 1: matrix 693 rows 147 cols
[2024-05-29 19:18:43] [INFO ] Computed 6 invariants in 4 ms
[2024-05-29 19:18:43] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/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 538 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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 693/840 variables, 147/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 48/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:18:45] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:18:46] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 213 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3486 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: 5/5 constraints]
After SMT, in 4170ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1191 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 2 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 0 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 80 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 80 ms. Remains : 133/147 places, 675/693 transitions.
RANDOM walk for 40000 steps (2302 resets) in 270 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (347 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (373 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (407 resets) in 35 ms. (1111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (365 resets) in 30 ms. (1290 steps per ms) remains 6/7 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (392 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (352 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (370 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
// Phase 1: matrix 675 rows 133 cols
[2024-05-29 19:18:49] [INFO ] Computed 6 invariants in 4 ms
[2024-05-29 19:18:49] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 63/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 675/808 variables, 133/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 48/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 63/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 1 ms to minimize.
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 675/808 variables, 133/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 48/189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:18:50] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:18:51] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/808 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:18:52] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/808 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:18:53] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/808 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/808 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 199 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4761 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 5251ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1359 ms.
Support contains 52 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 675/675 transitions.
Graph (trivial) has 36 edges and 133 vertex of which 12 / 133 are part of one of the 5 SCC in 0 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.1 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 125 transition count 657
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 120 transition count 652
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 24 place count 115 transition count 651
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 115 transition count 649
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 113 transition count 649
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 112 transition count 648
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 112 transition count 648
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 109 transition count 645
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 109 transition count 641
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 42 place count 108 transition count 641
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 45 place count 108 transition count 638
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 107 transition count 637
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 107 transition count 637
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 107 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 105 transition count 635
Applied a total of 51 rules in 80 ms. Remains 105 /133 variables (removed 28) and now considering 635/675 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 105/133 places, 635/675 transitions.
RANDOM walk for 40000 steps (2610 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (392 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (417 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (470 resets) in 52 ms. (754 steps per ms) remains 4/5 properties
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (465 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (416 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
// Phase 1: matrix 635 rows 105 cols
[2024-05-29 19:18:55] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 19:18:56] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 635/740 variables, 105/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 126/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/740 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 237 constraints, problems are : Problem set: 0 solved, 4 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 19:18:56] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:18:56] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 635/740 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 126/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 19:18:57] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/740 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/740 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 244 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1898 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2311ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 288 ms.
Support contains 51 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 635/635 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 105 transition count 634
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 633
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 633
Applied a total of 4 rules in 22 ms. Remains 103 /105 variables (removed 2) and now considering 633/635 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 103/105 places, 633/635 transitions.
RANDOM walk for 40000 steps (2587 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (398 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (424 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (414 resets) in 21 ms. (1818 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1124877 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :0 out of 3
Probabilistic random walk after 1124877 steps, saw 216333 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
// Phase 1: matrix 633 rows 103 cols
[2024-05-29 19:19:01] [INFO ] Computed 6 invariants in 6 ms
[2024-05-29 19:19:01] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 633/736 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 126/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/736 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 126/126 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:19:02] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 633/736 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:19:02] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/736 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/736 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 736/736 variables, and 240 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1503 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1824ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 51 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 633/633 transitions.
Applied a total of 0 rules in 16 ms. Remains 103 /103 variables (removed 0) and now considering 633/633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 103/103 places, 633/633 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 633/633 transitions.
Applied a total of 0 rules in 15 ms. Remains 103 /103 variables (removed 0) and now considering 633/633 (removed 0) transitions.
[2024-05-29 19:19:03] [INFO ] Invariant cache hit.
[2024-05-29 19:19:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 19:19:03] [INFO ] Invariant cache hit.
[2024-05-29 19:19:03] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-29 19:19:03] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-29 19:19:04] [INFO ] Redundant transitions in 31 ms returned []
Running 631 sub problems to find dead transitions.
[2024-05-29 19:19:04] [INFO ] Invariant cache hit.
[2024-05-29 19:19:04] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-05-29 19:19:09] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:19:10] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2024-05-29 19:19:10] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2024-05-29 19:19:10] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:19:10] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:19:10] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2024-05-29 19:19:11] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2024-05-29 19:19:11] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2024-05-29 19:19:11] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:19:12] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:19:12] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-29 19:19:12] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2024-05-29 19:19:13] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:19:13] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 633/736 variables, 103/123 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 126/249 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-05-29 19:19:33] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 736/736 variables, and 250 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 633/736 variables, 103/124 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 126/250 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 631/881 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-05-29 19:19:58] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 2 ms to minimize.
[2024-05-29 19:19:59] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:20:00] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:20:00] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:20:01] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/736 variables, and 886 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 20/20 constraints]
After SMT, in 63221ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 63228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63561 ms. Remains : 103/103 places, 633/633 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 632
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 632
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 12 place count 97 transition count 627
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 97 transition count 625
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 19 place count 97 transition count 625
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 96 transition count 624
Applied a total of 20 rules in 43 ms. Remains 96 /103 variables (removed 7) and now considering 624/633 (removed 9) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 624 rows 96 cols
[2024-05-29 19:20:07] [INFO ] Computed 6 invariants in 9 ms
[2024-05-29 19:20:07] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 19:20:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-29 19:20:07] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-29 19:20:07] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-29 19:20:08] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 967 ms.
[2024-05-29 19:20:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 19:20:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 633 transitions and 5476 arcs took 7 ms.
[2024-05-29 19:20:08] [INFO ] Flatten gal took : 128 ms
Total runtime 98127 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-05b

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 730
MODEL NAME: /home/mcc/execution/411/model
103 places, 633 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717010409574

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r399-tall-171690530100311"
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 ;