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-171690529900238.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 StigmergyCommit-PT-11a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529900238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 464M 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 StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-06
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-08
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-11
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717005547467

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:59:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 17:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:59:24] [INFO ] Load time of PNML (sax parser for PT used): 15314 ms
[2024-05-29 17:59:24] [INFO ] Transformed 436 places.
[2024-05-29 17:59:26] [INFO ] Transformed 373236 transitions.
[2024-05-29 17:59:26] [INFO ] Found NUPN structural information;
[2024-05-29 17:59:26] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 17580 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 38901 ms. (1 steps per ms) remains 8/12 properties
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1015 ms. (39 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/7 properties
[2024-05-29 17:59:40] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
// Phase 1: matrix 8722 rows 436 cols
[2024-05-29 17:59:40] [INFO ] Computed 13 invariants in 97 ms
[2024-05-29 17:59:41] [INFO ] State equation strengthened by 8357 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 311/436 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 311/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8721/9157 variables, 436/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9157 variables, 8356/9241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9157 variables, 0/9241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/9158 variables, 1/9242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9158/9158 variables, and 9242 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5066 ms.
Refiners :[Domain max(s): 436/436 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 436/436 constraints, ReadFeed: 8357/8357 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 311/436 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 311/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 17:59:50] [INFO ] Deduced a trap composed of 17 places in 3327 ms of which 35 ms to minimize.
[2024-05-29 17:59:53] [INFO ] Deduced a trap composed of 17 places in 3203 ms of which 4 ms to minimize.
SMT process timed out in 13488ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 426 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.60 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 426 transition count 8694
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 39 rules applied. Total rules applied 94 place count 403 transition count 8678
Reduce places removed 2 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 22 rules applied. Total rules applied 116 place count 401 transition count 8658
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 144 place count 381 transition count 8650
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 144 place count 381 transition count 8601
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 242 place count 332 transition count 8601
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 283 place count 291 transition count 8560
Iterating global reduction 4 with 41 rules applied. Total rules applied 324 place count 291 transition count 8560
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 326 place count 291 transition count 8558
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 345 place count 272 transition count 8537
Iterating global reduction 5 with 19 rules applied. Total rules applied 364 place count 272 transition count 8537
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 272 transition count 8535
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 369 place count 269 transition count 8532
Iterating global reduction 6 with 3 rules applied. Total rules applied 372 place count 269 transition count 8532
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 374 place count 269 transition count 8530
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 392 place count 260 transition count 8521
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 399 place count 253 transition count 8514
Iterating global reduction 7 with 7 rules applied. Total rules applied 406 place count 253 transition count 8514
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 408 place count 251 transition count 8512
Iterating global reduction 7 with 2 rules applied. Total rules applied 410 place count 251 transition count 8512
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 429 place count 251 transition count 8493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 430 place count 251 transition count 8492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 431 place count 250 transition count 8492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 435 place count 248 transition count 8490
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 436 place count 247 transition count 8489
Iterating global reduction 9 with 1 rules applied. Total rules applied 437 place count 247 transition count 8489
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 450 place count 247 transition count 8476
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 463 place count 234 transition count 8476
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 466 place count 234 transition count 8476
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 469 place count 234 transition count 8473
Applied a total of 469 rules in 43680 ms. Remains 234 /436 variables (removed 202) and now considering 8473/8758 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43697 ms. Remains : 234/436 places, 8473/8758 transitions.
RANDOM walk for 40000 steps (9 resets) in 48441 ms. (0 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1939144 steps, run timeout after 36001 ms. (steps per millisecond=53 ) properties seen :4 out of 7
Probabilistic random walk after 1939144 steps, saw 263054 distinct states, run finished after 36005 ms. (steps per millisecond=53 ) properties seen :4
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 8473 rows 234 cols
[2024-05-29 18:01:26] [INFO ] Computed 7 invariants in 46 ms
[2024-05-29 18:01:27] [INFO ] State equation strengthened by 8320 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 87/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/143 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8257/8400 variables, 143/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8400 variables, 204/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8400 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 238/8638 variables, 48/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8638 variables, 8104/8506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8638 variables, 0/8506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 54/8692 variables, 32/8538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8692 variables, 8/8546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8692 variables, 0/8546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/8706 variables, 10/8556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8706 variables, 4/8560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8706 variables, 0/8560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/8707 variables, 1/8561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/8707 variables, 0/8561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/8707 variables, 0/8561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8707/8707 variables, and 8561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5956 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 234/234 constraints, ReadFeed: 8320/8320 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 87/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:01:34] [INFO ] Deduced a trap composed of 11 places in 1281 ms of which 2 ms to minimize.
[2024-05-29 18:01:35] [INFO ] Deduced a trap composed of 11 places in 1206 ms of which 1 ms to minimize.
[2024-05-29 18:01:37] [INFO ] Deduced a trap composed of 10 places in 1328 ms of which 1 ms to minimize.
[2024-05-29 18:01:38] [INFO ] Deduced a trap composed of 12 places in 1056 ms of which 5 ms to minimize.
[2024-05-29 18:01:39] [INFO ] Deduced a trap composed of 10 places in 1052 ms of which 1 ms to minimize.
[2024-05-29 18:01:40] [INFO ] Deduced a trap composed of 12 places in 873 ms of which 2 ms to minimize.
[2024-05-29 18:01:40] [INFO ] Deduced a trap composed of 11 places in 654 ms of which 1 ms to minimize.
[2024-05-29 18:01:41] [INFO ] Deduced a trap composed of 11 places in 970 ms of which 1 ms to minimize.
[2024-05-29 18:01:42] [INFO ] Deduced a trap composed of 12 places in 649 ms of which 1 ms to minimize.
[2024-05-29 18:01:42] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 1 ms to minimize.
[2024-05-29 18:01:43] [INFO ] Deduced a trap composed of 12 places in 766 ms of which 1 ms to minimize.
[2024-05-29 18:01:44] [INFO ] Deduced a trap composed of 10 places in 568 ms of which 1 ms to minimize.
[2024-05-29 18:01:44] [INFO ] Deduced a trap composed of 8 places in 633 ms of which 1 ms to minimize.
[2024-05-29 18:01:45] [INFO ] Deduced a trap composed of 13 places in 576 ms of which 1 ms to minimize.
[2024-05-29 18:01:45] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 1 ms to minimize.
[2024-05-29 18:01:46] [INFO ] Deduced a trap composed of 12 places in 644 ms of which 1 ms to minimize.
[2024-05-29 18:01:46] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 0 ms to minimize.
[2024-05-29 18:01:47] [INFO ] Deduced a trap composed of 10 places in 897 ms of which 1 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 8 places in 644 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 11 places in 655 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8257/8400 variables, 143/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8400 variables, 204/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 10 places in 657 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 0 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 11 places in 432 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/8400 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8400 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 238/8638 variables, 48/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8638 variables, 8104/8531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8638 variables, 1/8532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:01:59] [INFO ] Deduced a trap composed of 12 places in 1475 ms of which 1 ms to minimize.
[2024-05-29 18:02:01] [INFO ] Deduced a trap composed of 12 places in 1479 ms of which 0 ms to minimize.
[2024-05-29 18:02:02] [INFO ] Deduced a trap composed of 12 places in 1034 ms of which 1 ms to minimize.
[2024-05-29 18:02:03] [INFO ] Deduced a trap composed of 12 places in 744 ms of which 1 ms to minimize.
[2024-05-29 18:02:04] [INFO ] Deduced a trap composed of 11 places in 553 ms of which 0 ms to minimize.
[2024-05-29 18:02:04] [INFO ] Deduced a trap composed of 12 places in 559 ms of which 0 ms to minimize.
[2024-05-29 18:02:05] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/8638 variables, 7/8539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8638 variables, 0/8539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 54/8692 variables, 32/8571 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/8692 variables, 8/8579 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 11 places in 575 ms of which 4 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 10 places in 394 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 18 (INCLUDED_ONLY) 0/8692 variables, 2/8581 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 10 places in 771 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/8692 variables, 1/8582 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/8692 variables, 0/8582 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/8706 variables, 10/8592 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/8706 variables, 4/8596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-29 18:02:15] [INFO ] Deduced a trap composed of 8 places in 1188 ms of which 1 ms to minimize.
[2024-05-29 18:02:16] [INFO ] Deduced a trap composed of 8 places in 948 ms of which 1 ms to minimize.
[2024-05-29 18:02:17] [INFO ] Deduced a trap composed of 7 places in 768 ms of which 1 ms to minimize.
[2024-05-29 18:02:17] [INFO ] Deduced a trap composed of 9 places in 761 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 8706/8707 variables, and 8600 constraints, problems are : Problem set: 3 solved, 0 unsolved in 44773 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 233/234 constraints, ReadFeed: 8320/8320 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 51923ms 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 189198 ms.
ITS solved all properties within timeout

BK_STOP 1717005738070

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="StigmergyCommit-PT-11a"
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 StigmergyCommit-PT-11a, 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-171690529900238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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