Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531800190.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531800190
=====================================================================

--------------------
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 1717234319243

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:32:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:32:01] [INFO ] Load time of PNML (sax parser for PT used): 886 ms
[2024-06-01 09:32:01] [INFO ] Transformed 328 places.
[2024-06-01 09:32:01] [INFO ] Transformed 18744 transitions.
[2024-06-01 09:32:01] [INFO ] Found NUPN structural information;
[2024-06-01 09:32:01] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1117 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 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 (10 resets) in 3318 ms. (12 steps per ms) remains 12/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
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1233 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
[2024-06-01 09:32:03] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2024-06-01 09:32:03] [INFO ] Computed 10 invariants in 30 ms
[2024-06-01 09:32:03] [INFO ] State equation strengthened by 1147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 199/327 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 199/336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/328 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1421/1749 variables, 328/666 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1749 variables, 1146/1812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1749 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/1750 variables, 1/1813 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1750 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/1750 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 1813 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3309 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: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 199/327 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 199/336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 09:32:08] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 25 ms to minimize.
[2024-06-01 09:32:08] [INFO ] Deduced a trap composed of 17 places in 461 ms of which 5 ms to minimize.
[2024-06-01 09:32:08] [INFO ] Deduced a trap composed of 16 places in 436 ms of which 4 ms to minimize.
[2024-06-01 09:32:09] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 3 ms to minimize.
[2024-06-01 09:32:09] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 6 ms to minimize.
[2024-06-01 09:32:10] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 2 ms to minimize.
[2024-06-01 09:32:10] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 2 ms to minimize.
[2024-06-01 09:32:10] [INFO ] Deduced a trap composed of 16 places in 369 ms of which 2 ms to minimize.
[2024-06-01 09:32:11] [INFO ] Deduced a trap composed of 16 places in 317 ms of which 3 ms to minimize.
[2024-06-01 09:32:11] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 2 ms to minimize.
[2024-06-01 09:32:11] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 2 ms to minimize.
[2024-06-01 09:32:11] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 2 ms to minimize.
[2024-06-01 09:32:12] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
SMT process timed out in 8836ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 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 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 81 place count 298 transition count 1363
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 125 place count 276 transition count 1363
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 149 place count 252 transition count 1339
Iterating global reduction 4 with 24 rules applied. Total rules applied 173 place count 252 transition count 1339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 252 transition count 1338
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 183 place count 243 transition count 1328
Iterating global reduction 5 with 9 rules applied. Total rules applied 192 place count 243 transition count 1328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 194 place count 243 transition count 1326
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 206 place count 237 transition count 1320
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 208 place count 235 transition count 1318
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 235 transition count 1318
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 225 place count 235 transition count 1303
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 229 place count 233 transition count 1301
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 231 place count 231 transition count 1299
Iterating global reduction 6 with 2 rules applied. Total rules applied 233 place count 231 transition count 1299
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 234 place count 231 transition count 1298
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 243 place count 231 transition count 1289
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 252 place count 222 transition count 1289
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 253 place count 222 transition count 1288
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 256 place count 222 transition count 1288
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 258 place count 222 transition count 1286
Applied a total of 258 rules in 1431 ms. Remains 222 /328 variables (removed 106) and now considering 1286/1449 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1456 ms. Remains : 222/328 places, 1286/1449 transitions.
RANDOM walk for 40000 steps (13 resets) in 3434 ms. (11 steps per ms) remains 10/11 properties
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 563201 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :6 out of 10
Probabilistic random walk after 563201 steps, saw 85892 distinct states, run finished after 3004 ms. (steps per millisecond=187 ) properties seen :6
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1286 rows 222 cols
[2024-06-01 09:32:17] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 09:32:18] [INFO ] State equation strengthened by 1131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 59/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/143 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1208/1351 variables, 143/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1351 variables, 137/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1351 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 127/1478 variables, 58/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 991/1334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1478 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 29/1507 variables, 20/1354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1507 variables, 3/1357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1507 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/1508 variables, 1/1358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1508 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1508 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1508/1508 variables, and 1358 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 222/222 constraints, ReadFeed: 1131/1131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 59/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:32:19] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2024-06-01 09:32:19] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-06-01 09:32:19] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:32:19] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 12 places in 83 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-06-01 09:32:20] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:32:20] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:32:21] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:32:21] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:32:21] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-01 09:32:21] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-06-01 09:32:21] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:32:21] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1208/1351 variables, 143/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1351 variables, 137/304 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1351 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 127/1478 variables, 58/362 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1478 variables, 991/1353 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1478 variables, 3/1356 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:32:22] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-06-01 09:32:22] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-06-01 09:32:22] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-06-01 09:32:23] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2024-06-01 09:32:23] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:32:23] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:32:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:32:23] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1478 variables, 8/1364 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1478 variables, 0/1364 constraints. Problems are: Problem set: 1 solved, 3 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) 29/1507 variables, 20/1384 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1507 variables, 3/1387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 09:32:24] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2024-06-01 09:32:25] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:32:25] [INFO ] Deduced a trap composed of 12 places in 78 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-06-01 09:32:25] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:32:25] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:32:25] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:32:25] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:32:26] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-06-01 09:32:26] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:32:26] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:32:26] [INFO ] Deduced a trap composed of 8 places in 86 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
After SMT solving in domain Int declared 1507/1508 variables, and 1398 constraints, problems are : Problem set: 4 solved, 0 unsolved in 7330 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 221/222 constraints, ReadFeed: 1131/1131 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 38/38 constraints]
After SMT, in 8786ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 26412 ms.
ITS solved all properties within timeout

BK_STOP 1717234346807

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r536-tall-171690531800190"
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 ;