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.r400-tall-171690532000310.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 itstools
Input is StigmergyElection-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532000310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 428K 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-05b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717008076182

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 18:41:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:41:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:41:17] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-29 18:41:17] [INFO ] Transformed 699 places.
[2024-05-29 18:41:17] [INFO ] Transformed 1266 transitions.
[2024-05-29 18:41:17] [INFO ] Found NUPN structural information;
[2024-05-29 18:41:17] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (446 resets) in 2252 ms. (17 steps per ms) remains 8/12 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 18:41:18] [INFO ] Flatten gal took : 353 ms
BEST_FIRST walk for 40003 steps (78 resets) in 268 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 505 ms. (79 steps per ms) remains 8/8 properties
[2024-05-29 18:41:18] [INFO ] Flatten gal took : 223 ms
BEST_FIRST walk for 40002 steps (77 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (80 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
[2024-05-29 18:41:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4254640754446890619.gal : 101 ms
BEST_FIRST walk for 40003 steps (72 resets) in 197 ms. (202 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (82 resets) in 373 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
[2024-05-29 18:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3974439781971861540.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4254640754446890619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3974439781971861540.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (75 resets) in 136 ms. (291 steps per ms) remains 7/7 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 1266 rows 699 cols
[2024-05-29 18:41:19] [INFO ] Computed 6 invariants in 32 ms
Loading property file /tmp/ReachabilityCardinality3974439781971861540.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 620/699 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 620/705 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :27 after 135
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :135 after 456
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :456 after 880
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :880 after 1068
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1068 after 3147
At refinement iteration 5 (OVERLAPS) 1266/1965 variables, 699/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3147 after 186559
At refinement iteration 6 (INCLUDED_ONLY) 0/1965 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :186559 after 2.12438e+06
At refinement iteration 7 (OVERLAPS) 0/1965 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 1404 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1334 ms.
Refiners :[Domain max(s): 699/699 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 699/699 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/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem StigmergyElection-PT-05b-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 620/699 variables, 6/85 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 620/705 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :2.12438e+06 after 1.09215e+08
[2024-05-29 18:41:21] [INFO ] Deduced a trap composed of 192 places in 736 ms of which 79 ms to minimize.
[2024-05-29 18:41:22] [INFO ] Deduced a trap composed of 192 places in 433 ms of which 4 ms to minimize.
[2024-05-29 18:41:22] [INFO ] Deduced a trap composed of 243 places in 285 ms of which 3 ms to minimize.
[2024-05-29 18:41:22] [INFO ] Deduced a trap composed of 192 places in 352 ms of which 4 ms to minimize.
[2024-05-29 18:41:23] [INFO ] Deduced a trap composed of 192 places in 293 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 5/710 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 18:41:23] [INFO ] Deduced a trap composed of 189 places in 332 ms of which 3 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :2.52054e+09 after 3.73415e+09
[2024-05-29 18:41:23] [INFO ] Deduced a trap composed of 191 places in 272 ms of which 3 ms to minimize.
[2024-05-29 18:41:24] [INFO ] Deduced a trap composed of 191 places in 351 ms of which 4 ms to minimize.
[2024-05-29 18:41:24] [INFO ] Deduced a trap composed of 190 places in 295 ms of which 3 ms to minimize.
[2024-05-29 18:41:25] [INFO ] Deduced a trap composed of 191 places in 315 ms of which 3 ms to minimize.
[2024-05-29 18:41:25] [INFO ] Deduced a trap composed of 192 places in 318 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 6/716 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 18:41:25] [INFO ] Deduced a trap composed of 206 places in 309 ms of which 3 ms to minimize.
SMT process timed out in 6583ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 581 edges and 699 vertex of which 61 / 699 are part of one of the 10 SCC in 6 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 1221 edges and 648 vertex of which 640 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 640 transition count 845
Reduce places removed 348 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 350 rules applied. Total rules applied 704 place count 292 transition count 843
Reduce places removed 1 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 45 rules applied. Total rules applied 749 place count 291 transition count 799
Reduce places removed 44 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 48 rules applied. Total rules applied 797 place count 247 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 798 place count 246 transition count 795
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 798 place count 246 transition count 776
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 836 place count 227 transition count 776
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 870 place count 193 transition count 742
Iterating global reduction 5 with 34 rules applied. Total rules applied 904 place count 193 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 906 place count 193 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 907 place count 192 transition count 740
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 914 place count 185 transition count 374
Iterating global reduction 7 with 7 rules applied. Total rules applied 921 place count 185 transition count 374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 925 place count 185 transition count 370
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 957 place count 169 transition count 354
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 960 place count 166 transition count 351
Iterating global reduction 8 with 3 rules applied. Total rules applied 963 place count 166 transition count 351
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 981 place count 157 transition count 354
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 988 place count 157 transition count 347
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1012 place count 157 transition count 323
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1036 place count 133 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 1050 place count 133 transition count 309
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1051 place count 133 transition count 309
Applied a total of 1051 rules in 245 ms. Remains 133 /699 variables (removed 566) and now considering 309/1266 (removed 957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 133/699 places, 309/1266 transitions.
RANDOM walk for 40000 steps (1389 resets) in 260 ms. (153 steps per ms) remains 3/6 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (276 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (270 resets) in 140 ms. (283 steps per ms) remains 1/2 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (274 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
// Phase 1: matrix 309 rows 133 cols
[2024-05-29 18:41:26] [INFO ] Computed 6 invariants in 1 ms
[2024-05-29 18:41:26] [INFO ] State equation strengthened by 125 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 309/442 variables, 133/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 125/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 309/442 variables, 133/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 125/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 71 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=71 )
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 9302 ms.

BK_STOP 1717008086672

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyElection-PT-05b, 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 r400-tall-171690532000310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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