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-171690532100342.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-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532100342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.9K 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.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 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 3.4M 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717247792179

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-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:16:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:16:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:16:33] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-06-01 13:16:33] [INFO ] Transformed 971 places.
[2024-06-01 13:16:33] [INFO ] Transformed 5542 transitions.
[2024-06-01 13:16:33] [INFO ] Found NUPN structural information;
[2024-06-01 13:16:33] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (327 resets) in 1897 ms. (21 steps per ms) remains 11/14 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (45 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 337 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 326 ms. (122 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (58 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (48 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
// Phase 1: matrix 5542 rows 971 cols
[2024-06-01 13:16:35] [INFO ] Computed 8 invariants in 147 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 868/971 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 868/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3990 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 868/971 variables, 8/111 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 868/979 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 13:16:41] [INFO ] Deduced a trap composed of 189 places in 1793 ms of which 44 ms to minimize.
[2024-06-01 13:16:43] [INFO ] Deduced a trap composed of 190 places in 1706 ms of which 5 ms to minimize.
[2024-06-01 13:16:45] [INFO ] Deduced a trap composed of 191 places in 1660 ms of which 7 ms to minimize.
SMT process timed out in 9901ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 815 edges and 971 vertex of which 90 / 971 are part of one of the 15 SCC in 9 ms
Free SCC test removed 75 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 2004 edges and 896 vertex of which 886 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.33 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 886 transition count 4965
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 489 rules applied. Total rules applied 968 place count 413 transition count 4949
Reduce places removed 8 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 64 rules applied. Total rules applied 1032 place count 405 transition count 4893
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1088 place count 349 transition count 4893
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1088 place count 349 transition count 4870
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1134 place count 326 transition count 4870
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1169 place count 291 transition count 4835
Iterating global reduction 4 with 35 rules applied. Total rules applied 1204 place count 291 transition count 4835
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1211 place count 284 transition count 1541
Iterating global reduction 4 with 7 rules applied. Total rules applied 1218 place count 284 transition count 1541
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1221 place count 284 transition count 1538
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1263 place count 263 transition count 1517
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1264 place count 263 transition count 1516
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1290 place count 250 transition count 1518
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1297 place count 250 transition count 1511
Free-agglomeration rule applied 47 times.
Iterating global reduction 6 with 47 rules applied. Total rules applied 1344 place count 250 transition count 1464
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 1391 place count 203 transition count 1464
Drop transitions (Redundant composition of simpler transitions.) removed 218 transitions
Redundant transition composition rules discarded 218 transitions
Iterating global reduction 7 with 218 rules applied. Total rules applied 1609 place count 203 transition count 1246
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1610 place count 203 transition count 1246
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1611 place count 203 transition count 1246
Applied a total of 1611 rules in 1220 ms. Remains 203 /971 variables (removed 768) and now considering 1246/5542 (removed 4296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1235 ms. Remains : 203/971 places, 1246/5542 transitions.
RANDOM walk for 40000 steps (1535 resets) in 428 ms. (93 steps per ms) remains 9/10 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (248 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (311 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (257 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (255 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (269 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (249 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (269 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (253 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (253 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
// Phase 1: matrix 1246 rows 203 cols
[2024-06-01 13:16:46] [INFO ] Computed 6 invariants in 12 ms
[2024-06-01 13:16:47] [INFO ] State equation strengthened by 740 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 75/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1238/1411 variables, 173/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1411 variables, 641/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1411 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 37/1448 variables, 29/849 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1448 variables, 99/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1448 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1449 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1449 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1449 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1449/1449 variables, and 949 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 203/203 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 75/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 13:16:49] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 5 ms to minimize.
[2024-06-01 13:16:49] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 1 ms to minimize.
[2024-06-01 13:16:49] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 1 ms to minimize.
[2024-06-01 13:16:49] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2024-06-01 13:16:49] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:16:50] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2024-06-01 13:16:50] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2024-06-01 13:16:50] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2024-06-01 13:16:50] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 13:16:50] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 0 ms to minimize.
[2024-06-01 13:16:51] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2024-06-01 13:16:51] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 0 ms to minimize.
[2024-06-01 13:16:51] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 0 ms to minimize.
[2024-06-01 13:16:51] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2024-06-01 13:16:51] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 15/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 13:16:51] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2024-06-01 13:16:52] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 13:16:52] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 1 ms to minimize.
[2024-06-01 13:16:52] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1238/1411 variables, 173/198 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1411 variables, 641/839 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1411 variables, 1/840 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 0/840 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 37/1448 variables, 29/869 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1448 variables, 99/968 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1448 variables, 7/975 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 13:16:55] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1448 variables, 1/976 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1448 variables, 0/976 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/1449 variables, 1/977 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 13:16:56] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 1 ms to minimize.
[2024-06-01 13:16:56] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 1 ms to minimize.
[2024-06-01 13:16:57] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 1 ms to minimize.
[2024-06-01 13:16:57] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 13:16:57] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 1 ms to minimize.
[2024-06-01 13:16:58] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:16:58] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 1 ms to minimize.
[2024-06-01 13:16:58] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1449 variables, 8/985 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 13:16:59] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 1 ms to minimize.
[2024-06-01 13:16:59] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1449 variables, 2/987 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 13:17:00] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1449 variables, 1/988 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1449 variables, 0/988 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 13:17:02] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 4 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/1449 variables, 1/989 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1449 variables, 0/989 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 13:17:03] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/1449 variables, 1/990 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1449 variables, 0/990 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/1449 variables, 0/990 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1449/1449 variables, and 990 constraints, problems are : Problem set: 2 solved, 7 unsolved in 16734 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 203/203 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 33/33 constraints]
After SMT, in 18723ms problems are : Problem set: 2 solved, 7 unsolved
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2106 ms.
Support contains 35 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 1246/1246 transitions.
Graph (trivial) has 121 edges and 203 vertex of which 12 / 203 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 745 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 194 transition count 1191
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 154 transition count 1187
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 93 place count 153 transition count 1182
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 98 place count 148 transition count 1182
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 98 place count 148 transition count 1174
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 114 place count 140 transition count 1174
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 120 place count 134 transition count 1168
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 134 transition count 1168
Performed 10 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 146 place count 124 transition count 1155
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 4 with 148 rules applied. Total rules applied 294 place count 124 transition count 1007
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 296 place count 122 transition count 1004
Iterating global reduction 5 with 2 rules applied. Total rules applied 298 place count 122 transition count 1004
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 121 transition count 1003
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 302 place count 121 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 303 place count 120 transition count 999
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 120 transition count 999
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 310 place count 117 transition count 1005
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 418 place count 117 transition count 897
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 420 place count 116 transition count 903
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 428 place count 116 transition count 895
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 448 place count 116 transition count 875
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 36 rules applied. Total rules applied 484 place count 96 transition count 859
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 488 place count 92 transition count 855
Iterating global reduction 7 with 4 rules applied. Total rules applied 492 place count 92 transition count 855
Drop transitions (Redundant composition of simpler transitions.) removed 237 transitions
Redundant transition composition rules discarded 237 transitions
Iterating global reduction 7 with 237 rules applied. Total rules applied 729 place count 92 transition count 618
Applied a total of 729 rules in 383 ms. Remains 92 /203 variables (removed 111) and now considering 618/1246 (removed 628) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 92/203 places, 618/1246 transitions.
RANDOM walk for 40000 steps (1871 resets) in 1945 ms. (20 steps per ms) remains 2/4 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (335 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
// Phase 1: matrix 618 rows 92 cols
[2024-06-01 13:17:08] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 13:17:08] [INFO ] State equation strengthened by 526 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 594/666 variables, 72/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 194/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/708 variables, 18/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 332/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/708 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/710 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/710 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/710 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 624 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 526/526 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:17:09] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:17:09] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:17:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:17:09] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 594/666 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 194/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 42/708 variables, 18/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/708 variables, 332/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/708 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:17:09] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/708 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/710 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/710 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/710 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 710/710 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 526/526 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1595ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 71 ms.
Support contains 22 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 618/618 transitions.
Graph (trivial) has 31 edges and 92 vertex of which 2 / 92 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 91 transition count 607
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 82 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 606
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 81 transition count 604
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 79 transition count 604
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 78 transition count 603
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 78 transition count 603
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 39 place count 72 transition count 597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 69 transition count 594
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 69 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 69 transition count 593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 68 transition count 599
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 59 place count 68 transition count 588
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 68 transition count 585
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 68 place count 65 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 98 place count 65 transition count 552
Applied a total of 98 rules in 157 ms. Remains 65 /92 variables (removed 27) and now considering 552/618 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 65/92 places, 552/618 transitions.
RANDOM walk for 40000 steps (2100 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (279 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Probably explored full state space saw : 52717 states, properties seen :0
Probabilistic random walk after 354998 steps, saw 52717 distinct states, run finished after 615 ms. (steps per millisecond=577 ) properties seen :0
Explored full state space saw : 52717 states, properties seen :0
Exhaustive walk after 354998 steps, saw 52717 distinct states, run finished after 475 ms. (steps per millisecond=747 ) properties seen :0
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 38433 ms.
ITS solved all properties within timeout

BK_STOP 1717247831819

--------------------
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-07b"
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-07b, 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-171690532100342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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