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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:55 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 3.7M 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-06b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716990827119

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-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:53:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:53:48] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-05-29 13:53:48] [INFO ] Transformed 2140 places.
[2024-05-29 13:53:48] [INFO ] Transformed 6760 transitions.
[2024-05-29 13:53:48] [INFO ] Found NUPN structural information;
[2024-05-29 13:53:48] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (306 resets) in 1700 ms. (23 steps per ms) remains 7/12 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (46 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 597 ms. (66 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (45 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
// Phase 1: matrix 6760 rows 2140 cols
[2024-05-29 13:53:50] [INFO ] Computed 8 invariants in 143 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2032/2121 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2121 variables, 2032/2128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2121 variables, 0/2128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 19/2140 variables, 1/2129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2140 variables, 19/2148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2140 variables, 0/2148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 6760/8900 variables, 2140/4288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8900 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/8900 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8900/8900 variables, and 4288 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4531 ms.
Refiners :[Domain max(s): 2140/2140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 2140/2140 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2032/2121 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2121 variables, 2032/2128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 13:53:58] [INFO ] Deduced a trap composed of 401 places in 2839 ms of which 91 ms to minimize.
[2024-05-29 13:54:01] [INFO ] Deduced a trap composed of 398 places in 2703 ms of which 10 ms to minimize.
SMT process timed out in 11148ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 1949 edges and 2140 vertex of which 90 / 2140 are part of one of the 14 SCC in 10 ms
Free SCC test removed 76 places
Drop transitions (Empty/Sink Transition effects.) removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 3389 edges and 2064 vertex of which 2054 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.33 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1449 transitions
Trivial Post-agglo rules discarded 1449 transitions
Performed 1449 trivial Post agglomeration. Transition count delta: 1449
Iterating post reduction 0 with 1454 rules applied. Total rules applied 1456 place count 2054 transition count 5204
Reduce places removed 1449 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1474 rules applied. Total rules applied 2930 place count 605 transition count 5179
Reduce places removed 10 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 2 with 80 rules applied. Total rules applied 3010 place count 595 transition count 5109
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 74 rules applied. Total rules applied 3084 place count 525 transition count 5105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3085 place count 524 transition count 5105
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 76 Pre rules applied. Total rules applied 3085 place count 524 transition count 5029
Deduced a syphon composed of 76 places in 3 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 3237 place count 448 transition count 5029
Discarding 71 places :
Symmetric choice reduction at 5 with 71 rule applications. Total rules 3308 place count 377 transition count 4958
Iterating global reduction 5 with 71 rules applied. Total rules applied 3379 place count 377 transition count 4958
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 5 with 2 rules applied. Total rules applied 3381 place count 377 transition count 4956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3382 place count 376 transition count 4956
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3382 place count 376 transition count 4955
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3384 place count 375 transition count 4955
Discarding 34 places :
Symmetric choice reduction at 7 with 34 rule applications. Total rules 3418 place count 341 transition count 1025
Iterating global reduction 7 with 34 rules applied. Total rules applied 3452 place count 341 transition count 1025
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 3459 place count 341 transition count 1018
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3468 place count 332 transition count 1009
Iterating global reduction 8 with 9 rules applied. Total rules applied 3477 place count 332 transition count 1009
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3483 place count 326 transition count 1003
Iterating global reduction 8 with 6 rules applied. Total rules applied 3489 place count 326 transition count 1003
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 3491 place count 326 transition count 1001
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 9 with 62 rules applied. Total rules applied 3553 place count 295 transition count 970
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 3560 place count 288 transition count 963
Iterating global reduction 9 with 7 rules applied. Total rules applied 3567 place count 288 transition count 963
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 3572 place count 283 transition count 958
Iterating global reduction 9 with 5 rules applied. Total rules applied 3577 place count 283 transition count 958
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 3582 place count 278 transition count 953
Iterating global reduction 9 with 5 rules applied. Total rules applied 3587 place count 278 transition count 953
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 3605 place count 269 transition count 962
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 3608 place count 269 transition count 959
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 3616 place count 269 transition count 951
Free-agglomeration rule applied 60 times.
Iterating global reduction 10 with 60 rules applied. Total rules applied 3676 place count 269 transition count 891
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 3736 place count 209 transition count 891
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3738 place count 207 transition count 889
Iterating global reduction 11 with 2 rules applied. Total rules applied 3740 place count 207 transition count 889
Drop transitions (Redundant composition of simpler transitions.) removed 231 transitions
Redundant transition composition rules discarded 231 transitions
Iterating global reduction 11 with 231 rules applied. Total rules applied 3971 place count 207 transition count 658
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 3980 place count 207 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 3984 place count 207 transition count 654
Applied a total of 3984 rules in 1504 ms. Remains 207 /2140 variables (removed 1933) and now considering 654/6760 (removed 6106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1529 ms. Remains : 207/2140 places, 654/6760 transitions.
RANDOM walk for 40000 steps (969 resets) in 814 ms. (49 steps per ms) remains 5/7 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (131 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (135 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (132 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (123 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (127 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
// Phase 1: matrix 654 rows 207 cols
[2024-05-29 13:54:03] [INFO ] Computed 8 invariants in 6 ms
[2024-05-29 13:54:03] [INFO ] State equation strengthened by 354 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 654/861 variables, 207/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 354/569 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/861 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/861 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 207/207 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-29 13:54:04] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-06b-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:54:05] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 1 ms to minimize.
[2024-05-29 13:54:06] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2024-05-29 13:54:06] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 1 ms to minimize.
[2024-05-29 13:54:06] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 1 ms to minimize.
[2024-05-29 13:54:06] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2024-05-29 13:54:06] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 2 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 14/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:54:07] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/207 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 654/861 variables, 207/232 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 354/586 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 4/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-05-29 13:54:08] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 6/596 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 13:54:09] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:54:09] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:54:09] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:54:09] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 4/600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 600 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5725 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 207/207 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 27/27 constraints]
After SMT, in 6800ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 528 ms.
Support contains 9 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 654/654 transitions.
Graph (trivial) has 168 edges and 207 vertex of which 16 / 207 are part of one of the 8 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 652 edges and 199 vertex of which 197 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 197 transition count 572
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 73 rules applied. Total rules applied 141 place count 133 transition count 563
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 144 place count 132 transition count 561
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 130 transition count 561
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 146 place count 130 transition count 553
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 162 place count 122 transition count 553
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 173 place count 111 transition count 542
Iterating global reduction 4 with 11 rules applied. Total rules applied 184 place count 111 transition count 542
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 188 place count 107 transition count 537
Iterating global reduction 4 with 4 rules applied. Total rules applied 192 place count 107 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 106 transition count 536
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 106 transition count 536
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 224 place count 91 transition count 521
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 91 transition count 517
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 243 place count 76 transition count 502
Iterating global reduction 5 with 15 rules applied. Total rules applied 258 place count 76 transition count 502
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 270 place count 76 transition count 490
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 272 place count 74 transition count 488
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 74 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 275 place count 74 transition count 487
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 277 place count 72 transition count 485
Iterating global reduction 7 with 2 rules applied. Total rules applied 279 place count 72 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 280 place count 72 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 286 place count 69 transition count 491
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 289 place count 69 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 294 place count 69 transition count 483
Free-agglomeration rule applied 15 times.
Iterating global reduction 9 with 15 rules applied. Total rules applied 309 place count 69 transition count 468
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 9 with 88 rules applied. Total rules applied 397 place count 54 transition count 395
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 398 place count 53 transition count 393
Iterating global reduction 10 with 1 rules applied. Total rules applied 399 place count 53 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 413 place count 53 transition count 379
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 414 place count 53 transition count 378
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 417 place count 52 transition count 376
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 423 place count 52 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 425 place count 52 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 428 place count 52 transition count 371
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 429 place count 51 transition count 369
Iterating global reduction 12 with 1 rules applied. Total rules applied 430 place count 51 transition count 369
Applied a total of 430 rules in 212 ms. Remains 51 /207 variables (removed 156) and now considering 369/654 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 51/207 places, 369/654 transitions.
RANDOM walk for 26710 steps (1215 resets) in 240 ms. (110 steps per ms) remains 0/2 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 22849 ms.
ITS solved all properties within timeout

BK_STOP 1716990851378

--------------------
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-06b"
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-06b, 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-171690529800166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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