Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000239.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-00
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-01
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-02
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-03
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-04
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-05
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-06
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-07
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-08
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-09
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-10
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-11
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-12
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-13
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-14
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749153739973

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 20:02:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:02:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:02:23] [INFO ] Load time of PNML (sax parser for PT used): 578 ms
[2025-06-05 20:02:23] [INFO ] Transformed 835 places.
[2025-06-05 20:02:23] [INFO ] Transformed 2416 transitions.
[2025-06-05 20:02:23] [INFO ] Found NUPN structural information;
[2025-06-05 20:02:23] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 871 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (377 resets) in 2762 ms. (14 steps per ms) remains 14/16 properties
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (59 resets) in 464 ms. (86 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 1383 ms. (28 steps per ms) remains 14/14 properties
[2025-06-05 20:02:25] [INFO ] Flatten gal took : 1081 ms
BEST_FIRST walk for 40004 steps (58 resets) in 2617 ms. (15 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (59 resets) in 342 ms. (116 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (57 resets) in 1076 ms. (37 steps per ms) remains 14/14 properties
[2025-06-05 20:02:26] [INFO ] Flatten gal took : 478 ms
BEST_FIRST walk for 40004 steps (60 resets) in 476 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (59 resets) in 195 ms. (204 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (59 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (57 resets) in 318 ms. (125 steps per ms) remains 14/14 properties
[2025-06-05 20:02:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15600769147641538256.gal : 319 ms
[2025-06-05 20:02:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5574800901102876190.prop : 17 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15600769147641538256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5574800901102876190.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (59 resets) in 655 ms. (60 steps per ms) remains 14/14 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (60 resets) in 290 ms. (137 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (57 resets) in 324 ms. (123 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 550 ms. (72 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (59 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
// Phase 1: matrix 2416 rows 835 cols
[2025-06-05 20:02:27] [INFO ] Computed 7 invariants in 78 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality5574800901102876190.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyElection-PT-06b-ReachabilityFireability-2025-02 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-06b-ReachabilityFireability-2025-11 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-06b-ReachabilityFireability-2025-13 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 687/835 variables, 7/155 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 687/842 constraints. Problems are: Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :13 after 17
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :17 after 32
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :32 after 160
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :160 after 2265
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :2265 after 4616
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/842 constraints. Problems are: Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :4616 after 4806
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :4806 after 12487
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :12487 after 99812
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :99812 after 8.78753e+06
At refinement iteration 5 (OVERLAPS) 2416/3251 variables, 835/1677 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3251/3251 variables, and 1677 constraints, problems are : Problem set: 3 solved, 11 unsolved in 5061 ms.
Refiners :[Domain max(s): 835/835 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 835/835 constraints, PredecessorRefiner: 14/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem StigmergyElection-PT-06b-ReachabilityFireability-2025-14 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 714/835 variables, 7/128 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 714/842 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:02:35] [INFO ] Deduced a trap composed of 191 places in 1001 ms of which 75 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 1/843 constraints. Problems are: Problem set: 4 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :8.78753e+06 after 1.44786e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 0/843 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2416/3251 variables, 835/1678 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3251 variables, 2/1680 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3251/3251 variables, and 1680 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5011 ms.
Refiners :[Domain max(s): 835/835 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 835/835 constraints, PredecessorRefiner: 11/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10399ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 111 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Graph (trivial) has 595 edges and 835 vertex of which 85 / 835 are part of one of the 14 SCC in 6 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 1580 edges and 764 vertex of which 753 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.30 ms
Discarding 11 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 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 332 rules applied. Total rules applied 334 place count 753 transition count 1988
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 337 rules applied. Total rules applied 671 place count 426 transition count 1978
Reduce places removed 5 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 2 with 78 rules applied. Total rules applied 749 place count 421 transition count 1905
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 75 rules applied. Total rules applied 824 place count 348 transition count 1903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 825 place count 347 transition count 1903
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 825 place count 347 transition count 1872
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 887 place count 316 transition count 1872
Discarding 60 places :
Symmetric choice reduction at 5 with 60 rule applications. Total rules 947 place count 256 transition count 1812
Iterating global reduction 5 with 60 rules applied. Total rules applied 1007 place count 256 transition count 1812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1010 place count 256 transition count 1809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1010 place count 256 transition count 1808
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1012 place count 255 transition count 1808
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1015 place count 252 transition count 1805
Iterating global reduction 6 with 3 rules applied. Total rules applied 1018 place count 252 transition count 1805
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1054 place count 234 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1055 place count 233 transition count 1786
Iterating global reduction 6 with 1 rules applied. Total rules applied 1056 place count 233 transition count 1786
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1072 place count 225 transition count 1785
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1079 place count 225 transition count 1778
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1082 place count 225 transition count 1775
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1085 place count 222 transition count 1775
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1089 place count 222 transition count 1775
Applied a total of 1089 rules in 667 ms. Remains 222 /835 variables (removed 613) and now considering 1775/2416 (removed 641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 222/835 places, 1775/2416 transitions.
RANDOM walk for 40000 steps (1507 resets) in 873 ms. (45 steps per ms) remains 9/10 properties
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (231 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (292 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (234 resets) in 1035 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (228 resets) in 303 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (234 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (231 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (233 resets) in 223 ms. (178 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (228 resets) in 284 ms. (140 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (231 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
// Phase 1: matrix 1775 rows 222 cols
[2025-06-05 20:02:39] [INFO ] Computed 6 invariants in 57 ms
[2025-06-05 20:02:39] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 105/194 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1760/1954 variables, 194/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1954 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1954 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 29/1983 variables, 19/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1983 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1983 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 10/1993 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1993 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 4/1997 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1997 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1997 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1997 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1997/1997 variables, and 239 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 222/222 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 9/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 105/194 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:02:45] [INFO ] Deduced a trap composed of 46 places in 1045 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :1.44786e+08 after 4.93525e+09
[2025-06-05 20:02:46] [INFO ] Deduced a trap composed of 50 places in 902 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1760/1954 variables, 194/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1954 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1954 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1954 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 29/1983 variables, 19/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1983 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1983 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/1993 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1993 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 4/1997 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1997 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1997 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/1997 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1997/1997 variables, and 243 constraints, problems are : Problem set: 0 solved, 9 unsolved in 9393 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 222/222 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 9/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13744ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 856 ms.
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 1775/1775 transitions.
Graph (trivial) has 203 edges and 222 vertex of which 15 / 222 are part of one of the 5 SCC in 6 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 836 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 211 transition count 1662
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 192 place count 117 transition count 1661
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 192 place count 117 transition count 1650
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 214 place count 106 transition count 1650
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 234 place count 86 transition count 359
Iterating global reduction 2 with 20 rules applied. Total rules applied 254 place count 86 transition count 359
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 265 place count 86 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 265 place count 86 transition count 346
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 84 transition count 346
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 271 place count 82 transition count 282
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 82 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 275 place count 82 transition count 280
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 297 place count 71 transition count 268
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 302 place count 71 transition count 263
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 311 place count 62 transition count 254
Iterating global reduction 5 with 9 rules applied. Total rules applied 320 place count 62 transition count 254
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
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 328 place count 58 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 329 place count 58 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 338 place count 58 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 340 place count 57 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 348 place count 57 transition count 250
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 379 place count 57 transition count 219
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 427 place count 26 transition count 202
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 433 place count 20 transition count 196
Iterating global reduction 7 with 6 rules applied. Total rules applied 439 place count 20 transition count 196
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 7 with 63 rules applied. Total rules applied 502 place count 20 transition count 133
Applied a total of 502 rules in 185 ms. Remains 20 /222 variables (removed 202) and now considering 133/1775 (removed 1642) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 20/222 places, 133/1775 transitions.
RANDOM walk for 218 steps (0 resets) in 7 ms. (27 steps per ms) remains 0/2 properties
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 31834 ms.

BK_STOP 1749153774496

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-06b"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903491000239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-06b.tgz
mv StigmergyElection-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;