Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 18:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 11 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37M 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-09b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717015561253

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 20:46:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:46:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:46:04] [INFO ] Load time of PNML (sax parser for PT used): 1593 ms
[2024-05-29 20:46:04] [INFO ] Transformed 1243 places.
[2024-05-29 20:46:04] [INFO ] Transformed 41210 transitions.
[2024-05-29 20:46:04] [INFO ] Found NUPN structural information;
[2024-05-29 20:46:04] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 2025 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (257 resets) in 5035 ms. (7 steps per ms) remains 8/13 properties
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (30 resets) in 788 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 694 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (31 resets) in 599 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 714 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 402 ms. (99 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 453 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (31 resets) in 398 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (29 resets) in 364 ms. (109 steps per ms) remains 8/8 properties
// Phase 1: matrix 41210 rows 1243 cols
[2024-05-29 20:46:08] [INFO ] Computed 10 invariants in 1053 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1148/1243 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1243 variables, 1148/1253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 20:46:11] [INFO ] Flatten gal took : 5158 ms
SMT process timed out in 6683ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Graph (trivial) has 1094 edges and 1243 vertex of which 113 / 1243 are part of one of the 18 SCC in 13 ms
Free SCC test removed 95 places
Drop transitions (Empty/Sink Transition effects.) removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 2969 edges and 1148 vertex of which 1134 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.230 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 671 rules applied. Total rules applied 673 place count 1134 transition count 40411
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 692 rules applied. Total rules applied 1365 place count 470 transition count 40383
Reduce places removed 14 places and 0 transitions.
[2024-05-29 20:46:15] [INFO ] Flatten gal took : 4007 ms
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 2 with 67 rules applied. Total rules applied 1432 place count 456 transition count 40330
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 1486 place count 403 transition count 40329
[2024-05-29 20:46:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8725051434290657457.gal : 755 ms
[2024-05-29 20:46:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15584639438107431307.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8725051434290657457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15584639438107431307.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 1486 place count 403 transition count 40302
Deduced a syphon composed of 27 places in 28 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1540 place count 376 transition count 40302
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1588 place count 328 transition count 40254
Iterating global reduction 4 with 48 rules applied. Total rules applied 1636 place count 328 transition count 40254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 1639 place count 328 transition count 40251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1640 place count 327 transition count 40251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1640 place count 327 transition count 40250
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1642 place count 326 transition count 40250
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1651 place count 317 transition count 11358
Iterating global reduction 6 with 9 rules applied. Total rules applied 1660 place count 317 transition count 11358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1662 place count 317 transition count 11356
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 1734 place count 281 transition count 11320
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1738 place count 277 transition count 11316
Iterating global reduction 7 with 4 rules applied. Total rules applied 1742 place count 277 transition count 11316
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 1772 place count 262 transition count 11328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1773 place count 262 transition count 11327
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1774 place count 262 transition count 11326
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 1829 place count 262 transition count 11271
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 1884 place count 207 transition count 11271
Drop transitions (Redundant composition of simpler transitions.) removed 2919 transitions
Redundant transition composition rules discarded 2919 transitions
Iterating global reduction 9 with 2919 rules applied. Total rules applied 4803 place count 207 transition count 8352
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4807 place count 207 transition count 8352
Loading property file /tmp/ReachabilityCardinality15584639438107431307.prop.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4808 place count 207 transition count 8352
Applied a total of 4808 rules in 34386 ms. Remains 207 /1243 variables (removed 1036) and now considering 8352/41210 (removed 32858) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34409 ms. Remains : 207/1243 places, 8352/41210 transitions.
RANDOM walk for 40000 steps (1170 resets) in 2562 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (129 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (131 resets) in 247 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (132 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (127 resets) in 522 ms. (76 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (138 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (133 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (128 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (131 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
// Phase 1: matrix 8352 rows 207 cols
[2024-05-29 20:46:50] [INFO ] Computed 10 invariants in 57 ms
[2024-05-29 20:46:56] [INFO ] State equation strengthened by 7104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 135/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8352/8559 variables, 207/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8559 variables, 7104/7321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8559 variables, 0/7321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/8559 variables, 0/7321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8559/8559 variables, and 7321 constraints, problems are : Problem set: 0 solved, 7 unsolved in 24343 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, ReadFeed: 7104/7104 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 135/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 20:47:23] [INFO ] Deduced a trap composed of 31 places in 2629 ms of which 12 ms to minimize.
[2024-05-29 20:47:26] [INFO ] Deduced a trap composed of 23 places in 2778 ms of which 2 ms to minimize.
[2024-05-29 20:47:28] [INFO ] Deduced a trap composed of 27 places in 2739 ms of which 2 ms to minimize.
[2024-05-29 20:47:31] [INFO ] Deduced a trap composed of 27 places in 2455 ms of which 2 ms to minimize.
[2024-05-29 20:47:33] [INFO ] Deduced a trap composed of 26 places in 2161 ms of which 1 ms to minimize.
[2024-05-29 20:47:35] [INFO ] Deduced a trap composed of 25 places in 2446 ms of which 1 ms to minimize.
[2024-05-29 20:47:38] [INFO ] Deduced a trap composed of 25 places in 2346 ms of which 1 ms to minimize.
[2024-05-29 20:47:40] [INFO ] Deduced a trap composed of 23 places in 2631 ms of which 3 ms to minimize.
[2024-05-29 20:47:43] [INFO ] Deduced a trap composed of 30 places in 2974 ms of which 4 ms to minimize.
[2024-05-29 20:47:46] [INFO ] Deduced a trap composed of 30 places in 2631 ms of which 12 ms to minimize.
[2024-05-29 20:47:48] [INFO ] Deduced a trap composed of 28 places in 2324 ms of which 1 ms to minimize.
[2024-05-29 20:47:51] [INFO ] Deduced a trap composed of 17 places in 2158 ms of which 2 ms to minimize.
[2024-05-29 20:47:53] [INFO ] Deduced a trap composed of 16 places in 2528 ms of which 1 ms to minimize.
[2024-05-29 20:47:55] [INFO ] Deduced a trap composed of 25 places in 2235 ms of which 2 ms to minimize.
[2024-05-29 20:47:58] [INFO ] Deduced a trap composed of 22 places in 2576 ms of which 2 ms to minimize.
[2024-05-29 20:48:00] [INFO ] Deduced a trap composed of 35 places in 2395 ms of which 2 ms to minimize.
[2024-05-29 20:48:02] [INFO ] Deduced a trap composed of 22 places in 2180 ms of which 8 ms to minimize.
[2024-05-29 20:48:05] [INFO ] Deduced a trap composed of 27 places in 2143 ms of which 2 ms to minimize.
[2024-05-29 20:48:07] [INFO ] Deduced a trap composed of 30 places in 1845 ms of which 1 ms to minimize.
SMT process timed out in 76639ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 72 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 8352/8352 transitions.
Graph (trivial) has 58 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 203 transition count 8332
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 191 transition count 8329
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 188 transition count 8328
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 188 transition count 8322
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 182 transition count 8322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 180 transition count 8320
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 180 transition count 8320
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 175 transition count 8315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 62 place count 175 transition count 8311
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 174 transition count 8310
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 174 transition count 8310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 70 place count 171 transition count 8312
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 82 place count 171 transition count 8300
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 171 transition count 8298
Free-agglomeration rule applied 5 times with reduction of 1512 identical transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 89 place count 171 transition count 6781
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2592 transitions
Reduce isomorphic transitions removed 2592 transitions.
Iterating post reduction 5 with 2597 rules applied. Total rules applied 2686 place count 166 transition count 4189
Applied a total of 2686 rules in 13471 ms. Remains 166 /207 variables (removed 41) and now considering 4189/8352 (removed 4163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13471 ms. Remains : 166/207 places, 4189/8352 transitions.
RANDOM walk for 40000 steps (1322 resets) in 1193 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (158 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (154 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (157 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (152 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (155 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (155 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (154 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 231366 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 7
Probabilistic random walk after 231366 steps, saw 39754 distinct states, run finished after 3005 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 4189 rows 166 cols
[2024-05-29 20:48:24] [INFO ] Computed 10 invariants in 25 ms
[2024-05-29 20:48:25] [INFO ] State equation strengthened by 3720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 94/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4189/4355 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4355 variables, 3720/3896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4355 variables, 0/3896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/4355 variables, 0/3896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4355/4355 variables, and 3896 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4769 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 3720/3720 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 94/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 20:48:31] [INFO ] Deduced a trap composed of 20 places in 1294 ms of which 1 ms to minimize.
[2024-05-29 20:48:32] [INFO ] Deduced a trap composed of 22 places in 1273 ms of which 1 ms to minimize.
[2024-05-29 20:48:33] [INFO ] Deduced a trap composed of 23 places in 1281 ms of which 2 ms to minimize.
[2024-05-29 20:48:35] [INFO ] Deduced a trap composed of 12 places in 1452 ms of which 1 ms to minimize.
[2024-05-29 20:48:36] [INFO ] Deduced a trap composed of 21 places in 1172 ms of which 4 ms to minimize.
[2024-05-29 20:48:37] [INFO ] Deduced a trap composed of 13 places in 1134 ms of which 1 ms to minimize.
[2024-05-29 20:48:38] [INFO ] Deduced a trap composed of 21 places in 969 ms of which 1 ms to minimize.
[2024-05-29 20:48:39] [INFO ] Deduced a trap composed of 26 places in 949 ms of which 1 ms to minimize.
[2024-05-29 20:48:40] [INFO ] Deduced a trap composed of 30 places in 872 ms of which 1 ms to minimize.
[2024-05-29 20:48:41] [INFO ] Deduced a trap composed of 20 places in 832 ms of which 1 ms to minimize.
[2024-05-29 20:48:42] [INFO ] Deduced a trap composed of 16 places in 1099 ms of which 1 ms to minimize.
[2024-05-29 20:48:43] [INFO ] Deduced a trap composed of 23 places in 969 ms of which 1 ms to minimize.
[2024-05-29 20:48:44] [INFO ] Deduced a trap composed of 14 places in 1055 ms of which 1 ms to minimize.
[2024-05-29 20:48:45] [INFO ] Deduced a trap composed of 28 places in 1047 ms of which 1 ms to minimize.
[2024-05-29 20:48:46] [INFO ] Deduced a trap composed of 19 places in 872 ms of which 2 ms to minimize.
[2024-05-29 20:48:47] [INFO ] Deduced a trap composed of 24 places in 1262 ms of which 10 ms to minimize.
[2024-05-29 20:48:48] [INFO ] Deduced a trap composed of 28 places in 994 ms of which 1 ms to minimize.
[2024-05-29 20:48:49] [INFO ] Deduced a trap composed of 26 places in 1158 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-09b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 20:48:50] [INFO ] Deduced a trap composed of 22 places in 957 ms of which 1 ms to minimize.
[2024-05-29 20:48:52] [INFO ] Deduced a trap composed of 20 places in 1347 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-09b-ReachabilityCardinality-2024-06 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/30 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:48:52] [INFO ] Deduced a trap composed of 32 places in 807 ms of which 2 ms to minimize.
[2024-05-29 20:48:53] [INFO ] Deduced a trap composed of 24 places in 810 ms of which 0 ms to minimize.
[2024-05-29 20:48:54] [INFO ] Deduced a trap composed of 30 places in 709 ms of which 1 ms to minimize.
[2024-05-29 20:48:55] [INFO ] Deduced a trap composed of 25 places in 672 ms of which 1 ms to minimize.
[2024-05-29 20:48:55] [INFO ] Deduced a trap composed of 20 places in 753 ms of which 0 ms to minimize.
[2024-05-29 20:48:57] [INFO ] Deduced a trap composed of 21 places in 1152 ms of which 1 ms to minimize.
[2024-05-29 20:48:58] [INFO ] Deduced a trap composed of 22 places in 1162 ms of which 1 ms to minimize.
[2024-05-29 20:48:59] [INFO ] Deduced a trap composed of 22 places in 917 ms of which 1 ms to minimize.
[2024-05-29 20:49:00] [INFO ] Deduced a trap composed of 28 places in 863 ms of which 0 ms to minimize.
[2024-05-29 20:49:00] [INFO ] Deduced a trap composed of 27 places in 712 ms of which 1 ms to minimize.
[2024-05-29 20:49:01] [INFO ] Deduced a trap composed of 20 places in 632 ms of which 0 ms to minimize.
[2024-05-29 20:49:02] [INFO ] Deduced a trap composed of 18 places in 977 ms of which 3 ms to minimize.
[2024-05-29 20:49:03] [INFO ] Deduced a trap composed of 18 places in 890 ms of which 1 ms to minimize.
[2024-05-29 20:49:04] [INFO ] Deduced a trap composed of 30 places in 787 ms of which 1 ms to minimize.
[2024-05-29 20:49:04] [INFO ] Deduced a trap composed of 26 places in 772 ms of which 1 ms to minimize.
[2024-05-29 20:49:05] [INFO ] Deduced a trap composed of 27 places in 776 ms of which 1 ms to minimize.
[2024-05-29 20:49:06] [INFO ] Deduced a trap composed of 25 places in 679 ms of which 1 ms to minimize.
[2024-05-29 20:49:07] [INFO ] Deduced a trap composed of 27 places in 740 ms of which 13 ms to minimize.
[2024-05-29 20:49:08] [INFO ] Deduced a trap composed of 11 places in 798 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 19/49 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:09] [INFO ] Deduced a trap composed of 20 places in 955 ms of which 1 ms to minimize.
[2024-05-29 20:49:09] [INFO ] Deduced a trap composed of 17 places in 946 ms of which 1 ms to minimize.
[2024-05-29 20:49:11] [INFO ] Deduced a trap composed of 16 places in 1027 ms of which 1 ms to minimize.
[2024-05-29 20:49:11] [INFO ] Deduced a trap composed of 27 places in 831 ms of which 1 ms to minimize.
[2024-05-29 20:49:12] [INFO ] Deduced a trap composed of 19 places in 1070 ms of which 1 ms to minimize.
[2024-05-29 20:49:14] [INFO ] Deduced a trap composed of 23 places in 1068 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 6/55 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:15] [INFO ] Deduced a trap composed of 24 places in 924 ms of which 1 ms to minimize.
[2024-05-29 20:49:16] [INFO ] Deduced a trap composed of 16 places in 922 ms of which 1 ms to minimize.
[2024-05-29 20:49:16] [INFO ] Deduced a trap composed of 12 places in 776 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 3/58 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:17] [INFO ] Deduced a trap composed of 22 places in 832 ms of which 2 ms to minimize.
[2024-05-29 20:49:18] [INFO ] Deduced a trap composed of 28 places in 726 ms of which 0 ms to minimize.
[2024-05-29 20:49:19] [INFO ] Deduced a trap composed of 27 places in 800 ms of which 1 ms to minimize.
[2024-05-29 20:49:20] [INFO ] Deduced a trap composed of 24 places in 675 ms of which 1 ms to minimize.
[2024-05-29 20:49:20] [INFO ] Deduced a trap composed of 17 places in 795 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 5/63 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:21] [INFO ] Deduced a trap composed of 19 places in 731 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4189/4355 variables, 166/230 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4355 variables, 3720/3950 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4355 variables, 4/3954 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:29] [INFO ] Deduced a trap composed of 22 places in 899 ms of which 1 ms to minimize.
[2024-05-29 20:49:31] [INFO ] Deduced a trap composed of 18 places in 1064 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4355 variables, 2/3956 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4355 variables, 0/3956 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:35] [INFO ] Deduced a trap composed of 25 places in 997 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/4355 variables, 1/3957 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :13 after 20
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :20 after 35
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :35 after 346
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :346 after 5495
At refinement iteration 15 (INCLUDED_ONLY) 0/4355 variables, 0/3957 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 20:49:38] [INFO ] Deduced a trap composed of 27 places in 688 ms of which 1 ms to minimize.
[2024-05-29 20:49:39] [INFO ] Deduced a trap composed of 20 places in 800 ms of which 1 ms to minimize.
[2024-05-29 20:49:40] [INFO ] Deduced a trap composed of 29 places in 856 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/4355 variables, 3/3960 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5495 after 370183
At refinement iteration 17 (INCLUDED_ONLY) 0/4355 variables, 0/3960 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/4355 variables, 0/3960 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :370183 after 539333
After SMT solving in domain Int declared 4355/4355 variables, and 3960 constraints, problems are : Problem set: 1 solved, 6 unsolved in 74373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 3720/3720 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 60/60 constraints]
After SMT, in 80023ms problems are : Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :539333 after 541616
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :541616 after 1.13085e+06
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.13085e+06 after 1.48789e+06
Parikh walk visited 0 properties in 6515 ms.
Support contains 60 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 4189/4189 transitions.
Graph (trivial) has 29 edges and 166 vertex of which 4 / 166 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.
Graph (complete) has 866 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 163 transition count 4178
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 157 transition count 4175
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 154 transition count 4175
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 21 place count 154 transition count 4172
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 27 place count 151 transition count 4172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 150 transition count 4171
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 150 transition count 4171
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 150 transition count 4168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 147 transition count 4168
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.48789e+06 after 3.45271e+06
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 147 transition count 4166
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 147 transition count 4166
Applied a total of 38 rules in 5867 ms. Remains 147 /166 variables (removed 19) and now considering 4166/4189 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5867 ms. Remains : 147/166 places, 4166/4189 transitions.
RANDOM walk for 40000 steps (1385 resets) in 957 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (167 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (165 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (171 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (168 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (162 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (170 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 227670 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 6
Probabilistic random walk after 227670 steps, saw 40857 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 4166 rows 147 cols
[2024-05-29 20:50:00] [INFO ] Computed 10 invariants in 26 ms
[2024-05-29 20:50:00] [INFO ] State equation strengthened by 3720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/147 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4313 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :3.45271e+06 after 2.1342e+07
At refinement iteration 4 (INCLUDED_ONLY) 0/4313 variables, 3720/3877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4313 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/4313 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4313/4313 variables, and 3877 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4451 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 147/147 constraints, ReadFeed: 3720/3720 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/147 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:50:06] [INFO ] Deduced a trap composed of 20 places in 1278 ms of which 1 ms to minimize.
[2024-05-29 20:50:08] [INFO ] Deduced a trap composed of 15 places in 1277 ms of which 1 ms to minimize.
[2024-05-29 20:50:09] [INFO ] Deduced a trap composed of 17 places in 1285 ms of which 1 ms to minimize.
[2024-05-29 20:50:10] [INFO ] Deduced a trap composed of 14 places in 1294 ms of which 1 ms to minimize.
[2024-05-29 20:50:11] [INFO ] Deduced a trap composed of 11 places in 1114 ms of which 1 ms to minimize.
[2024-05-29 20:50:12] [INFO ] Deduced a trap composed of 12 places in 944 ms of which 1 ms to minimize.
[2024-05-29 20:50:13] [INFO ] Deduced a trap composed of 17 places in 832 ms of which 1 ms to minimize.
[2024-05-29 20:50:14] [INFO ] Deduced a trap composed of 22 places in 734 ms of which 0 ms to minimize.
[2024-05-29 20:50:15] [INFO ] Deduced a trap composed of 13 places in 1049 ms of which 0 ms to minimize.
[2024-05-29 20:50:16] [INFO ] Deduced a trap composed of 15 places in 1037 ms of which 1 ms to minimize.
[2024-05-29 20:50:17] [INFO ] Deduced a trap composed of 19 places in 1031 ms of which 1 ms to minimize.
[2024-05-29 20:50:18] [INFO ] Deduced a trap composed of 25 places in 930 ms of which 1 ms to minimize.
[2024-05-29 20:50:19] [INFO ] Deduced a trap composed of 22 places in 1143 ms of which 1 ms to minimize.
[2024-05-29 20:50:20] [INFO ] Deduced a trap composed of 18 places in 1127 ms of which 1 ms to minimize.
[2024-05-29 20:50:21] [INFO ] Deduced a trap composed of 19 places in 1048 ms of which 1 ms to minimize.
[2024-05-29 20:50:23] [INFO ] Deduced a trap composed of 18 places in 1211 ms of which 1 ms to minimize.
[2024-05-29 20:50:24] [INFO ] Deduced a trap composed of 18 places in 868 ms of which 1 ms to minimize.
[2024-05-29 20:50:24] [INFO ] Deduced a trap composed of 22 places in 747 ms of which 1 ms to minimize.
[2024-05-29 20:50:25] [INFO ] Deduced a trap composed of 13 places in 740 ms of which 1 ms to minimize.
[2024-05-29 20:50:26] [INFO ] Deduced a trap composed of 18 places in 779 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:50:27] [INFO ] Deduced a trap composed of 16 places in 910 ms of which 1 ms to minimize.
[2024-05-29 20:50:28] [INFO ] Deduced a trap composed of 14 places in 905 ms of which 1 ms to minimize.
[2024-05-29 20:50:29] [INFO ] Deduced a trap composed of 20 places in 848 ms of which 1 ms to minimize.
[2024-05-29 20:50:29] [INFO ] Deduced a trap composed of 18 places in 903 ms of which 0 ms to minimize.
[2024-05-29 20:50:30] [INFO ] Deduced a trap composed of 26 places in 800 ms of which 1 ms to minimize.
[2024-05-29 20:50:31] [INFO ] Deduced a trap composed of 23 places in 862 ms of which 1 ms to minimize.
[2024-05-29 20:50:32] [INFO ] Deduced a trap composed of 21 places in 867 ms of which 1 ms to minimize.
[2024-05-29 20:50:33] [INFO ] Deduced a trap composed of 20 places in 1079 ms of which 1 ms to minimize.
[2024-05-29 20:50:34] [INFO ] Deduced a trap composed of 26 places in 956 ms of which 1 ms to minimize.
[2024-05-29 20:50:35] [INFO ] Deduced a trap composed of 20 places in 961 ms of which 2 ms to minimize.
[2024-05-29 20:50:36] [INFO ] Deduced a trap composed of 22 places in 960 ms of which 1 ms to minimize.
[2024-05-29 20:50:37] [INFO ] Deduced a trap composed of 26 places in 848 ms of which 1 ms to minimize.
[2024-05-29 20:50:38] [INFO ] Deduced a trap composed of 25 places in 887 ms of which 1 ms to minimize.
[2024-05-29 20:50:39] [INFO ] Deduced a trap composed of 23 places in 880 ms of which 1 ms to minimize.
[2024-05-29 20:50:39] [INFO ] Deduced a trap composed of 19 places in 707 ms of which 1 ms to minimize.
[2024-05-29 20:50:40] [INFO ] Deduced a trap composed of 25 places in 604 ms of which 1 ms to minimize.
[2024-05-29 20:50:41] [INFO ] Deduced a trap composed of 15 places in 707 ms of which 1 ms to minimize.
[2024-05-29 20:50:41] [INFO ] Deduced a trap composed of 21 places in 620 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :2.1342e+07 after 2.61383e+09
[2024-05-29 20:50:42] [INFO ] Deduced a trap composed of 17 places in 631 ms of which 1 ms to minimize.
[2024-05-29 20:50:43] [INFO ] Deduced a trap composed of 21 places in 1452 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:50:44] [INFO ] Deduced a trap composed of 17 places in 772 ms of which 1 ms to minimize.
[2024-05-29 20:50:45] [INFO ] Deduced a trap composed of 21 places in 1082 ms of which 1 ms to minimize.
[2024-05-29 20:50:46] [INFO ] Deduced a trap composed of 20 places in 938 ms of which 1 ms to minimize.
[2024-05-29 20:50:47] [INFO ] Deduced a trap composed of 21 places in 834 ms of which 1 ms to minimize.
[2024-05-29 20:50:48] [INFO ] Deduced a trap composed of 12 places in 985 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:50:49] [INFO ] Deduced a trap composed of 20 places in 1005 ms of which 1 ms to minimize.
[2024-05-29 20:50:50] [INFO ] Deduced a trap composed of 15 places in 955 ms of which 1 ms to minimize.
[2024-05-29 20:50:51] [INFO ] Deduced a trap composed of 19 places in 968 ms of which 0 ms to minimize.
[2024-05-29 20:50:52] [INFO ] Deduced a trap composed of 15 places in 960 ms of which 1 ms to minimize.
[2024-05-29 20:50:53] [INFO ] Deduced a trap composed of 18 places in 909 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:50:54] [INFO ] Deduced a trap composed of 23 places in 861 ms of which 1 ms to minimize.
[2024-05-29 20:50:55] [INFO ] Deduced a trap composed of 15 places in 736 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:50:56] [INFO ] Deduced a trap composed of 23 places in 651 ms of which 1 ms to minimize.
[2024-05-29 20:50:56] [INFO ] Deduced a trap composed of 22 places in 650 ms of which 0 ms to minimize.
[2024-05-29 20:50:57] [INFO ] Deduced a trap composed of 18 places in 752 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4166/4313 variables, 147/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4313 variables, 3720/3932 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4313 variables, 4/3936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:51:06] [INFO ] Deduced a trap composed of 19 places in 1037 ms of which 1 ms to minimize.
[2024-05-29 20:51:07] [INFO ] Deduced a trap composed of 21 places in 1015 ms of which 1 ms to minimize.
[2024-05-29 20:51:08] [INFO ] Deduced a trap composed of 22 places in 901 ms of which 1 ms to minimize.
[2024-05-29 20:51:09] [INFO ] Deduced a trap composed of 17 places in 799 ms of which 1 ms to minimize.
[2024-05-29 20:51:10] [INFO ] Deduced a trap composed of 22 places in 695 ms of which 1 ms to minimize.
[2024-05-29 20:51:11] [INFO ] Deduced a trap composed of 20 places in 954 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4313 variables, 6/3942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:51:14] [INFO ] Deduced a trap composed of 24 places in 906 ms of which 1 ms to minimize.
[2024-05-29 20:51:14] [INFO ] Deduced a trap composed of 24 places in 746 ms of which 0 ms to minimize.
[2024-05-29 20:51:15] [INFO ] Deduced a trap composed of 27 places in 641 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4313 variables, 3/3945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4313 variables, 0/3945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/4313 variables, 0/3945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4313/4313 variables, and 3945 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74987 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 147/147 constraints, ReadFeed: 3720/3720 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 64/64 constraints]
After SMT, in 80252ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5848 ms.
Support contains 60 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 4166/4166 transitions.
Applied a total of 0 rules in 1397 ms. Remains 147 /147 variables (removed 0) and now considering 4166/4166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1397 ms. Remains : 147/147 places, 4166/4166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 4166/4166 transitions.
Applied a total of 0 rules in 1416 ms. Remains 147 /147 variables (removed 0) and now considering 4166/4166 (removed 0) transitions.
[2024-05-29 20:51:29] [INFO ] Invariant cache hit.
[2024-05-29 20:51:29] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-29 20:51:29] [INFO ] Invariant cache hit.
[2024-05-29 20:51:31] [INFO ] State equation strengthened by 3720 read => feed constraints.
[2024-05-29 20:51:34] [INFO ] Implicit Places using invariants and state equation in 5081 ms returned []
Implicit Place search using SMT with State Equation took 5699 ms to find 0 implicit places.
[2024-05-29 20:51:35] [INFO ] Redundant transitions in 377 ms returned []
Running 4150 sub problems to find dead transitions.
[2024-05-29 20:51:35] [INFO ] Invariant cache hit.
[2024-05-29 20:51:36] [INFO ] State equation strengthened by 3720 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4150 unsolved
SMT process timed out in 97551ms, After SMT, problems are : Problem set: 0 solved, 4150 unsolved
Search for dead transitions found 0 dead transitions in 97600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105131 ms. Remains : 147/147 places, 4166/4166 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 489 ms. Remains 147 /147 variables (removed 0) and now considering 4166/4166 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-29 20:53:13] [INFO ] Invariant cache hit.
[2024-05-29 20:53:13] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-29 20:53:13] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:53:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-29 20:53:14] [INFO ] After 964ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :6
[2024-05-29 20:53:14] [INFO ] After 1053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1731 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 20:53:19] [INFO ] Flatten gal took : 3975 ms
[2024-05-29 20:53:19] [INFO ] Applying decomposition
[2024-05-29 20:53:23] [INFO ] Flatten gal took : 3840 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12179122573075836463.txt' '-o' '/tmp/graph12179122573075836463.bin' '-w' '/tmp/graph12179122573075836463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12179122573075836463.bin' '-l' '-1' '-v' '-w' '/tmp/graph12179122573075836463.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:53:37] [INFO ] Decomposing Gal with order
[2024-05-29 20:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:53:47] [INFO ] Removed a total of 359079 redundant transitions.
[2024-05-29 20:53:48] [INFO ] Flatten gal took : 7257 ms
[2024-05-29 20:53:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2746 ms.
[2024-05-29 20:53:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality882623680516066748.gal : 266 ms
[2024-05-29 20:53:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5596109241904509159.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality882623680516066748.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5596109241904509159.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality5596109241904509159.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 474
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :474 after 3.26739e+09

BK_STOP 1717016144324

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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