fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690529600119
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for StigmergyCommit-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
535.212 11846.00 29174.00 116.40 FFFTFTFTFTFFFFTT normal

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-171690529600119.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-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529600119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 359K 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-03b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716987152026

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:52:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 12:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:52:33] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-29 12:52:33] [INFO ] Transformed 1231 places.
[2024-05-29 12:52:33] [INFO ] Transformed 1476 transitions.
[2024-05-29 12:52:33] [INFO ] Found NUPN structural information;
[2024-05-29 12:52:33] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (516 resets) in 1647 ms. (24 steps per ms) remains 12/16 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (110 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (104 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (109 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (111 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (110 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (106 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (109 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (108 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (64 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (110 resets) in 601 ms. (66 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (108 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (108 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
// Phase 1: matrix 1476 rows 1231 cols
[2024-05-29 12:52:34] [INFO ] Computed 5 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem StigmergyCommit-PT-03b-ReachabilityFireability-2024-00 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-03b-ReachabilityFireability-2024-01 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-03b-ReachabilityFireability-2024-04 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-03b-ReachabilityFireability-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1064/1231 variables, 5/172 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1231 variables, 1064/1236 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-29 12:52:36] [INFO ] Deduced a trap composed of 398 places in 382 ms of which 52 ms to minimize.
Problem StigmergyCommit-PT-03b-ReachabilityFireability-2024-08 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 1/1237 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 0/1237 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1476/2707 variables, 1231/2468 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2707 variables, 0/2468 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2707 variables, 0/2468 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2707/2707 variables, and 2468 constraints, problems are : Problem set: 5 solved, 6 unsolved in 2504 ms.
Refiners :[Domain max(s): 1231/1231 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1231/1231 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1183/1231 variables, 5/53 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1231 variables, 1183/1236 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 1/1237 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-05-29 12:52:38] [INFO ] Deduced a trap composed of 207 places in 261 ms of which 6 ms to minimize.
[2024-05-29 12:52:38] [INFO ] Deduced a trap composed of 205 places in 346 ms of which 6 ms to minimize.
[2024-05-29 12:52:39] [INFO ] Deduced a trap composed of 398 places in 265 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 3/1240 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-05-29 12:52:39] [INFO ] Deduced a trap composed of 397 places in 357 ms of which 6 ms to minimize.
[2024-05-29 12:52:40] [INFO ] Deduced a trap composed of 396 places in 358 ms of which 6 ms to minimize.
[2024-05-29 12:52:40] [INFO ] Deduced a trap composed of 398 places in 275 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 3/1243 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/1243 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1476/2707 variables, 1231/2474 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2707 variables, 6/2480 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-05-29 12:52:41] [INFO ] Deduced a trap composed of 398 places in 241 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2707 variables, 1/2481 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2707/2707 variables, and 2481 constraints, problems are : Problem set: 5 solved, 6 unsolved in 5020 ms.
Refiners :[Domain max(s): 1231/1231 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1231/1231 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 8/8 constraints]
After SMT, in 7924ms problems are : Problem set: 5 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1127 edges and 1231 vertex of which 75 / 1231 are part of one of the 11 SCC in 11 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 1655 edges and 1167 vertex of which 1159 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 836 transitions
Trivial Post-agglo rules discarded 836 transitions
Performed 836 trivial Post agglomeration. Transition count delta: 836
Iterating post reduction 0 with 840 rules applied. Total rules applied 842 place count 1159 transition count 550
Reduce places removed 836 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 853 rules applied. Total rules applied 1695 place count 323 transition count 533
Reduce places removed 6 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 36 rules applied. Total rules applied 1731 place count 317 transition count 503
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 32 rules applied. Total rules applied 1763 place count 287 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1764 place count 286 transition count 501
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 52 Pre rules applied. Total rules applied 1764 place count 286 transition count 449
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 1868 place count 234 transition count 449
Discarding 49 places :
Symmetric choice reduction at 5 with 49 rule applications. Total rules 1917 place count 185 transition count 400
Iterating global reduction 5 with 49 rules applied. Total rules applied 1966 place count 185 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1968 place count 185 transition count 398
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1980 place count 173 transition count 386
Iterating global reduction 6 with 12 rules applied. Total rules applied 1992 place count 173 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1994 place count 173 transition count 384
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2000 place count 167 transition count 377
Iterating global reduction 7 with 6 rules applied. Total rules applied 2006 place count 167 transition count 377
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2010 place count 163 transition count 373
Iterating global reduction 7 with 4 rules applied. Total rules applied 2014 place count 163 transition count 373
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2018 place count 163 transition count 369
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2040 place count 152 transition count 358
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2043 place count 149 transition count 355
Iterating global reduction 8 with 3 rules applied. Total rules applied 2046 place count 149 transition count 355
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2049 place count 146 transition count 352
Iterating global reduction 8 with 3 rules applied. Total rules applied 2052 place count 146 transition count 352
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2055 place count 143 transition count 349
Iterating global reduction 8 with 3 rules applied. Total rules applied 2058 place count 143 transition count 349
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 2068 place count 138 transition count 364
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 2099 place count 138 transition count 333
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 2130 place count 107 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 2146 place count 107 transition count 317
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2152 place count 107 transition count 317
Applied a total of 2152 rules in 213 ms. Remains 107 /1231 variables (removed 1124) and now considering 317/1476 (removed 1159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 107/1231 places, 317/1476 transitions.
RANDOM walk for 40000 steps (3996 resets) in 729 ms. (54 steps per ms) remains 5/6 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (587 resets) in 86 ms. (459 steps per ms) remains 4/5 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (599 resets) in 116 ms. (341 steps per ms) remains 3/4 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (598 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (576 resets) in 41 ms. (952 steps per ms) remains 2/3 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (604 resets) in 27 ms. (1428 steps per ms) remains 1/2 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 317 rows 107 cols
[2024-05-29 12:52:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 12:52:43] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/107 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/424 variables, 107/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 27/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 107/107 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/107 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 317/424 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 27/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 107/107 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 10654 ms.
ITS solved all properties within timeout

BK_STOP 1716987163872

--------------------
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 ReachabilityFireability -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-03b"
export BK_EXAMINATION="ReachabilityFireability"
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-03b, examination is ReachabilityFireability"
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-171690529600119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03b.tgz
mv StigmergyCommit-PT-03b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;