Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490800134.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 StigmergyCommit-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-174903490800134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K 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.7K 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 155M 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 StigmergyCommit-PT-10a-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749119810713

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 10:36:53] [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-05 10:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 10:37:01] [INFO ] Load time of PNML (sax parser for PT used): 7665 ms
[2025-06-05 10:37:01] [INFO ] Transformed 400 places.
[2025-06-05 10:37:02] [INFO ] Transformed 136960 transitions.
[2025-06-05 10:37:02] [INFO ] Found NUPN structural information;
[2025-06-05 10:37:02] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 8911 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 10:37:06] [INFO ] Flatten gal took : 1615 ms
[2025-06-05 10:37:06] [INFO ] Flatten gal took : 651 ms
[2025-06-05 10:37:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9717928763622829788.gal : 361 ms
[2025-06-05 10:37:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13094297082691632120.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9717928763622829788.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13094297082691632120.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
Loading property file /tmp/ReachabilityCardinality13094297082691632120.prop.
RANDOM walk for 40000 steps (8 resets) in 25578 ms. (1 steps per ms) remains 9/15 properties
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 553 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 922 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
[2025-06-05 10:37:11] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2025-06-05 10:37:11] [INFO ] Computed 12 invariants in 108 ms
[2025-06-05 10:37:12] [INFO ] State equation strengthened by 4247 read => feed constraints.
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/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 324/399 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 5
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 324/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :17 after 133
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :133 after 161
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/400 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :161 after 457
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :457 after 1057
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1057 after 33615
At refinement iteration 8 (OVERLAPS) 4581/4981 variables, 400/812 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4981 variables, 4246/5058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4981/4982 variables, and 5058 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5138 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 400/400 constraints, ReadFeed: 4246/4247 constraints, PredecessorRefiner: 9/6 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 324/399 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 324/410 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 10:37:23] [INFO ] Deduced a trap composed of 16 places in 5157 ms of which 1392 ms to minimize.
SMT process timed out in 12366ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 75 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Graph (complete) has 993 edges and 400 vertex of which 389 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.59 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 389 transition count 4538
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 60 rules applied. Total rules applied 127 place count 354 transition count 4513
Reduce places removed 4 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 21 rules applied. Total rules applied 148 place count 350 transition count 4496
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 174 place count 333 transition count 4487
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 174 place count 333 transition count 4433
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 282 place count 279 transition count 4433
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 318 place count 243 transition count 4397
Iterating global reduction 4 with 36 rules applied. Total rules applied 354 place count 243 transition count 4397
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 380 place count 217 transition count 4371
Iterating global reduction 4 with 26 rules applied. Total rules applied 406 place count 217 transition count 4371
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 411 place count 217 transition count 4366
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 413 place count 215 transition count 4364
Iterating global reduction 5 with 2 rules applied. Total rules applied 415 place count 215 transition count 4364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 416 place count 214 transition count 4363
Iterating global reduction 5 with 1 rules applied. Total rules applied 417 place count 214 transition count 4363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 418 place count 214 transition count 4362
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 442 place count 202 transition count 4350
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 444 place count 202 transition count 4348
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 454 place count 192 transition count 4338
Iterating global reduction 7 with 10 rules applied. Total rules applied 464 place count 192 transition count 4338
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 468 place count 188 transition count 4334
Iterating global reduction 7 with 4 rules applied. Total rules applied 472 place count 188 transition count 4334
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 473 place count 187 transition count 4333
Iterating global reduction 7 with 1 rules applied. Total rules applied 474 place count 187 transition count 4333
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 492 place count 187 transition count 4315
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 506 place count 187 transition count 4301
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 520 place count 173 transition count 4301
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 521 place count 173 transition count 4300
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 529 place count 173 transition count 4300
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 536 place count 173 transition count 4293
Applied a total of 536 rules in 18881 ms. Remains 173 /400 variables (removed 227) and now considering 4293/4615 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18901 ms. Remains : 173/400 places, 4293/4615 transitions.
RANDOM walk for 40000 steps (8 resets) in 31191 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1510880 steps, run timeout after 24001 ms. (steps per millisecond=62 ) properties seen :5 out of 9
Probabilistic random walk after 1510880 steps, saw 205080 distinct states, run finished after 24016 ms. (steps per millisecond=62 ) properties seen :5
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 4293 rows 173 cols
[2025-06-05 10:38:15] [INFO ] Computed 9 invariants in 30 ms
[2025-06-05 10:38:15] [INFO ] State equation strengthened by 4197 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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/137 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4252/4390 variables, 138/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4390 variables, 590/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4390 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 51/4441 variables, 20/757 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4441 variables, 3602/4359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4441 variables, 0/4359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/4461 variables, 11/4370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4461 variables, 4/4374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4461 variables, 0/4374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/4466 variables, 4/4378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4466 variables, 1/4379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4466 variables, 0/4379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/4466 variables, 0/4379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4466/4466 variables, and 4379 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4945 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 173/173 constraints, ReadFeed: 4197/4197 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/137 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:22] [INFO ] Deduced a trap composed of 8 places in 1691 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:24] [INFO ] Deduced a trap composed of 8 places in 1960 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:26] [INFO ] Deduced a trap composed of 8 places in 1858 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:28] [INFO ] Deduced a trap composed of 8 places in 1740 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:29] [INFO ] Deduced a trap composed of 8 places in 1612 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:31] [INFO ] Deduced a trap composed of 8 places in 1819 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:32] [INFO ] Deduced a trap composed of 8 places in 1353 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:34] [INFO ] Deduced a trap composed of 8 places in 1463 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:36] [INFO ] Deduced a trap composed of 8 places in 1555 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:37] [INFO ] Deduced a trap composed of 8 places in 1311 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:38] [INFO ] Deduced a trap composed of 8 places in 1391 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:40] [INFO ] Deduced a trap composed of 8 places in 1688 ms of which 34 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2025-01 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:42] [INFO ] Deduced a trap composed of 9 places in 1563 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:44] [INFO ] Deduced a trap composed of 10 places in 1994 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:45] [INFO ] Deduced a trap composed of 10 places in 1762 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:47] [INFO ] Deduced a trap composed of 10 places in 1418 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:48] [INFO ] Deduced a trap composed of 11 places in 1632 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:50] [INFO ] Deduced a trap composed of 10 places in 1598 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:51] [INFO ] Deduced a trap composed of 11 places in 1316 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:53] [INFO ] Deduced a trap composed of 11 places in 1476 ms of which 25 ms to minimize.
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2025-01 is UNSAT
Problem StigmergyCommit-PT-10a-ReachabilityCardinality-2025-11 is UNSAT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:54] [INFO ] Deduced a trap composed of 11 places in 1120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:55] [INFO ] Deduced a trap composed of 11 places in 782 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:55] [INFO ] Deduced a trap composed of 11 places in 720 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:56] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:38:57] [INFO ] Deduced a trap composed of 12 places in 984 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 5/33 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/138 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4252/4390 variables, 138/172 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4390 variables, 590/762 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:39:01] [INFO ] Deduced a trap composed of 9 places in 1390 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/4390 variables, 1/763 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4390 variables, 0/763 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/4441 variables, 20/783 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4441 variables, 3602/4385 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4441 variables, 1/4386 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:39:04] [INFO ] Deduced a trap composed of 11 places in 1050 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:39:05] [INFO ] Deduced a trap composed of 11 places in 791 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:39:06] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 6 ms to minimize.
SMT process timed out in 51022ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 27 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 4293/4293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 173 transition count 4278
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 160 transition count 4276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 160 transition count 4267
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 151 transition count 4267
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 141 transition count 4257
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 141 transition count 4257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 141 transition count 4256
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 76 place count 134 transition count 4249
Iterating global reduction 3 with 7 rules applied. Total rules applied 83 place count 134 transition count 4249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 134 transition count 4248
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 132 transition count 4246
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 132 transition count 4246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 132 transition count 4245
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 131 transition count 4244
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 131 transition count 4244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 131 transition count 4243
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 124 place count 115 transition count 4227
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 125 place count 115 transition count 4226
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 137 place count 103 transition count 4214
Iterating global reduction 7 with 12 rules applied. Total rules applied 149 place count 103 transition count 4214
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 163 place count 103 transition count 4200
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 166 place count 100 transition count 4197
Iterating global reduction 8 with 3 rules applied. Total rules applied 169 place count 100 transition count 4197
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 173 place count 100 transition count 4193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 175 place count 99 transition count 4192
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 176 place count 99 transition count 4191
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 177 place count 99 transition count 4190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 178 place count 98 transition count 4190
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 181 place count 98 transition count 4190
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 183 place count 98 transition count 4188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 184 place count 97 transition count 4187
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 10 with 5 rules applied. Total rules applied 189 place count 96 transition count 4183
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 5 rules applied. Total rules applied 194 place count 92 transition count 4182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 195 place count 91 transition count 4182
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 4 Pre rules applied. Total rules applied 195 place count 91 transition count 4178
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 203 place count 87 transition count 4178
Performed 25 Post agglomeration using F-continuation condition with reduction of 3827 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 13 with 50 rules applied. Total rules applied 253 place count 62 transition count 326
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 230 transitions.
Iterating post reduction 13 with 230 rules applied. Total rules applied 483 place count 62 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 485 place count 61 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 486 place count 61 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 507 place count 61 transition count 73
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 508 place count 61 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 509 place count 61 transition count 72
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 513 place count 57 transition count 68
Applied a total of 513 rules in 14686 ms. Remains 57 /173 variables (removed 116) and now considering 68/4293 (removed 4225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14686 ms. Remains : 57/173 places, 68/4293 transitions.
RANDOM walk for 40000 steps (222 resets) in 441 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (36 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Probably explored full state space saw : 1329 states, properties seen :0
Probabilistic random walk after 6630 steps, saw 1329 distinct states, run finished after 51 ms. (steps per millisecond=130 ) properties seen :0
Explored full state space saw : 1329 states, properties seen :0
Exhaustive walk after 6630 steps, saw 1329 distinct states, run finished after 30 ms. (steps per millisecond=221 ) properties seen :0
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_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 148233 ms.

BK_STOP 1749119961669

--------------------
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="StigmergyCommit-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 StigmergyCommit-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-174903490800134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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