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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 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 155M 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-10a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717000972919

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-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 16:42:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 16:42:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:42:59] [INFO ] Load time of PNML (sax parser for PT used): 5313 ms
[2024-05-29 16:42:59] [INFO ] Transformed 400 places.
[2024-05-29 16:43:00] [INFO ] Transformed 136960 transitions.
[2024-05-29 16:43:00] [INFO ] Found NUPN structural information;
[2024-05-29 16:43:00] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 6279 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 421 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 15167 ms. (2 steps per ms) remains 10/15 properties
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
[2024-05-29 16:43:06] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2024-05-29 16:43:06] [INFO ] Computed 12 invariants in 56 ms
[2024-05-29 16:43:07] [INFO ] State equation strengthened by 4247 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 243/399 variables, 11/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 243/410 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/400 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4581/4981 variables, 400/812 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4981 variables, 4246/5058 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4981 variables, 0/5058 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/4982 variables, 1/5059 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4982 variables, 0/5059 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/4982 variables, 0/5059 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4982/4982 variables, and 5059 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4833 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 400/400 constraints, ReadFeed: 4247/4247 constraints, PredecessorRefiner: 10/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 243/399 variables, 11/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 243/410 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 16:43:14] [INFO ] Deduced a trap composed of 17 places in 1543 ms of which 31 ms to minimize.
[2024-05-29 16:43:16] [INFO ] Deduced a trap composed of 17 places in 1515 ms of which 4 ms to minimize.
[2024-05-29 16:43:17] [INFO ] Deduced a trap composed of 16 places in 1573 ms of which 3 ms to minimize.
[2024-05-29 16:43:19] [INFO ] Deduced a trap composed of 19 places in 1546 ms of which 6 ms to minimize.
SMT process timed out in 12561ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 156 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Graph (complete) has 993 edges and 400 vertex of which 395 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.38 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 395 transition count 4559
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 76 place count 378 transition count 4552
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 87 place count 377 transition count 4542
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 104 place count 367 transition count 4535
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 104 place count 367 transition count 4506
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 162 place count 338 transition count 4506
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 193 place count 307 transition count 4475
Iterating global reduction 4 with 31 rules applied. Total rules applied 224 place count 307 transition count 4475
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 228 place count 307 transition count 4471
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 236 place count 299 transition count 4463
Iterating global reduction 5 with 8 rules applied. Total rules applied 244 place count 299 transition count 4463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 246 place count 299 transition count 4461
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 264 place count 290 transition count 4452
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 265 place count 290 transition count 4451
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 269 place count 286 transition count 4447
Iterating global reduction 7 with 4 rules applied. Total rules applied 273 place count 286 transition count 4447
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 294 place count 286 transition count 4426
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 295 place count 286 transition count 4425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 296 place count 285 transition count 4425
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 9 with 4 rules applied. Total rules applied 300 place count 283 transition count 4423
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 301 place count 282 transition count 4422
Iterating global reduction 9 with 1 rules applied. Total rules applied 302 place count 282 transition count 4422
Free-agglomeration rule applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 319 place count 282 transition count 4405
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 336 place count 265 transition count 4405
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 338 place count 265 transition count 4403
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 343 place count 265 transition count 4403
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 346 place count 265 transition count 4400
Applied a total of 346 rules in 13516 ms. Remains 265 /400 variables (removed 135) and now considering 4400/4615 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13532 ms. Remains : 265/400 places, 4400/4615 transitions.
RANDOM walk for 40000 steps (8 resets) in 15974 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 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 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 1472435 steps, run timeout after 15001 ms. (steps per millisecond=98 ) properties seen :4 out of 10
Probabilistic random walk after 1472435 steps, saw 203828 distinct states, run finished after 15005 ms. (steps per millisecond=98 ) properties seen :4
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 4400 rows 265 cols
[2024-05-29 16:43:53] [INFO ] Computed 12 invariants in 26 ms
[2024-05-29 16:43:53] [INFO ] State equation strengthened by 4233 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/264 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/265 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4400/4665 variables, 265/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4665 variables, 4233/4510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4665 variables, 0/4510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/4665 variables, 0/4510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4665/4665 variables, and 4510 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2514 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 265/265 constraints, ReadFeed: 4233/4233 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/264 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 16:43:57] [INFO ] Deduced a trap composed of 12 places in 1167 ms of which 4 ms to minimize.
[2024-05-29 16:43:58] [INFO ] Deduced a trap composed of 11 places in 1248 ms of which 2 ms to minimize.
[2024-05-29 16:43:59] [INFO ] Deduced a trap composed of 12 places in 1107 ms of which 2 ms to minimize.
[2024-05-29 16:44:01] [INFO ] Deduced a trap composed of 13 places in 1127 ms of which 2 ms to minimize.
[2024-05-29 16:44:01] [INFO ] Deduced a trap composed of 18 places in 943 ms of which 2 ms to minimize.
[2024-05-29 16:44:02] [INFO ] Deduced a trap composed of 16 places in 953 ms of which 2 ms to minimize.
[2024-05-29 16:44:03] [INFO ] Deduced a trap composed of 14 places in 875 ms of which 1 ms to minimize.
[2024-05-29 16:44:04] [INFO ] Deduced a trap composed of 10 places in 805 ms of which 1 ms to minimize.
[2024-05-29 16:44:05] [INFO ] Deduced a trap composed of 13 places in 627 ms of which 1 ms to minimize.
[2024-05-29 16:44:05] [INFO ] Deduced a trap composed of 14 places in 503 ms of which 1 ms to minimize.
[2024-05-29 16:44:06] [INFO ] Deduced a trap composed of 11 places in 612 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-01 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 16:44:07] [INFO ] Deduced a trap composed of 11 places in 741 ms of which 2 ms to minimize.
[2024-05-29 16:44:07] [INFO ] Deduced a trap composed of 14 places in 739 ms of which 2 ms to minimize.
[2024-05-29 16:44:08] [INFO ] Deduced a trap composed of 13 places in 622 ms of which 1 ms to minimize.
[2024-05-29 16:44:09] [INFO ] Deduced a trap composed of 12 places in 633 ms of which 1 ms to minimize.
[2024-05-29 16:44:09] [INFO ] Deduced a trap composed of 11 places in 523 ms of which 1 ms to minimize.
[2024-05-29 16:44:10] [INFO ] Deduced a trap composed of 12 places in 518 ms of which 1 ms to minimize.
[2024-05-29 16:44:10] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 1 ms to minimize.
[2024-05-29 16:44:11] [INFO ] Deduced a trap composed of 12 places in 516 ms of which 1 ms to minimize.
[2024-05-29 16:44:11] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-01 is UNSAT
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-05 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-07 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-29 16:44:12] [INFO ] Deduced a trap composed of 14 places in 618 ms of which 1 ms to minimize.
[2024-05-29 16:44:12] [INFO ] Deduced a trap composed of 16 places in 661 ms of which 1 ms to minimize.
[2024-05-29 16:44:13] [INFO ] Deduced a trap composed of 16 places in 563 ms of which 1 ms to minimize.
[2024-05-29 16:44:13] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 1 ms to minimize.
[2024-05-29 16:44:14] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-03 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 16:44:14] [INFO ] Deduced a trap composed of 10 places in 532 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-11 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 16:44:15] [INFO ] Deduced a trap composed of 16 places in 747 ms of which 1 ms to minimize.
[2024-05-29 16:44:16] [INFO ] Deduced a trap composed of 13 places in 787 ms of which 1 ms to minimize.
[2024-05-29 16:44:17] [INFO ] Deduced a trap composed of 11 places in 696 ms of which 1 ms to minimize.
[2024-05-29 16:44:17] [INFO ] Deduced a trap composed of 14 places in 562 ms of which 1 ms to minimize.
[2024-05-29 16:44:18] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 3 ms to minimize.
[2024-05-29 16:44:18] [INFO ] Deduced a trap composed of 13 places in 563 ms of which 2 ms to minimize.
[2024-05-29 16:44:19] [INFO ] Deduced a trap composed of 17 places in 564 ms of which 1 ms to minimize.
[2024-05-29 16:44:19] [INFO ] Deduced a trap composed of 12 places in 440 ms of which 1 ms to minimize.
[2024-05-29 16:44:20] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2024-13 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 264/4665 variables, and 46 constraints, problems are : Problem set: 6 solved, 0 unsolved in 23995 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, State Equation: 0/265 constraints, ReadFeed: 0/4233 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 35/35 constraints]
After SMT, in 27114ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 86204 ms.
ITS solved all properties within timeout

BK_STOP 1717001060311

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

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