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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K 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.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 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:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 17:41 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 17M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716993937224

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-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 14:45:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 14:45:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:45:39] [INFO ] Load time of PNML (sax parser for PT used): 877 ms
[2024-05-29 14:45:39] [INFO ] Transformed 328 places.
[2024-05-29 14:45:39] [INFO ] Transformed 18744 transitions.
[2024-05-29 14:45:39] [INFO ] Found NUPN structural information;
[2024-05-29 14:45:39] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 121 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9 resets) in 4120 ms. (9 steps per ms) remains 13/15 properties
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
[2024-05-29 14:45:41] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2024-05-29 14:45:41] [INFO ] Computed 10 invariants in 29 ms
[2024-05-29 14:45:41] [INFO ] State equation strengthened by 1147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 197/327 variables, 9/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 197/336 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/328 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1421/1749 variables, 328/666 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1749 variables, 1146/1812 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1749 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/1750 variables, 1/1813 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1750 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1750 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 1813 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5190 ms.
Refiners :[Domain max(s): 328/328 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 328/328 constraints, ReadFeed: 1147/1147 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 197/327 variables, 9/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 197/336 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 14:45:48] [INFO ] Deduced a trap composed of 16 places in 495 ms of which 25 ms to minimize.
[2024-05-29 14:45:48] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 4 ms to minimize.
[2024-05-29 14:45:48] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 3 ms to minimize.
[2024-05-29 14:45:49] [INFO ] Deduced a trap composed of 16 places in 323 ms of which 9 ms to minimize.
[2024-05-29 14:45:49] [INFO ] Deduced a trap composed of 16 places in 314 ms of which 2 ms to minimize.
[2024-05-29 14:45:49] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 2 ms to minimize.
[2024-05-29 14:45:50] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:45:50] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 2 ms to minimize.
[2024-05-29 14:45:50] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:45:50] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 2 ms to minimize.
[2024-05-29 14:45:50] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:45:51] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 2 ms to minimize.
[2024-05-29 14:45:51] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 2 ms to minimize.
[2024-05-29 14:45:51] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2024-05-29 14:45:51] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:45:51] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:45:52] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:45:52] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
SMT process timed out in 10715ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 321 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 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 31 rules applied. Total rules applied 32 place count 321 transition count 1411
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 14 rules applied. Total rules applied 46 place count 313 transition count 1405
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 15 rules applied. Total rules applied 61 place count 311 transition count 1392
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 81 place count 298 transition count 1385
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 81 place count 298 transition count 1364
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 123 place count 277 transition count 1364
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 146 place count 254 transition count 1341
Iterating global reduction 4 with 23 rules applied. Total rules applied 169 place count 254 transition count 1341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 170 place count 254 transition count 1340
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 178 place count 246 transition count 1331
Iterating global reduction 5 with 8 rules applied. Total rules applied 186 place count 246 transition count 1331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 188 place count 246 transition count 1329
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 200 place count 240 transition count 1323
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 202 place count 238 transition count 1321
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 238 transition count 1321
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 219 place count 238 transition count 1306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 236 transition count 1304
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 225 place count 234 transition count 1302
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 234 transition count 1302
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 228 place count 234 transition count 1301
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 237 place count 234 transition count 1292
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 246 place count 225 transition count 1292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 225 transition count 1291
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 250 place count 225 transition count 1291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 252 place count 225 transition count 1289
Applied a total of 252 rules in 1409 ms. Remains 225 /328 variables (removed 103) and now considering 1289/1449 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1419 ms. Remains : 225/328 places, 1289/1449 transitions.
RANDOM walk for 40000 steps (9 resets) in 3330 ms. (12 steps per ms) remains 5/13 properties
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
// Phase 1: matrix 1289 rows 225 cols
[2024-05-29 14:45:54] [INFO ] Computed 5 invariants in 6 ms
[2024-05-29 14:45:54] [INFO ] State equation strengthened by 1132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/148 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1214/1362 variables, 148/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1362 variables, 139/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1362 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 123/1485 variables, 57/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1485 variables, 990/1339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1485 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 28/1513 variables, 19/1358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1513 variables, 3/1361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1513 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/1514 variables, 1/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1514 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1514 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 1362 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 225/225 constraints, ReadFeed: 1132/1132 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 14:45:56] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:45:56] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:45:56] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-08a-ReachabilityCardinality-2024-08 is UNSAT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:45:57] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/148 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1214/1362 variables, 148/167 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1362 variables, 139/306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1362 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 123/1485 variables, 57/363 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1485 variables, 990/1353 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1485 variables, 4/1357 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 14:45:59] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:45:59] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 4 ms to minimize.
[2024-05-29 14:45:59] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-29 14:45:59] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-05-29 14:46:00] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1485 variables, 5/1362 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1485 variables, 0/1362 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem StigmergyCommit-PT-08a-ReachabilityCardinality-2024-03 is UNSAT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 28/1513 variables, 19/1381 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1513 variables, 3/1384 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-29 14:46:01] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:46:01] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 2 ms to minimize.
[2024-05-29 14:46:01] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 2 ms to minimize.
[2024-05-29 14:46:01] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:46:02] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:46:02] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:46:02] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:46:02] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:46:02] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-08a-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 14:46:02] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:46:03] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:46:03] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:46:03] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-08a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (INCLUDED_ONLY) 0/1513 variables, 13/1397 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-29 14:46:03] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:46:04] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1513 variables, 2/1399 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1513 variables, 0/1399 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1514 variables, 1/1400 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-29 14:46:04] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:46:04] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:46:04] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:46:04] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:46:05] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:46:05] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1514 variables, 6/1406 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1514 variables, 0/1406 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1514 variables, 0/1406 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1514/1514 variables, and 1406 constraints, problems are : Problem set: 4 solved, 1 unsolved in 8956 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 225/225 constraints, ReadFeed: 1132/1132 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 40/40 constraints]
After SMT, in 10681ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 138 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=27 )
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 27088 ms.
ITS solved all properties within timeout

BK_STOP 1716993965483

--------------------
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-08a"
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-08a, 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-171690529800190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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