Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491100294.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491100294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 50M 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-10a-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749189036384

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-06 05:50:39] [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]
[2025-06-06 05:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 05:50:42] [INFO ] Load time of PNML (sax parser for PT used): 3139 ms
[2025-06-06 05:50:42] [INFO ] Transformed 142 places.
[2025-06-06 05:50:42] [INFO ] Transformed 50162 transitions.
[2025-06-06 05:50:42] [INFO ] Found NUPN structural information;
[2025-06-06 05:50:42] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 3853 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 05:50:45] [INFO ] Flatten gal took : 1172 ms
[2025-06-06 05:50:45] [INFO ] Flatten gal took : 554 ms
[2025-06-06 05:50:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14672249236202154135.gal : 339 ms
[2025-06-06 05:50:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6147363132413715313.prop : 6 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/ReachabilityCardinality14672249236202154135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6147363132413715313.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
RANDOM walk for 40000 steps (11 resets) in 13903 ms. (2 steps per ms) remains 6/13 properties
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 879 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 5/6 properties
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
[2025-06-06 05:50:47] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
// Phase 1: matrix 2208 rows 142 cols
[2025-06-06 05:50:47] [INFO ] Computed 11 invariants in 65 ms
Loading property file /tmp/ReachabilityCardinality6147363132413715313.prop.
[2025-06-06 05:50:48] [INFO ] State equation strengthened by 2095 read => feed constraints.
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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 70/142 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 70/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :17 after 244
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :244 after 2188
At refinement iteration 6 (OVERLAPS) 2207/2349 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2349 variables, 2094/2389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property StigmergyElection-PT-10a-ReachabilityCardinality-2025-15 is true.
At refinement iteration 8 (INCLUDED_ONLY) 0/2349 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/2350 variables, 1/2390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Invariant property StigmergyElection-PT-10a-ReachabilityCardinality-2025-04 does not hold.
Invariant property StigmergyElection-PT-10a-ReachabilityCardinality-2025-03 does not hold.
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :2188 after 60080
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :60080 after 60084
At refinement iteration 10 (INCLUDED_ONLY) 0/2350 variables, 0/2390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2350 variables, 0/2390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 2390 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2713 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 142/142 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem StigmergyElection-PT-10a-ReachabilityCardinality-2025-09 is UNSAT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/142 variables, 10/83 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 70/153 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :60084 after 60118
[2025-06-06 05:50:53] [INFO ] Deduced a trap composed of 12 places in 2099 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:55] [INFO ] Deduced a trap composed of 12 places in 1574 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:56] [INFO ] Deduced a trap composed of 12 places in 1575 ms of which 188 ms to minimize.
SMT process timed out in 8863ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Graph (complete) has 501 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.45 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 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 38 rules applied. Total rules applied 39 place count 138 transition count 2196
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 58 place count 130 transition count 2185
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 65 place count 127 transition count 2181
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 72 place count 123 transition count 2178
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 72 place count 123 transition count 2172
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 84 place count 117 transition count 2172
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 90 place count 111 transition count 2166
Iterating global reduction 4 with 6 rules applied. Total rules applied 96 place count 111 transition count 2166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 110 place count 104 transition count 2159
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 100 transition count 2155
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 100 transition count 2155
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 127 place count 100 transition count 2146
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 100 transition count 2144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 98 transition count 2144
Applied a total of 131 rules in 3348 ms. Remains 98 /142 variables (removed 44) and now considering 2144/2238 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3360 ms. Remains : 98/142 places, 2144/2238 transitions.
RANDOM walk for 40000 steps (10 resets) in 9783 ms. (4 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Invariant property StigmergyElection-PT-10a-ReachabilityCardinality-2025-02 does not hold.
Invariant property StigmergyElection-PT-10a-ReachabilityCardinality-2025-01 does not hold.
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :60118 after 71346
Invariant property StigmergyElection-PT-10a-ReachabilityCardinality-2025-05 does not hold.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :71346 after 71361
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :71361 after 73916
Interrupted probabilistic random walk after 557708 steps, run timeout after 6001 ms. (steps per millisecond=92 ) properties seen :1 out of 4
Probabilistic random walk after 557708 steps, saw 81007 distinct states, run finished after 6007 ms. (steps per millisecond=92 ) properties seen :1
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2144 rows 98 cols
[2025-06-06 05:51:08] [INFO ] Computed 10 invariants in 18 ms
[2025-06-06 05:51:08] [INFO ] State equation strengthened by 2090 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 32/95 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2143/2238 variables, 95/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2238 variables, 1058/1163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2238 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/2242 variables, 3/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2242 variables, 1032/2198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2242 variables, 0/2198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2242 variables, 0/2198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2242/2242 variables, and 2198 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 98/98 constraints, ReadFeed: 2090/2090 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 32/95 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:11] [INFO ] Deduced a trap composed of 5 places in 946 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:12] [INFO ] Deduced a trap composed of 5 places in 1034 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:13] [INFO ] Deduced a trap composed of 6 places in 817 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:14] [INFO ] Deduced a trap composed of 7 places in 827 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:15] [INFO ] Deduced a trap composed of 7 places in 858 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:16] [INFO ] Deduced a trap composed of 8 places in 725 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:16] [INFO ] Deduced a trap composed of 6 places in 740 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:17] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:17] [INFO ] Deduced a trap composed of 6 places in 547 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:18] [INFO ] Deduced a trap composed of 6 places in 739 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:19] [INFO ] Deduced a trap composed of 8 places in 526 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:19] [INFO ] Deduced a trap composed of 8 places in 571 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:20] [INFO ] Deduced a trap composed of 8 places in 587 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:21] [INFO ] Deduced a trap composed of 7 places in 757 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :73916 after 106428
[2025-06-06 05:51:21] [INFO ] Deduced a trap composed of 7 places in 543 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:22] [INFO ] Deduced a trap composed of 9 places in 453 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:22] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:22] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:23] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:23] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:23] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:24] [INFO ] Deduced a trap composed of 8 places in 560 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:24] [INFO ] Deduced a trap composed of 8 places in 433 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:25] [INFO ] Deduced a trap composed of 9 places in 584 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:25] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :106428 after 107196
[2025-06-06 05:51:25] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:26] [INFO ] Deduced a trap composed of 6 places in 516 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:26] [INFO ] Deduced a trap composed of 7 places in 508 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:27] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:27] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:27] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:28] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 6 ms to minimize.
Problem StigmergyElection-PT-10a-ReachabilityCardinality-2025-08 is UNSAT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:28] [INFO ] Deduced a trap composed of 8 places in 657 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 8 places in 533 ms of which 13 ms to minimize.
Problem StigmergyElection-PT-10a-ReachabilityCardinality-2025-11 is UNSAT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 14/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2143/2238 variables, 95/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2238 variables, 1058/1197 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:30] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2238 variables, 1/1198 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2238 variables, 0/1198 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/2242 variables, 3/1201 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2242 variables, 1032/2233 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:31] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 5 ms to minimize.
Problem StigmergyElection-PT-10a-ReachabilityCardinality-2025-07 is UNSAT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 2242/2242 variables, and 2234 constraints, problems are : Problem set: 3 solved, 0 unsolved in 20634 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 98/98 constraints, ReadFeed: 2090/2090 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22540ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 52337 ms.

BK_STOP 1749189091420

--------------------
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
++ 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 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-10a"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-10a, 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 r226-smll-174903491100294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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