Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K 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 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:09 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 17M 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-09a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717014726055

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 20:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:32:08] [INFO ] Load time of PNML (sax parser for PT used): 868 ms
[2024-05-29 20:32:08] [INFO ] Transformed 128 places.
[2024-05-29 20:32:08] [INFO ] Transformed 18490 transitions.
[2024-05-29 20:32:08] [INFO ] Found NUPN structural information;
[2024-05-29 20:32:08] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1104 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (15 resets) in 4215 ms. (9 steps per ms) remains 6/14 properties
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 510 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 668 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
[2024-05-29 20:32:10] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2024-05-29 20:32:10] [INFO ] Computed 10 invariants in 28 ms
[2024-05-29 20:32:10] [INFO ] State equation strengthened by 1066 read => feed constraints.
Problem StigmergyElection-PT-09a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 72/128 variables, 10/66 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 72/138 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1167/1295 variables, 128/266 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 1065/1331 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1295 variables, 0/1331 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1296 variables, 1/1332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 0/1332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1296 variables, 0/1332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1296/1296 variables, and 1332 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1949 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 128/128 constraints, ReadFeed: 1066/1066 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem StigmergyElection-PT-09a-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 91/128 variables, 10/47 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 91/138 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-29 20:32:13] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 21 ms to minimize.
[2024-05-29 20:32:13] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 2 ms to minimize.
[2024-05-29 20:32:13] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 1 ms to minimize.
[2024-05-29 20:32:14] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 2 ms to minimize.
[2024-05-29 20:32:14] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 2 ms to minimize.
[2024-05-29 20:32:14] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:32:14] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-05-29 20:32:14] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 2 ms to minimize.
[2024-05-29 20:32:15] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:32:15] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 20:32:15] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:32:15] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:32:15] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:32:16] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:32:16] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:32:16] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2024-05-29 20:32:16] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 2 ms to minimize.
[2024-05-29 20:32:16] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:32:17] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:32:17] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/158 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-29 20:32:17] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
SMT process timed out in 7364ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Graph (complete) has 424 edges and 128 vertex of which 120 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.16 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 120 transition count 1154
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 52 place count 112 transition count 1144
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 110 transition count 1140
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 66 place count 106 transition count 1136
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 66 place count 106 transition count 1127
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 84 place count 97 transition count 1127
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 90 place count 91 transition count 1121
Iterating global reduction 4 with 6 rules applied. Total rules applied 96 place count 91 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 100 place count 87 transition count 1117
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 87 transition count 1117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 87 transition count 1115
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 122 place count 79 transition count 1107
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 127 place count 74 transition count 1102
Iterating global reduction 5 with 5 rules applied. Total rules applied 132 place count 74 transition count 1102
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 140 place count 74 transition count 1094
Applied a total of 140 rules in 611 ms. Remains 74 /128 variables (removed 54) and now considering 1094/1195 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 74/128 places, 1094/1195 transitions.
RANDOM walk for 40000 steps (11 resets) in 3107 ms. (12 steps per ms) remains 3/4 properties
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
// Phase 1: matrix 1094 rows 74 cols
[2024-05-29 20:32:19] [INFO ] Computed 7 invariants in 14 ms
[2024-05-29 20:32:19] [INFO ] State equation strengthened by 1052 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1150 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1150 variables, 149/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1150 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/1168 variables, 11/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1168 variables, 903/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1168 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1168 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 1133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 1052/1052 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:32:20] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:32:20] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:32:20] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2024-05-29 20:32:20] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1087/1150 variables, 63/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1150 variables, 149/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:32:21] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:32:22] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:32:22] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1150 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1150 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/1168 variables, 11/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1168 variables, 903/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1168 variables, 3/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:32:23] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:32:23] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:32:23] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-09a-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 20:32:23] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:32:23] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:32:24] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-09a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 20:32:24] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:32:24] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-09a-ReachabilityCardinality-2024-14 is UNSAT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 1168/1168 variables, and 1157 constraints, problems are : Problem set: 3 solved, 0 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 1052/1052 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 21/21 constraints]
After SMT, in 5280ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 17225 ms.
ITS solved all properties within timeout

BK_STOP 1717014744490

--------------------
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="StigmergyElection-PT-09a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-09a, 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 r399-tall-171690530200366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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