About the Execution of GreatSPN+red for StigmergyCommit-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
544.760 | 13572.00 | 28918.00 | 65.40 | TTTFTFTTTTFTTFFF | 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-171690529600103.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-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529600103
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 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 231K 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-02b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716986364133
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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:39:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 12:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:39:25] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-29 12:39:25] [INFO ] Transformed 928 places.
[2024-05-29 12:39:25] [INFO ] Transformed 1040 transitions.
[2024-05-29 12:39:25] [INFO ] Found NUPN structural information;
[2024-05-29 12:39:25] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (648 resets) in 1559 ms. (25 steps per ms) remains 13/16 properties
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (162 resets) in 435 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (159 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (170 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (160 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (164 resets) in 108 ms. (367 steps per ms) remains 12/13 properties
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (165 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (164 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (167 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (159 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (160 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (161 resets) in 445 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (161 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
// Phase 1: matrix 1040 rows 928 cols
[2024-05-29 12:39:26] [INFO ] Computed 4 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem StigmergyCommit-PT-02b-ReachabilityFireability-2024-03 is UNSAT
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 811/928 variables, 4/121 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/928 variables, 811/932 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/928 variables, 0/932 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1040/1968 variables, 928/1860 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1968 variables, 0/1860 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1968 variables, 0/1860 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 1860 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1671 ms.
Refiners :[Domain max(s): 928/928 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 825/928 variables, 4/107 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/928 variables, 825/932 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-29 12:39:29] [INFO ] Deduced a trap composed of 396 places in 251 ms of which 43 ms to minimize.
Problem StigmergyCommit-PT-02b-ReachabilityFireability-2024-05 is UNSAT
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 12:39:29] [INFO ] Deduced a trap composed of 397 places in 300 ms of which 6 ms to minimize.
[2024-05-29 12:39:29] [INFO ] Deduced a trap composed of 420 places in 201 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/928 variables, 3/935 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-29 12:39:30] [INFO ] Deduced a trap composed of 397 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:39:30] [INFO ] Deduced a trap composed of 396 places in 262 ms of which 6 ms to minimize.
[2024-05-29 12:39:30] [INFO ] Deduced a trap composed of 488 places in 249 ms of which 5 ms to minimize.
[2024-05-29 12:39:31] [INFO ] Deduced a trap composed of 397 places in 191 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/928 variables, 4/939 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/928 variables, 0/939 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1040/1968 variables, 928/1867 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1968 variables, 10/1877 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1968 variables, 0/1877 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-29 12:39:33] [INFO ] Deduced a trap composed of 397 places in 191 ms of which 4 ms to minimize.
SMT process timed out in 6918ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 718 edges and 928 vertex of which 24 / 928 are part of one of the 4 SCC in 5 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 1216 edges and 908 vertex of which 904 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 904 transition count 508
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 514 rules applied. Total rules applied 1020 place count 401 transition count 497
Reduce places removed 5 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 2 with 78 rules applied. Total rules applied 1098 place count 396 transition count 424
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 79 rules applied. Total rules applied 1177 place count 323 transition count 418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1180 place count 320 transition count 418
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 38 Pre rules applied. Total rules applied 1180 place count 320 transition count 380
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 1256 place count 282 transition count 380
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1287 place count 251 transition count 349
Iterating global reduction 5 with 31 rules applied. Total rules applied 1318 place count 251 transition count 349
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1319 place count 250 transition count 348
Iterating global reduction 5 with 1 rules applied. Total rules applied 1320 place count 250 transition count 348
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1338 place count 241 transition count 339
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1340 place count 239 transition count 337
Iterating global reduction 5 with 2 rules applied. Total rules applied 1342 place count 239 transition count 337
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1350 place count 235 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1354 place count 235 transition count 335
Free-agglomeration rule applied 26 times.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1380 place count 235 transition count 309
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 1406 place count 209 transition count 309
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1408 place count 209 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1409 place count 208 transition count 308
Applied a total of 1409 rules in 169 ms. Remains 208 /928 variables (removed 720) and now considering 308/1040 (removed 732) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 208/928 places, 308/1040 transitions.
RANDOM walk for 40000 steps (2611 resets) in 548 ms. (72 steps per ms) remains 9/10 properties
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (493 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (530 resets) in 95 ms. (416 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (501 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (532 resets) in 107 ms. (370 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (513 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (519 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (523 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (512 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (515 resets) in 28 ms. (1379 steps per ms) remains 7/7 properties
// Phase 1: matrix 308 rows 208 cols
[2024-05-29 12:39:34] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 12:39:34] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 292/455 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 12/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 48/503 variables, 36/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 11/514 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/516 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/516 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 229 constraints, problems are : Problem set: 0 solved, 7 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 12:39:35] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:39:35] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 292/455 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 12:39:35] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 48/503 variables, 36/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 11/514 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/516 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/516 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 239 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1894ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 765 ms.
Support contains 55 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 308/308 transitions.
Graph (trivial) has 80 edges and 208 vertex of which 6 / 208 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 205 transition count 270
Reduce places removed 31 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 44 rules applied. Total rules applied 76 place count 174 transition count 257
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 89 place count 161 transition count 257
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 89 place count 161 transition count 246
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 111 place count 150 transition count 246
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 145 transition count 235
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 145 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 145 transition count 234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 143 transition count 232
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 143 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 141 transition count 230
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 139 transition count 228
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 139 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 137 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 137 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 136 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 136 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 136 transition count 224
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 153 place count 136 transition count 212
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 165 place count 124 transition count 212
Applied a total of 165 rules in 42 ms. Remains 124 /208 variables (removed 84) and now considering 212/308 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 124/208 places, 212/308 transitions.
RANDOM walk for 40000 steps (945 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (536 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (448 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 224670 steps, run visited all 2 properties in 448 ms. (steps per millisecond=501 )
Probabilistic random walk after 224670 steps, saw 52279 distinct states, run finished after 452 ms. (steps per millisecond=497 ) properties seen :2
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12332 ms.
ITS solved all properties within timeout
BK_STOP 1716986377705
--------------------
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-02b"
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-02b, 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-171690529600103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b 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 '
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 ;