Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.4K 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 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:39 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 38M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717235639347

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:54:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:54:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:54:02] [INFO ] Load time of PNML (sax parser for PT used): 1600 ms
[2024-06-01 09:54:02] [INFO ] Transformed 2746 places.
[2024-06-01 09:54:02] [INFO ] Transformed 42776 transitions.
[2024-06-01 09:54:02] [INFO ] Found NUPN structural information;
[2024-06-01 09:54:02] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 2120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (242 resets) in 2891 ms. (13 steps per ms) remains 11/13 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 341 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (31 resets) in 374 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 348 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 503 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 281 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (30 resets) in 305 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (28 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (27 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (29 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
// Phase 1: matrix 42776 rows 2746 cols
[2024-06-01 09:54:06] [INFO ] Computed 10 invariants in 1505 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2599/2727 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2727 variables, 2599/2736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/2736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/2746 variables, 1/2737 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2746 variables, 19/2756 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2746 variables, 0/2756 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 7336ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2469 edges and 2746 vertex of which 147 / 2746 are part of one of the 22 SCC in 16 ms
Free SCC test removed 125 places
Drop transitions (Empty/Sink Transition effects.) removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Graph (complete) has 4713 edges and 2621 vertex of which 2607 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.145 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 1791 transitions
Trivial Post-agglo rules discarded 1791 transitions
Performed 1791 trivial Post agglomeration. Transition count delta: 1791
Iterating post reduction 0 with 1798 rules applied. Total rules applied 1800 place count 2607 transition count 40812
Reduce places removed 1791 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 1 with 1822 rules applied. Total rules applied 3622 place count 816 transition count 40781
Reduce places removed 12 places and 0 transitions.
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Iterating post reduction 2 with 124 rules applied. Total rules applied 3746 place count 804 transition count 40669
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 116 rules applied. Total rules applied 3862 place count 692 transition count 40665
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 3862 place count 692 transition count 40563
Deduced a syphon composed of 102 places in 30 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 4066 place count 590 transition count 40563
Discarding 85 places :
Symmetric choice reduction at 4 with 85 rule applications. Total rules 4151 place count 505 transition count 40478
Iterating global reduction 4 with 85 rules applied. Total rules applied 4236 place count 505 transition count 40478
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 4239 place count 505 transition count 40475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4240 place count 504 transition count 40475
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4240 place count 504 transition count 40473
Deduced a syphon composed of 2 places in 31 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4244 place count 502 transition count 40473
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 4280 place count 466 transition count 2606
Iterating global reduction 6 with 36 rules applied. Total rules applied 4316 place count 466 transition count 2606
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4324 place count 466 transition count 2598
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4328 place count 462 transition count 2594
Iterating global reduction 7 with 4 rules applied. Total rules applied 4332 place count 462 transition count 2594
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4333 place count 461 transition count 2593
Iterating global reduction 7 with 1 rules applied. Total rules applied 4334 place count 461 transition count 2593
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 4412 place count 422 transition count 2554
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4419 place count 415 transition count 2547
Iterating global reduction 7 with 7 rules applied. Total rules applied 4426 place count 415 transition count 2547
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4430 place count 411 transition count 2543
Iterating global reduction 7 with 4 rules applied. Total rules applied 4434 place count 411 transition count 2543
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4437 place count 408 transition count 2540
Iterating global reduction 7 with 3 rules applied. Total rules applied 4440 place count 408 transition count 2540
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 4448 place count 404 transition count 2558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4449 place count 404 transition count 2557
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 4454 place count 404 transition count 2552
Free-agglomeration rule applied 76 times.
Iterating global reduction 8 with 76 rules applied. Total rules applied 4530 place count 404 transition count 2476
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 8 with 76 rules applied. Total rules applied 4606 place count 328 transition count 2476
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 4611 place count 323 transition count 2471
Iterating global reduction 9 with 5 rules applied. Total rules applied 4616 place count 323 transition count 2471
Drop transitions (Redundant composition of simpler transitions.) removed 507 transitions
Redundant transition composition rules discarded 507 transitions
Iterating global reduction 9 with 507 rules applied. Total rules applied 5123 place count 323 transition count 1964
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 5130 place count 323 transition count 1964
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 5133 place count 323 transition count 1961
Applied a total of 5133 rules in 8312 ms. Remains 323 /2746 variables (removed 2423) and now considering 1961/42776 (removed 40815) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8323 ms. Remains : 323/2746 places, 1961/42776 transitions.
RANDOM walk for 40000 steps (614 resets) in 1196 ms. (33 steps per ms) remains 8/11 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (70 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (71 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (71 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (70 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (70 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (70 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (71 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
// Phase 1: matrix 1961 rows 323 cols
[2024-06-01 09:54:21] [INFO ] Computed 10 invariants in 20 ms
[2024-06-01 09:54:21] [INFO ] State equation strengthened by 1371 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 206/322 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/323 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1961/2284 variables, 323/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2284 variables, 1371/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2284 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2284 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2284/2284 variables, and 1704 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2209 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 323/323 constraints, ReadFeed: 1371/1371 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 206/322 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 09:54:25] [INFO ] Deduced a trap composed of 42 places in 918 ms of which 22 ms to minimize.
[2024-06-01 09:54:25] [INFO ] Deduced a trap composed of 47 places in 884 ms of which 2 ms to minimize.
[2024-06-01 09:54:26] [INFO ] Deduced a trap composed of 45 places in 756 ms of which 3 ms to minimize.
[2024-06-01 09:54:27] [INFO ] Deduced a trap composed of 74 places in 805 ms of which 4 ms to minimize.
[2024-06-01 09:54:28] [INFO ] Deduced a trap composed of 36 places in 740 ms of which 6 ms to minimize.
[2024-06-01 09:54:28] [INFO ] Deduced a trap composed of 37 places in 641 ms of which 2 ms to minimize.
[2024-06-01 09:54:29] [INFO ] Deduced a trap composed of 52 places in 631 ms of which 3 ms to minimize.
[2024-06-01 09:54:30] [INFO ] Deduced a trap composed of 65 places in 630 ms of which 2 ms to minimize.
[2024-06-01 09:54:30] [INFO ] Deduced a trap composed of 50 places in 605 ms of which 1 ms to minimize.
[2024-06-01 09:54:31] [INFO ] Deduced a trap composed of 51 places in 560 ms of which 2 ms to minimize.
[2024-06-01 09:54:31] [INFO ] Deduced a trap composed of 48 places in 561 ms of which 1 ms to minimize.
[2024-06-01 09:54:32] [INFO ] Deduced a trap composed of 51 places in 727 ms of which 2 ms to minimize.
[2024-06-01 09:54:33] [INFO ] Deduced a trap composed of 62 places in 597 ms of which 2 ms to minimize.
[2024-06-01 09:54:33] [INFO ] Deduced a trap composed of 36 places in 620 ms of which 2 ms to minimize.
[2024-06-01 09:54:34] [INFO ] Deduced a trap composed of 47 places in 703 ms of which 5 ms to minimize.
[2024-06-01 09:54:35] [INFO ] Deduced a trap composed of 47 places in 709 ms of which 1 ms to minimize.
[2024-06-01 09:54:36] [INFO ] Deduced a trap composed of 46 places in 680 ms of which 4 ms to minimize.
[2024-06-01 09:54:36] [INFO ] Deduced a trap composed of 50 places in 728 ms of which 2 ms to minimize.
[2024-06-01 09:54:37] [INFO ] Deduced a trap composed of 72 places in 717 ms of which 1 ms to minimize.
[2024-06-01 09:54:38] [INFO ] Deduced a trap composed of 55 places in 655 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 09:54:39] [INFO ] Deduced a trap composed of 49 places in 765 ms of which 2 ms to minimize.
[2024-06-01 09:54:39] [INFO ] Deduced a trap composed of 46 places in 703 ms of which 3 ms to minimize.
[2024-06-01 09:54:40] [INFO ] Deduced a trap composed of 41 places in 767 ms of which 2 ms to minimize.
[2024-06-01 09:54:41] [INFO ] Deduced a trap composed of 56 places in 775 ms of which 2 ms to minimize.
[2024-06-01 09:54:42] [INFO ] Deduced a trap composed of 62 places in 767 ms of which 2 ms to minimize.
[2024-06-01 09:54:42] [INFO ] Deduced a trap composed of 51 places in 778 ms of which 3 ms to minimize.
[2024-06-01 09:54:43] [INFO ] Deduced a trap composed of 38 places in 768 ms of which 2 ms to minimize.
[2024-06-01 09:54:44] [INFO ] Deduced a trap composed of 53 places in 743 ms of which 2 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 60 places in 738 ms of which 3 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 55 places in 764 ms of which 2 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 63 places in 703 ms of which 2 ms to minimize.
[2024-06-01 09:54:47] [INFO ] Deduced a trap composed of 58 places in 621 ms of which 2 ms to minimize.
[2024-06-01 09:54:48] [INFO ] Deduced a trap composed of 67 places in 699 ms of which 2 ms to minimize.
[2024-06-01 09:54:48] [INFO ] Deduced a trap composed of 76 places in 675 ms of which 2 ms to minimize.
[2024-06-01 09:54:49] [INFO ] Deduced a trap composed of 47 places in 706 ms of which 17 ms to minimize.
[2024-06-01 09:54:50] [INFO ] Deduced a trap composed of 57 places in 635 ms of which 2 ms to minimize.
[2024-06-01 09:54:50] [INFO ] Deduced a trap composed of 57 places in 642 ms of which 2 ms to minimize.
[2024-06-01 09:54:51] [INFO ] Deduced a trap composed of 56 places in 708 ms of which 2 ms to minimize.
[2024-06-01 09:54:52] [INFO ] Deduced a trap composed of 72 places in 701 ms of which 2 ms to minimize.
[2024-06-01 09:54:52] [INFO ] Deduced a trap composed of 32 places in 668 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 09:54:53] [INFO ] Deduced a trap composed of 64 places in 679 ms of which 2 ms to minimize.
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 55 places in 620 ms of which 1 ms to minimize.
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 47 places in 646 ms of which 2 ms to minimize.
[2024-06-01 09:54:55] [INFO ] Deduced a trap composed of 43 places in 631 ms of which 1 ms to minimize.
[2024-06-01 09:54:56] [INFO ] Deduced a trap composed of 40 places in 575 ms of which 1 ms to minimize.
[2024-06-01 09:54:56] [INFO ] Deduced a trap composed of 61 places in 561 ms of which 3 ms to minimize.
[2024-06-01 09:54:57] [INFO ] Deduced a trap composed of 47 places in 590 ms of which 1 ms to minimize.
[2024-06-01 09:54:57] [INFO ] Deduced a trap composed of 60 places in 583 ms of which 2 ms to minimize.
[2024-06-01 09:54:58] [INFO ] Deduced a trap composed of 63 places in 542 ms of which 1 ms to minimize.
[2024-06-01 09:54:58] [INFO ] Deduced a trap composed of 54 places in 525 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 09:54:59] [INFO ] Deduced a trap composed of 44 places in 603 ms of which 2 ms to minimize.
[2024-06-01 09:55:00] [INFO ] Deduced a trap composed of 44 places in 598 ms of which 2 ms to minimize.
[2024-06-01 09:55:00] [INFO ] Deduced a trap composed of 54 places in 555 ms of which 1 ms to minimize.
[2024-06-01 09:55:01] [INFO ] Deduced a trap composed of 52 places in 578 ms of which 1 ms to minimize.
[2024-06-01 09:55:02] [INFO ] Deduced a trap composed of 43 places in 660 ms of which 2 ms to minimize.
[2024-06-01 09:55:02] [INFO ] Deduced a trap composed of 45 places in 560 ms of which 2 ms to minimize.
[2024-06-01 09:55:03] [INFO ] Deduced a trap composed of 44 places in 580 ms of which 5 ms to minimize.
[2024-06-01 09:55:03] [INFO ] Deduced a trap composed of 44 places in 667 ms of which 1 ms to minimize.
[2024-06-01 09:55:04] [INFO ] Deduced a trap composed of 42 places in 636 ms of which 2 ms to minimize.
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 19/68 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 09:55:05] [INFO ] Deduced a trap composed of 56 places in 569 ms of which 1 ms to minimize.
[2024-06-01 09:55:05] [INFO ] Deduced a trap composed of 54 places in 513 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 66 places in 552 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 51 places in 535 ms of which 1 ms to minimize.
[2024-06-01 09:55:07] [INFO ] Deduced a trap composed of 54 places in 489 ms of which 2 ms to minimize.
[2024-06-01 09:55:07] [INFO ] Deduced a trap composed of 56 places in 546 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 6/74 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 09:55:08] [INFO ] Deduced a trap composed of 43 places in 503 ms of which 1 ms to minimize.
[2024-06-01 09:55:09] [INFO ] Deduced a trap composed of 61 places in 534 ms of which 1 ms to minimize.
SMT process timed out in 47641ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 1961/1961 transitions.
Graph (trivial) has 192 edges and 323 vertex of which 18 / 323 are part of one of the 7 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1081 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 311 transition count 1863
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 83 rules applied. Total rules applied 163 place count 234 transition count 1857
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 169 place count 233 transition count 1852
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 177 place count 228 transition count 1849
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 177 place count 228 transition count 1839
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 197 place count 218 transition count 1839
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 213 place count 202 transition count 1568
Iterating global reduction 4 with 16 rules applied. Total rules applied 229 place count 202 transition count 1568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 202 transition count 1567
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 237 place count 195 transition count 1560
Iterating global reduction 5 with 7 rules applied. Total rules applied 244 place count 195 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 194 transition count 1559
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 194 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 193 transition count 1558
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 193 transition count 1558
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 280 place count 177 transition count 1542
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 295 place count 177 transition count 1527
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 311 place count 161 transition count 1511
Iterating global reduction 6 with 16 rules applied. Total rules applied 327 place count 161 transition count 1511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 329 place count 161 transition count 1509
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 338 place count 152 transition count 1500
Iterating global reduction 7 with 9 rules applied. Total rules applied 347 place count 152 transition count 1500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 349 place count 152 transition count 1498
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 353 place count 148 transition count 1494
Iterating global reduction 8 with 4 rules applied. Total rules applied 357 place count 148 transition count 1494
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 366 place count 148 transition count 1485
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 368 place count 147 transition count 1495
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 380 place count 147 transition count 1483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 382 place count 146 transition count 1491
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 386 place count 146 transition count 1487
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 409 place count 146 transition count 1464
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 432 place count 123 transition count 1464
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 441 place count 123 transition count 1455
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 444 place count 123 transition count 1455
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 446 place count 123 transition count 1453
Applied a total of 446 rules in 1504 ms. Remains 123 /323 variables (removed 200) and now considering 1453/1961 (removed 508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1504 ms. Remains : 123/323 places, 1453/1961 transitions.
RANDOM walk for 40000 steps (1200 resets) in 546 ms. (73 steps per ms) remains 5/6 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (145 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (151 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (146 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (145 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
// Phase 1: matrix 1453 rows 123 cols
[2024-06-01 09:55:10] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 09:55:11] [INFO ] State equation strengthened by 1336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 87/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/123 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1453/1576 variables, 123/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1576 variables, 1336/1469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1576 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1576 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 1469 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 123/123 constraints, ReadFeed: 1336/1336 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 87/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:55:12] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 1 ms to minimize.
[2024-06-01 09:55:13] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
[2024-06-01 09:55:13] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 1 ms to minimize.
[2024-06-01 09:55:14] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 0 ms to minimize.
[2024-06-01 09:55:14] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2024-06-01 09:55:14] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 1 ms to minimize.
[2024-06-01 09:55:15] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 1 ms to minimize.
[2024-06-01 09:55:15] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 1 ms to minimize.
[2024-06-01 09:55:17] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 1 ms to minimize.
[2024-06-01 09:55:17] [INFO ] Deduced a trap composed of 16 places in 338 ms of which 1 ms to minimize.
[2024-06-01 09:55:17] [INFO ] Deduced a trap composed of 17 places in 425 ms of which 0 ms to minimize.
[2024-06-01 09:55:18] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 1 ms to minimize.
[2024-06-01 09:55:18] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 1 ms to minimize.
[2024-06-01 09:55:19] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 1 ms to minimize.
[2024-06-01 09:55:19] [INFO ] Deduced a trap composed of 22 places in 436 ms of which 1 ms to minimize.
[2024-06-01 09:55:20] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 0 ms to minimize.
[2024-06-01 09:55:20] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/123 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:55:20] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2024-06-01 09:55:21] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 0 ms to minimize.
[2024-06-01 09:55:21] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 1 ms to minimize.
[2024-06-01 09:55:21] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 1 ms to minimize.
[2024-06-01 09:55:22] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 1 ms to minimize.
[2024-06-01 09:55:22] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 1 ms to minimize.
[2024-06-01 09:55:22] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1453/1576 variables, 123/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1576 variables, 1336/1496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 5/1501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1576 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1576/1576 variables, and 1501 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 123/123 constraints, ReadFeed: 1336/1336 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 27/27 constraints]
After SMT, in 14541ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 316 ms.
Support contains 24 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1453/1453 transitions.
Graph (trivial) has 35 edges and 123 vertex of which 2 / 123 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 520 edges and 122 vertex of which 121 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 121 transition count 1440
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 111 transition count 1440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 111 transition count 1438
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 109 transition count 1438
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 2 with 10 rules applied. Total rules applied 37 place count 104 transition count 1433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 104 transition count 1432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 42 place count 100 transition count 1428
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 100 transition count 1428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 50 place count 100 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 99 transition count 1423
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 99 transition count 1423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 99 transition count 1422
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 63 place count 99 transition count 1412
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 99 transition count 1410
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 97 transition count 1409
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 96 transition count 1407
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 96 transition count 1407
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 96 transition count 1407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 73 place count 96 transition count 1406
Applied a total of 73 rules in 848 ms. Remains 96 /123 variables (removed 27) and now considering 1406/1453 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 848 ms. Remains : 96/123 places, 1406/1453 transitions.
RANDOM walk for 40000 steps (1324 resets) in 441 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (170 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 402192 steps, run visited all 1 properties in 1357 ms. (steps per millisecond=296 )
Probabilistic random walk after 402192 steps, saw 59227 distinct states, run finished after 1361 ms. (steps per millisecond=295 ) properties seen :1
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 87642 ms.
ITS solved all properties within timeout

BK_STOP 1717235728200

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-08b, 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 r536-tall-171690531800198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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