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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 18:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 11 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717250746346

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-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:05:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:05:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:05:49] [INFO ] Load time of PNML (sax parser for PT used): 1657 ms
[2024-06-01 14:05:49] [INFO ] Transformed 1243 places.
[2024-06-01 14:05:49] [INFO ] Transformed 41210 transitions.
[2024-06-01 14:05:49] [INFO ] Found NUPN structural information;
[2024-06-01 14:05:49] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 2020 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (256 resets) in 3164 ms. (12 steps per ms) remains 8/13 properties
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 254 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 407 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 433 ms. (92 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 298 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (29 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (29 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
// Phase 1: matrix 41210 rows 1243 cols
[2024-06-01 14:05:52] [INFO ] Computed 10 invariants in 723 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1148/1243 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1243 variables, 1148/1253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 6329ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Graph (trivial) has 1094 edges and 1243 vertex of which 113 / 1243 are part of one of the 18 SCC in 12 ms
Free SCC test removed 95 places
Drop transitions (Empty/Sink Transition effects.) removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 2969 edges and 1148 vertex of which 1134 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.130 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 671 rules applied. Total rules applied 673 place count 1134 transition count 40411
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 692 rules applied. Total rules applied 1365 place count 470 transition count 40383
Reduce places removed 14 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 2 with 67 rules applied. Total rules applied 1432 place count 456 transition count 40330
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 1486 place count 403 transition count 40329
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 1486 place count 403 transition count 40302
Deduced a syphon composed of 27 places in 26 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1540 place count 376 transition count 40302
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1588 place count 328 transition count 40254
Iterating global reduction 4 with 48 rules applied. Total rules applied 1636 place count 328 transition count 40254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1639 place count 328 transition count 40251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1640 place count 327 transition count 40251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1640 place count 327 transition count 40250
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1642 place count 326 transition count 40250
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1651 place count 317 transition count 11358
Iterating global reduction 6 with 9 rules applied. Total rules applied 1660 place count 317 transition count 11358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1662 place count 317 transition count 11356
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 1734 place count 281 transition count 11320
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1738 place count 277 transition count 11316
Iterating global reduction 7 with 4 rules applied. Total rules applied 1742 place count 277 transition count 11316
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 1772 place count 262 transition count 11328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1773 place count 262 transition count 11327
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1774 place count 262 transition count 11326
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 1829 place count 262 transition count 11271
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 1884 place count 207 transition count 11271
Drop transitions (Redundant composition of simpler transitions.) removed 2919 transitions
Redundant transition composition rules discarded 2919 transitions
Iterating global reduction 9 with 2919 rules applied. Total rules applied 4803 place count 207 transition count 8352
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4807 place count 207 transition count 8352
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4808 place count 207 transition count 8352
Applied a total of 4808 rules in 32803 ms. Remains 207 /1243 variables (removed 1036) and now considering 8352/41210 (removed 32858) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32817 ms. Remains : 207/1243 places, 8352/41210 transitions.
RANDOM walk for 40000 steps (1186 resets) in 2603 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (126 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (130 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (133 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (124 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (132 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (131 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (126 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (133 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 121088 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 8
Probabilistic random walk after 121088 steps, saw 24196 distinct states, run finished after 3008 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 8352 rows 207 cols
[2024-06-01 14:06:35] [INFO ] Computed 10 invariants in 59 ms
[2024-06-01 14:06:40] [INFO ] State equation strengthened by 7104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 112/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8352/8559 variables, 207/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8559 variables, 7104/7321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8559 variables, 0/7321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/8559 variables, 0/7321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8559/8559 variables, and 7321 constraints, problems are : Problem set: 0 solved, 8 unsolved in 24183 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, ReadFeed: 7104/7104 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 112/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 14:07:07] [INFO ] Deduced a trap composed of 36 places in 2754 ms of which 30 ms to minimize.
[2024-06-01 14:07:10] [INFO ] Deduced a trap composed of 28 places in 2515 ms of which 1 ms to minimize.
[2024-06-01 14:07:12] [INFO ] Deduced a trap composed of 31 places in 2201 ms of which 1 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 31 places in 2313 ms of which 1 ms to minimize.
[2024-06-01 14:07:16] [INFO ] Deduced a trap composed of 22 places in 1723 ms of which 2 ms to minimize.
[2024-06-01 14:07:18] [INFO ] Deduced a trap composed of 28 places in 2365 ms of which 1 ms to minimize.
[2024-06-01 14:07:20] [INFO ] Deduced a trap composed of 16 places in 2027 ms of which 1 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 27 places in 2090 ms of which 2 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 35 places in 1710 ms of which 1 ms to minimize.
[2024-06-01 14:07:26] [INFO ] Deduced a trap composed of 22 places in 2030 ms of which 5 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 23 places in 1723 ms of which 1 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 22 places in 1779 ms of which 16 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 22 places in 1721 ms of which 1 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 23 places in 1870 ms of which 2 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 18 places in 1540 ms of which 2 ms to minimize.
[2024-06-01 14:07:37] [INFO ] Deduced a trap composed of 27 places in 2452 ms of which 2 ms to minimize.
[2024-06-01 14:07:40] [INFO ] Deduced a trap composed of 22 places in 2746 ms of which 2 ms to minimize.
[2024-06-01 14:07:43] [INFO ] Deduced a trap composed of 27 places in 2358 ms of which 1 ms to minimize.
[2024-06-01 14:07:44] [INFO ] Deduced a trap composed of 34 places in 1861 ms of which 1 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 34 places in 2437 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 32 places in 1747 ms of which 1 ms to minimize.
[2024-06-01 14:07:50] [INFO ] Deduced a trap composed of 29 places in 1593 ms of which 1 ms to minimize.
SMT process timed out in 75481ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 95 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 8352/8352 transitions.
Applied a total of 0 rules in 5566 ms. Remains 207 /207 variables (removed 0) and now considering 8352/8352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5566 ms. Remains : 207/207 places, 8352/8352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 8352/8352 transitions.
Applied a total of 0 rules in 5503 ms. Remains 207 /207 variables (removed 0) and now considering 8352/8352 (removed 0) transitions.
[2024-06-01 14:08:01] [INFO ] Invariant cache hit.
[2024-06-01 14:08:02] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-06-01 14:08:02] [INFO ] Invariant cache hit.
[2024-06-01 14:08:06] [INFO ] State equation strengthened by 7104 read => feed constraints.
[2024-06-01 14:08:24] [INFO ] Implicit Places using invariants and state equation in 21854 ms returned []
Implicit Place search using SMT with State Equation took 22662 ms to find 0 implicit places.
[2024-06-01 14:08:25] [INFO ] Redundant transitions in 1403 ms returned []
Running 8336 sub problems to find dead transitions.
[2024-06-01 14:08:26] [INFO ] Invariant cache hit.
[2024-06-01 14:08:31] [INFO ] State equation strengthened by 7104 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/8559 variables, and 0 constraints, problems are : Problem set: 0 solved, 8336 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/207 constraints, ReadFeed: 0/7104 constraints, PredecessorRefiner: 8336/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/8559 variables, and 0 constraints, problems are : Problem set: 0 solved, 8336 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/207 constraints, ReadFeed: 0/7104 constraints, PredecessorRefiner: 8125/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 186266ms problems are : Problem set: 0 solved, 8336 unsolved
Search for dead transitions found 0 dead transitions in 186380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215992 ms. Remains : 207/207 places, 8352/8352 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 2469 ms. Remains 207 /207 variables (removed 0) and now considering 8352/8352 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-06-01 14:11:34] [INFO ] Invariant cache hit.
[2024-06-01 14:11:35] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 14:11:35] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-01 14:11:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 14:11:37] [INFO ] After 2174ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :8
[2024-06-01 14:11:37] [INFO ] After 2268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 4974 ms.
[2024-06-01 14:11:37] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 14:11:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 207 places, 8352 transitions and 146134 arcs took 85 ms.
[2024-06-01 14:11:39] [INFO ] Flatten gal took : 1317 ms
Total runtime 351580 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-09b-ReachabilityCardinality-2024-00
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-04
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-06
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-07
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-08
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-09
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-10
Could not compute solution for formula : StigmergyElection-PT-09b-ReachabilityCardinality-2024-14

BK_STOP 1717251099377

--------------------
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-09b-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/620/inv_0_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/620/inv_1_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/620/inv_2_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/620/inv_3_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/620/inv_4_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/620/inv_5_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/620/inv_6_
rfs formula name StigmergyElection-PT-09b-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/620/inv_7_
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-09b"
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-09b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532200374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09b.tgz
mv StigmergyElection-PT-09b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;