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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 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:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 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 51M 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-09a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716996045411

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-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 15:20:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 15:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:20:48] [INFO ] Load time of PNML (sax parser for PT used): 2062 ms
[2024-05-29 15:20:48] [INFO ] Transformed 364 places.
[2024-05-29 15:20:49] [INFO ] Transformed 50444 transitions.
[2024-05-29 15:20:49] [INFO ] Found NUPN structural information;
[2024-05-29 15:20:49] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2482 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 5549 ms. (7 steps per ms) remains 9/12 properties
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1331 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
[2024-05-29 15:20:51] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2024-05-29 15:20:51] [INFO ] Computed 11 invariants in 38 ms
[2024-05-29 15:20:51] [INFO ] State equation strengthened by 2185 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 262/363 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 262/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/364 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2489/2853 variables, 364/739 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2853 variables, 2184/2923 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2853 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/2854 variables, 1/2924 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2854 variables, 0/2924 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/2854 variables, 0/2924 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2854/2854 variables, and 2924 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2732 ms.
Refiners :[Domain max(s): 364/364 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 364/364 constraints, ReadFeed: 2185/2185 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 262/363 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 262/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 15:20:55] [INFO ] Deduced a trap composed of 17 places in 846 ms of which 34 ms to minimize.
[2024-05-29 15:20:56] [INFO ] Deduced a trap composed of 17 places in 782 ms of which 3 ms to minimize.
[2024-05-29 15:20:57] [INFO ] Deduced a trap composed of 17 places in 722 ms of which 4 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 16 places in 682 ms of which 3 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 16 places in 631 ms of which 2 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 17 places in 648 ms of which 2 ms to minimize.
[2024-05-29 15:21:00] [INFO ] Deduced a trap composed of 17 places in 620 ms of which 3 ms to minimize.
SMT process timed out in 8492ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 360 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.30 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 360 transition count 2464
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 86 place count 338 transition count 2453
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 97 place count 335 transition count 2445
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 110 place count 327 transition count 2440
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 110 place count 327 transition count 2400
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 190 place count 287 transition count 2400
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 229 place count 248 transition count 2361
Iterating global reduction 4 with 39 rules applied. Total rules applied 268 place count 248 transition count 2361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 272 place count 248 transition count 2357
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 293 place count 227 transition count 2334
Iterating global reduction 5 with 21 rules applied. Total rules applied 314 place count 227 transition count 2334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 317 place count 227 transition count 2331
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 331 place count 220 transition count 2324
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 333 place count 218 transition count 2322
Iterating global reduction 6 with 2 rules applied. Total rules applied 335 place count 218 transition count 2322
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 353 place count 218 transition count 2304
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 359 place count 215 transition count 2301
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 361 place count 213 transition count 2299
Iterating global reduction 6 with 2 rules applied. Total rules applied 363 place count 213 transition count 2299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 365 place count 213 transition count 2297
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 379 place count 213 transition count 2283
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 393 place count 199 transition count 2283
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 401 place count 199 transition count 2283
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 407 place count 199 transition count 2277
Applied a total of 407 rules in 3816 ms. Remains 199 /364 variables (removed 165) and now considering 2277/2520 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3829 ms. Remains : 199/364 places, 2277/2520 transitions.
RANDOM walk for 40000 steps (9 resets) in 5461 ms. (7 steps per ms) remains 7/9 properties
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
// Phase 1: matrix 2277 rows 199 cols
[2024-05-29 15:21:05] [INFO ] Computed 10 invariants in 17 ms
[2024-05-29 15:21:05] [INFO ] State equation strengthened by 2158 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 85/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/186 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2270/2456 variables, 186/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2456 variables, 1125/1321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2456 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 19/2475 variables, 12/1333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2475 variables, 1033/2366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2475 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/2476 variables, 1/2367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2476 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2476 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 2367 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 2158/2158 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 85/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 15:21:08] [INFO ] Deduced a trap composed of 11 places in 577 ms of which 1 ms to minimize.
[2024-05-29 15:21:08] [INFO ] Deduced a trap composed of 11 places in 579 ms of which 1 ms to minimize.
[2024-05-29 15:21:09] [INFO ] Deduced a trap composed of 13 places in 444 ms of which 1 ms to minimize.
[2024-05-29 15:21:09] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 1 ms to minimize.
[2024-05-29 15:21:10] [INFO ] Deduced a trap composed of 13 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:21:10] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 1 ms to minimize.
[2024-05-29 15:21:11] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 1 ms to minimize.
[2024-05-29 15:21:11] [INFO ] Deduced a trap composed of 13 places in 384 ms of which 1 ms to minimize.
[2024-05-29 15:21:11] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 1 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 1 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 1 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 1 ms to minimize.
[2024-05-29 15:21:14] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 1 ms to minimize.
[2024-05-29 15:21:14] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 1 ms to minimize.
[2024-05-29 15:21:14] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:21:14] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 1 ms to minimize.
[2024-05-29 15:21:15] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:21:15] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-05 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/29 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-29 15:21:15] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2024-05-29 15:21:15] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 4 ms to minimize.
[2024-05-29 15:21:17] [INFO ] Deduced a trap composed of 14 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:21:17] [INFO ] Deduced a trap composed of 8 places in 440 ms of which 1 ms to minimize.
[2024-05-29 15:21:18] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 1 ms to minimize.
[2024-05-29 15:21:18] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2024-05-29 15:21:19] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 1 ms to minimize.
[2024-05-29 15:21:19] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 1 ms to minimize.
[2024-05-29 15:21:19] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 0 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/49 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 9/58 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 4/62 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/186 variables, 1/64 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2270/2456 variables, 186/250 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 1125/1375 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2456 variables, 1/1376 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:24] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2456 variables, 1/1377 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:25] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2024-05-29 15:21:25] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 2 ms to minimize.
[2024-05-29 15:21:25] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2456 variables, 3/1380 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:25] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2456 variables, 1/1381 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2456 variables, 0/1381 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 19/2475 variables, 12/1393 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2475 variables, 1033/2426 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2475 variables, 2/2428 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2475 variables, 4/2432 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2475 variables, 0/2432 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 22 (OVERLAPS) 1/2476 variables, 1/2433 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2476 variables, 0/2433 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2476 variables, 0/2433 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2476/2476 variables, and 2433 constraints, problems are : Problem set: 5 solved, 2 unsolved in 22212 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 2158/2158 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 63/63 constraints]
After SMT, in 24360ms problems are : Problem set: 5 solved, 2 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=20 )
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 11 ms.
All properties solved without resorting to model-checking.
Total runtime 43368 ms.
ITS solved all properties within timeout

BK_STOP 1716996089962

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyCommit-PT-09a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690529800206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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