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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 153M 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 StigmergyElection-PT-11a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717021068998

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 22:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 22:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:17:55] [INFO ] Load time of PNML (sax parser for PT used): 5155 ms
[2024-05-29 22:17:55] [INFO ] Transformed 156 places.
[2024-05-29 22:17:56] [INFO ] Transformed 136650 transitions.
[2024-05-29 22:17:56] [INFO ] Found NUPN structural information;
[2024-05-29 22:17:56] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 6417 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 12273 ms. (3 steps per ms) remains 4/9 properties
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/4 properties
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 889 ms. (44 steps per ms) remains 3/3 properties
[2024-05-29 22:18:01] [INFO ] Flow matrix only has 4272 transitions (discarded 33 similar events)
// Phase 1: matrix 4272 rows 156 cols
[2024-05-29 22:18:01] [INFO ] Computed 12 invariants in 57 ms
[2024-05-29 22:18:01] [INFO ] State equation strengthened by 4148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 100/155 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 100/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/156 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4271/4427 variables, 156/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4427 variables, 4147/4471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4427 variables, 0/4471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/4428 variables, 1/4472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4428 variables, 0/4472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4428 variables, 0/4472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4428/4428 variables, and 4472 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2246 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 156/156 constraints, ReadFeed: 4148/4148 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 100/155 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 100/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 22:18:05] [INFO ] Deduced a trap composed of 12 places in 1173 ms of which 22 ms to minimize.
[2024-05-29 22:18:06] [INFO ] Deduced a trap composed of 13 places in 1108 ms of which 2 ms to minimize.
[2024-05-29 22:18:07] [INFO ] Deduced a trap composed of 12 places in 976 ms of which 1 ms to minimize.
[2024-05-29 22:18:08] [INFO ] Deduced a trap composed of 13 places in 968 ms of which 1 ms to minimize.
[2024-05-29 22:18:09] [INFO ] Deduced a trap composed of 14 places in 873 ms of which 1 ms to minimize.
SMT process timed out in 8781ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Graph (complete) has 584 edges and 156 vertex of which 151 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.37 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 151 transition count 4259
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 61 place count 143 transition count 4248
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 67 place count 140 transition count 4245
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 137 transition count 4243
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 72 place count 137 transition count 4234
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 90 place count 128 transition count 4234
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 101 place count 117 transition count 4223
Iterating global reduction 4 with 11 rules applied. Total rules applied 112 place count 117 transition count 4223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 115 transition count 4221
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 115 transition count 4221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 115 transition count 4220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 125 place count 111 transition count 4216
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 127 place count 109 transition count 4214
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 109 transition count 4214
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 142 place count 109 transition count 4201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 109 transition count 4200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 144 place count 108 transition count 4200
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 150 place count 105 transition count 4197
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 151 place count 104 transition count 4196
Iterating global reduction 7 with 1 rules applied. Total rules applied 152 place count 104 transition count 4196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 153 place count 104 transition count 4195
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 157 place count 104 transition count 4191
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 161 place count 100 transition count 4191
Applied a total of 161 rules in 6784 ms. Remains 100 /156 variables (removed 56) and now considering 4191/4305 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6799 ms. Remains : 100/156 places, 4191/4305 transitions.
RANDOM walk for 40000 steps (9 resets) in 15713 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1223749 steps, run timeout after 12001 ms. (steps per millisecond=101 ) properties seen :0 out of 3
Probabilistic random walk after 1223749 steps, saw 160418 distinct states, run finished after 12006 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 4191 rows 100 cols
[2024-05-29 22:18:32] [INFO ] Computed 11 invariants in 29 ms
[2024-05-29 22:18:33] [INFO ] State equation strengthened by 4139 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/97 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4190/4288 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4288 variables, 2084/2193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4288 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/4291 variables, 2/2195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4291 variables, 2055/4250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4291 variables, 0/4250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/4291 variables, 0/4250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4291/4291 variables, and 4250 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 100/100 constraints, ReadFeed: 4139/4139 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/97 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 22:18:36] [INFO ] Deduced a trap composed of 8 places in 911 ms of which 1 ms to minimize.
[2024-05-29 22:18:37] [INFO ] Deduced a trap composed of 10 places in 920 ms of which 1 ms to minimize.
[2024-05-29 22:18:37] [INFO ] Deduced a trap composed of 7 places in 907 ms of which 2 ms to minimize.
[2024-05-29 22:18:38] [INFO ] Deduced a trap composed of 9 places in 948 ms of which 1 ms to minimize.
[2024-05-29 22:18:39] [INFO ] Deduced a trap composed of 6 places in 826 ms of which 1 ms to minimize.
[2024-05-29 22:18:40] [INFO ] Deduced a trap composed of 8 places in 750 ms of which 1 ms to minimize.
[2024-05-29 22:18:41] [INFO ] Deduced a trap composed of 8 places in 597 ms of which 1 ms to minimize.
[2024-05-29 22:18:41] [INFO ] Deduced a trap composed of 12 places in 603 ms of which 0 ms to minimize.
[2024-05-29 22:18:42] [INFO ] Deduced a trap composed of 9 places in 797 ms of which 1 ms to minimize.
[2024-05-29 22:18:43] [INFO ] Deduced a trap composed of 9 places in 659 ms of which 1 ms to minimize.
[2024-05-29 22:18:43] [INFO ] Deduced a trap composed of 10 places in 505 ms of which 1 ms to minimize.
[2024-05-29 22:18:44] [INFO ] Deduced a trap composed of 10 places in 503 ms of which 1 ms to minimize.
[2024-05-29 22:18:44] [INFO ] Deduced a trap composed of 8 places in 489 ms of which 3 ms to minimize.
[2024-05-29 22:18:45] [INFO ] Deduced a trap composed of 10 places in 486 ms of which 3 ms to minimize.
[2024-05-29 22:18:45] [INFO ] Deduced a trap composed of 11 places in 649 ms of which 0 ms to minimize.
[2024-05-29 22:18:46] [INFO ] Deduced a trap composed of 8 places in 496 ms of which 1 ms to minimize.
[2024-05-29 22:18:46] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 2 ms to minimize.
[2024-05-29 22:18:47] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 22:18:47] [INFO ] Deduced a trap composed of 10 places in 811 ms of which 1 ms to minimize.
[2024-05-29 22:18:48] [INFO ] Deduced a trap composed of 9 places in 722 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 20/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 22:18:49] [INFO ] Deduced a trap composed of 8 places in 822 ms of which 1 ms to minimize.
[2024-05-29 22:18:50] [INFO ] Deduced a trap composed of 8 places in 969 ms of which 0 ms to minimize.
[2024-05-29 22:18:51] [INFO ] Deduced a trap composed of 10 places in 954 ms of which 1 ms to minimize.
[2024-05-29 22:18:52] [INFO ] Deduced a trap composed of 8 places in 826 ms of which 1 ms to minimize.
[2024-05-29 22:18:52] [INFO ] Deduced a trap composed of 9 places in 729 ms of which 0 ms to minimize.
[2024-05-29 22:18:53] [INFO ] Deduced a trap composed of 10 places in 652 ms of which 1 ms to minimize.
[2024-05-29 22:18:54] [INFO ] Deduced a trap composed of 9 places in 591 ms of which 0 ms to minimize.
[2024-05-29 22:18:54] [INFO ] Deduced a trap composed of 6 places in 591 ms of which 0 ms to minimize.
[2024-05-29 22:18:55] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 1 ms to minimize.
[2024-05-29 22:18:55] [INFO ] Deduced a trap composed of 9 places in 497 ms of which 4 ms to minimize.
[2024-05-29 22:18:56] [INFO ] Deduced a trap composed of 7 places in 538 ms of which 1 ms to minimize.
[2024-05-29 22:18:56] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 2 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 22:18:57] [INFO ] Deduced a trap composed of 10 places in 670 ms of which 1 ms to minimize.
[2024-05-29 22:18:58] [INFO ] Deduced a trap composed of 7 places in 561 ms of which 0 ms to minimize.
[2024-05-29 22:18:58] [INFO ] Deduced a trap composed of 9 places in 549 ms of which 2 ms to minimize.
[2024-05-29 22:18:59] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 97/4291 variables, and 46 constraints, problems are : Problem set: 3 solved, 0 unsolved in 23975 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 0/100 constraints, ReadFeed: 0/4139 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 36/36 constraints]
After SMT, in 26358ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 68899 ms.
ITS solved all properties within timeout

BK_STOP 1717021139162

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="StigmergyElection-PT-11a"
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 StigmergyElection-PT-11a, 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-171690530300398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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