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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 18:44 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 1.2M 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-06b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717011754094

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-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:42:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:42:35] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-29 19:42:35] [INFO ] Transformed 835 places.
[2024-05-29 19:42:35] [INFO ] Transformed 2416 transitions.
[2024-05-29 19:42:35] [INFO ] Found NUPN structural information;
[2024-05-29 19:42:35] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (378 resets) in 2474 ms. (16 steps per ms) remains 10/15 properties
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (59 resets) in 226 ms. (176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 322 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (57 resets) in 931 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 402 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (59 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
// Phase 1: matrix 2416 rows 835 cols
[2024-05-29 19:42:37] [INFO ] Computed 7 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem StigmergyElection-PT-06b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 709/835 variables, 7/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 709/842 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/842 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2416/3251 variables, 835/1677 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3251 variables, 0/1677 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/3251 variables, 0/1677 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3251/3251 variables, and 1677 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2223 ms.
Refiners :[Domain max(s): 835/835 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 835/835 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem StigmergyElection-PT-06b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-06b-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 738/835 variables, 7/104 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 738/842 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-29 19:42:40] [INFO ] Deduced a trap composed of 193 places in 681 ms of which 31 ms to minimize.
[2024-05-29 19:42:41] [INFO ] Deduced a trap composed of 189 places in 576 ms of which 4 ms to minimize.
[2024-05-29 19:42:41] [INFO ] Deduced a trap composed of 189 places in 521 ms of which 3 ms to minimize.
[2024-05-29 19:42:42] [INFO ] Deduced a trap composed of 194 places in 566 ms of which 4 ms to minimize.
[2024-05-29 19:42:43] [INFO ] Deduced a trap composed of 193 places in 640 ms of which 4 ms to minimize.
[2024-05-29 19:42:43] [INFO ] Deduced a trap composed of 190 places in 586 ms of which 3 ms to minimize.
[2024-05-29 19:42:44] [INFO ] Deduced a trap composed of 193 places in 601 ms of which 4 ms to minimize.
[2024-05-29 19:42:45] [INFO ] Deduced a trap composed of 189 places in 580 ms of which 7 ms to minimize.
SMT process timed out in 7770ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Graph (trivial) has 755 edges and 835 vertex of which 81 / 835 are part of one of the 13 SCC in 4 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 1584 edges and 767 vertex of which 758 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.20 ms
Discarding 9 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 457 transitions
Trivial Post-agglo rules discarded 457 transitions
Performed 457 trivial Post agglomeration. Transition count delta: 457
Iterating post reduction 0 with 461 rules applied. Total rules applied 463 place count 758 transition count 1864
Reduce places removed 457 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 472 rules applied. Total rules applied 935 place count 301 transition count 1849
Reduce places removed 7 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 37 rules applied. Total rules applied 972 place count 294 transition count 1819
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 1003 place count 264 transition count 1818
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1003 place count 264 transition count 1800
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1039 place count 246 transition count 1800
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1079 place count 206 transition count 1760
Iterating global reduction 4 with 40 rules applied. Total rules applied 1119 place count 206 transition count 1760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1120 place count 206 transition count 1759
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1120 place count 206 transition count 1757
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1124 place count 204 transition count 1757
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1135 place count 193 transition count 495
Iterating global reduction 5 with 11 rules applied. Total rules applied 1146 place count 193 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1150 place count 193 transition count 491
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1208 place count 164 transition count 462
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1209 place count 164 transition count 461
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 162 transition count 459
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 162 transition count 459
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1229 place count 154 transition count 471
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1231 place count 154 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1243 place count 154 transition count 457
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1275 place count 154 transition count 425
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 1307 place count 122 transition count 425
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1309 place count 120 transition count 423
Iterating global reduction 9 with 2 rules applied. Total rules applied 1311 place count 120 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 9 with 50 rules applied. Total rules applied 1361 place count 120 transition count 373
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1363 place count 120 transition count 373
Applied a total of 1363 rules in 399 ms. Remains 120 /835 variables (removed 715) and now considering 373/2416 (removed 2043) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 120/835 places, 373/2416 transitions.
RANDOM walk for 40000 steps (1246 resets) in 1225 ms. (32 steps per ms) remains 3/7 properties
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (238 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (255 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (240 resets) in 34 ms. (1142 steps per ms) remains 2/3 properties
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 373 rows 120 cols
[2024-05-29 19:42:45] [INFO ] Computed 6 invariants in 2 ms
[2024-05-29 19:42:45] [INFO ] State equation strengthened by 202 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 358/459 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 165/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/488 variables, 15/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 37/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/493 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/493 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 202/202 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:42:46] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 358/459 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 165/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 29/488 variables, 15/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 37/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/493 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/493 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 34 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 373/373 transitions.
Graph (trivial) has 35 edges and 120 vertex of which 4 / 120 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 397 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 117 transition count 359
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 109 transition count 355
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 105 transition count 353
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 104 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 31 place count 104 transition count 351
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 33 place count 103 transition count 351
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 102 transition count 350
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 102 transition count 350
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 45 place count 97 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 97 transition count 343
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 49 place count 95 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 95 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 53 place count 94 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 57 place count 94 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 58 place count 94 transition count 336
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 60 place count 94 transition count 334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 62 place count 92 transition count 334
Applied a total of 62 rules in 62 ms. Remains 92 /120 variables (removed 28) and now considering 334/373 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 92/120 places, 334/373 transitions.
RANDOM walk for 40000 steps (1123 resets) in 181 ms. (219 steps per ms) remains 1/2 properties
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (267 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
// Phase 1: matrix 334 rows 92 cols
[2024-05-29 19:42:46] [INFO ] Computed 7 invariants in 2 ms
[2024-05-29 19:42:46] [INFO ] State equation strengthened by 231 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/92 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:42:46] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:42:47] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:42:47] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:42:47] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:42:47] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:42:47] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:42:47] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 334/426 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 231/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/92 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 334/426 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 231/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 788ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 12435 ms.
ITS solved all properties within timeout

BK_STOP 1717011767719

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

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