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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 125M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 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 124M 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-10b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-07
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-08
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-11
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717253890757

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:58:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:58:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:58:16] [INFO ] Load time of PNML (sax parser for PT used): 4492 ms
[2024-06-01 14:58:16] [INFO ] Transformed 1379 places.
[2024-06-01 14:58:17] [INFO ] Transformed 120600 transitions.
[2024-06-01 14:58:17] [INFO ] Found NUPN structural information;
[2024-06-01 14:58:17] [INFO ] Parsed PT model containing 1379 places and 120600 transitions and 2385526 arcs in 5224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (233 resets) in 5756 ms. (6 steps per ms) remains 9/12 properties
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (25 resets) in 755 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (25 resets) in 932 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 532 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (27 resets) in 535 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 429 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 453 ms. (88 steps per ms) remains 8/9 properties
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (24 resets) in 404 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (24 resets) in 406 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (26 resets) in 457 ms. (87 steps per ms) remains 8/8 properties
// Phase 1: matrix 120600 rows 1379 cols
[2024-06-01 14:58:25] [INFO ] Computed 11 invariants in 3501 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem StigmergyElection-PT-10b-ReachabilityCardinality-2023-14 is UNSAT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2023-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1223/1379 variables, 11/167 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 1223/1390 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/1390 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SMT process timed out in 9771ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 120600/120600 transitions.
Graph (trivial) has 1157 edges and 1379 vertex of which 149 / 1379 are part of one of the 22 SCC in 29 ms
Free SCC test removed 127 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Graph (complete) has 3490 edges and 1252 vertex of which 1240 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.450 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 664 rules applied. Total rules applied 666 place count 1240 transition count 119770
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 681 rules applied. Total rules applied 1347 place count 581 transition count 119748
Reduce places removed 10 places and 0 transitions.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 2 with 99 rules applied. Total rules applied 1446 place count 571 transition count 119659
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 1536 place count 482 transition count 119658
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1536 place count 482 transition count 119622
Deduced a syphon composed of 36 places in 158 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1608 place count 446 transition count 119622
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1666 place count 388 transition count 119564
Iterating global reduction 4 with 58 rules applied. Total rules applied 1724 place count 388 transition count 119564
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1726 place count 388 transition count 119562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1726 place count 388 transition count 119561
Deduced a syphon composed of 1 places in 104 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1728 place count 387 transition count 119561
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1741 place count 374 transition count 18289
Iterating global reduction 5 with 13 rules applied. Total rules applied 1754 place count 374 transition count 18289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1757 place count 374 transition count 18286
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 13 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 1841 place count 332 transition count 18244
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1844 place count 329 transition count 18241
Iterating global reduction 6 with 3 rules applied. Total rules applied 1847 place count 329 transition count 18241
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 9 places in 12 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1865 place count 320 transition count 18253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1868 place count 320 transition count 18250
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 1886 place count 320 transition count 18232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1888 place count 319 transition count 18238
Free-agglomeration rule applied 49 times.
Iterating global reduction 7 with 49 rules applied. Total rules applied 1937 place count 319 transition count 18189
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 1986 place count 270 transition count 18189
Drop transitions (Redundant composition of simpler transitions.) removed 3890 transitions
Redundant transition composition rules discarded 3890 transitions
Iterating global reduction 8 with 3890 rules applied. Total rules applied 5876 place count 270 transition count 14299
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 5879 place count 270 transition count 14299
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 5880 place count 270 transition count 14299
Applied a total of 5880 rules in 94477 ms. Remains 270 /1379 variables (removed 1109) and now considering 14299/120600 (removed 106301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94503 ms. Remains : 270/1379 places, 14299/120600 transitions.
RANDOM walk for 40000 steps (1132 resets) in 2615 ms. (15 steps per ms) remains 6/7 properties
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (104 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (109 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (69 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (105 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
// Phase 1: matrix 14299 rows 270 cols
[2024-06-01 15:00:07] [INFO ] Computed 9 invariants in 148 ms
[2024-06-01 15:00:22] [INFO ] State equation strengthened by 9674 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 122/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14296/14539 variables, 243/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14539 variables, 9159/9411 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14539/14569 variables, and 9411 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 243/270 constraints, ReadFeed: 9159/9674 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 122/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 35 places in 3641 ms of which 21 ms to minimize.
[2024-06-01 15:01:17] [INFO ] Deduced a trap composed of 34 places in 5171 ms of which 2 ms to minimize.
[2024-06-01 15:01:21] [INFO ] Deduced a trap composed of 42 places in 4124 ms of which 2 ms to minimize.
[2024-06-01 15:01:25] [INFO ] Deduced a trap composed of 38 places in 4588 ms of which 2 ms to minimize.
[2024-06-01 15:01:30] [INFO ] Deduced a trap composed of 35 places in 4251 ms of which 1 ms to minimize.
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 33 places in 3631 ms of which 1 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 41 places in 3231 ms of which 5 ms to minimize.
[2024-06-01 15:01:40] [INFO ] Deduced a trap composed of 35 places in 3463 ms of which 4 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 48 places in 4678 ms of which 5 ms to minimize.
[2024-06-01 15:01:49] [INFO ] Deduced a trap composed of 43 places in 4551 ms of which 2 ms to minimize.
[2024-06-01 15:01:54] [INFO ] Deduced a trap composed of 41 places in 4719 ms of which 2 ms to minimize.
SMT process timed out in 107481ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 14299/14299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 14298
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 269 transition count 14297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 268 transition count 14297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 268 transition count 14296
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 267 transition count 14296
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 267 transition count 14295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 266 transition count 14295
Applied a total of 8 rules in 28379 ms. Remains 266 /270 variables (removed 4) and now considering 14295/14299 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28379 ms. Remains : 266/270 places, 14295/14299 transitions.
RANDOM walk for 40000 steps (1135 resets) in 1237 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (106 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (109 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (110 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (70 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (109 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 99484 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 6
Probabilistic random walk after 99484 steps, saw 19111 distinct states, run finished after 3007 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 14295 rows 266 cols
[2024-06-01 15:02:26] [INFO ] Computed 9 invariants in 159 ms
[2024-06-01 15:02:42] [INFO ] State equation strengthened by 10250 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/239 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14292/14531 variables, 239/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14531 variables, 9735/9983 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14531 variables, 0/9983 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 30/14561 variables, 27/10010 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14561 variables, 515/10525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14561 variables, 0/10525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/14561 variables, 0/10525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14561/14561 variables, and 10525 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 266/266 constraints, ReadFeed: 10250/10250 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/239 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:03:59] [INFO ] Deduced a trap composed of 31 places in 4526 ms of which 1 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 43 places in 4461 ms of which 1 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 38 places in 3929 ms of which 1 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 33 places in 3828 ms of which 2 ms to minimize.
[2024-06-01 15:04:16] [INFO ] Deduced a trap composed of 29 places in 3953 ms of which 1 ms to minimize.
[2024-06-01 15:04:19] [INFO ] Deduced a trap composed of 29 places in 3662 ms of which 1 ms to minimize.
[2024-06-01 15:04:23] [INFO ] Deduced a trap composed of 38 places in 3565 ms of which 2 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 34 places in 4079 ms of which 1 ms to minimize.
[2024-06-01 15:04:31] [INFO ] Deduced a trap composed of 38 places in 4150 ms of which 1 ms to minimize.
[2024-06-01 15:04:35] [INFO ] Deduced a trap composed of 44 places in 3622 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 37 places in 3937 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 33 places in 3992 ms of which 10 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 36 places in 3258 ms of which 1 ms to minimize.
[2024-06-01 15:04:50] [INFO ] Deduced a trap composed of 45 places in 3591 ms of which 1 ms to minimize.
[2024-06-01 15:04:53] [INFO ] Deduced a trap composed of 32 places in 3598 ms of which 2 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 29 places in 3745 ms of which 1 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 33 places in 3672 ms of which 1 ms to minimize.
[2024-06-01 15:05:04] [INFO ] Deduced a trap composed of 34 places in 3775 ms of which 1 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 43 places in 3744 ms of which 1 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 37 places in 4426 ms of which 1 ms to minimize.
SMT process timed out in 166917ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 121 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 14295/14295 transitions.
Applied a total of 0 rules in 13357 ms. Remains 266 /266 variables (removed 0) and now considering 14295/14295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13357 ms. Remains : 266/266 places, 14295/14295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 14295/14295 transitions.
Applied a total of 0 rules in 13818 ms. Remains 266 /266 variables (removed 0) and now considering 14295/14295 (removed 0) transitions.
[2024-06-01 15:05:40] [INFO ] Invariant cache hit.
[2024-06-01 15:05:43] [INFO ] Implicit Places using invariants in 3286 ms returned []
Implicit Place search using SMT only with invariants took 3299 ms to find 0 implicit places.
Running 14279 sub problems to find dead transitions.
[2024-06-01 15:05:44] [INFO ] Invariant cache hit.
[2024-06-01 15:06:00] [INFO ] State equation strengthened by 10250 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/14561 variables, and 0 constraints, problems are : Problem set: 0 solved, 14279 unsolved in 30202 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/266 constraints, ReadFeed: 0/10250 constraints, PredecessorRefiner: 14279/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/14561 variables, and 0 constraints, problems are : Problem set: 0 solved, 14279 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/266 constraints, ReadFeed: 0/10250 constraints, PredecessorRefiner: 14049/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 305045ms problems are : Problem set: 0 solved, 14279 unsolved
Search for dead transitions found 0 dead transitions in 305203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322400 ms. Remains : 266/266 places, 14295/14295 transitions.
[2024-06-01 15:10:49] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2024-06-01 15:10:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 14295 transitions and 280552 arcs took 148 ms.
[2024-06-01 15:10:52] [INFO ] Flatten gal took : 2274 ms
Total runtime 760197 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyElection-PT-10b-ReachabilityCardinality-2024-05
Could not compute solution for formula : StigmergyElection-PT-10b-ReachabilityCardinality-2024-06
Could not compute solution for formula : StigmergyElection-PT-10b-ReachabilityCardinality-2023-07
Could not compute solution for formula : StigmergyElection-PT-10b-ReachabilityCardinality-2023-08
Could not compute solution for formula : StigmergyElection-PT-10b-ReachabilityCardinality-2023-11
Could not compute solution for formula : StigmergyElection-PT-10b-ReachabilityCardinality-2024-12

BK_STOP 1717254652578

--------------------
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
mcc2024
rfs formula name StigmergyElection-PT-10b-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/662/inv_0_
rfs formula name StigmergyElection-PT-10b-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/662/inv_1_
rfs formula name StigmergyElection-PT-10b-ReachabilityCardinality-2023-07
rfs formula type EF
rfs formula formula --invariant=/tmp/662/inv_2_
rfs formula name StigmergyElection-PT-10b-ReachabilityCardinality-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/662/inv_3_
rfs formula name StigmergyElection-PT-10b-ReachabilityCardinality-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/662/inv_4_
rfs formula name StigmergyElection-PT-10b-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/662/inv_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-10b"
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 StigmergyElection-PT-10b, 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-171690532200390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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