Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 7.2K 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 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K 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 38M 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-08b-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749101148308

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 05:25:50] [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 05:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 05:25:54] [INFO ] Load time of PNML (sax parser for PT used): 3184 ms
[2025-06-05 05:25:54] [INFO ] Transformed 2746 places.
[2025-06-05 05:25:54] [INFO ] Transformed 42776 transitions.
[2025-06-05 05:25:54] [INFO ] Found NUPN structural information;
[2025-06-05 05:25:54] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 3880 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 84 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (243 resets) in 6036 ms. (6 steps per ms) remains 9/12 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (28 resets) in 982 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 645 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 1465 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (31 resets) in 1098 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (31 resets) in 664 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 327 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 396 ms. (100 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (28 resets) in 663 ms. (60 steps per ms) remains 8/8 properties
// Phase 1: matrix 42776 rows 2746 cols
[2025-06-05 05:26:01] [INFO ] Computed 10 invariants in 1671 ms
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/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2558/2746 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2746 variables, 2558/2756 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2746 variables, 0/2756 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-05 05:26:04] [INFO ] Flatten gal took : 6605 ms
SMT process timed out in 7488ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 188 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2381 edges and 2746 vertex of which 136 / 2746 are part of one of the 22 SCC in 36 ms
Free SCC test removed 114 places
Drop transitions (Empty/Sink Transition effects.) removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Graph (complete) has 4726 edges and 2632 vertex of which 2614 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.321 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1695 transitions
Trivial Post-agglo rules discarded 1695 transitions
Performed 1695 trivial Post agglomeration. Transition count delta: 1695
Iterating post reduction 0 with 1702 rules applied. Total rules applied 1704 place count 2614 transition count 40919
Reduce places removed 1695 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 1727 rules applied. Total rules applied 3431 place count 919 transition count 40887
Reduce places removed 14 places and 0 transitions.
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Iterating post reduction 2 with 144 rules applied. Total rules applied 3575 place count 905 transition count 40757
[2025-06-05 05:26:09] [INFO ] Flatten gal took : 4710 ms
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 135 rules applied. Total rules applied 3710 place count 775 transition count 40752
Reduce places removed 1 places and 0 transitions.
[2025-06-05 05:26:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2686847641011458259.gal : 1101 ms
[2025-06-05 05:26:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8750925146396441543.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/ReachabilityCardinality2686847641011458259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8750925146396441543.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 ...328
Iterating post reduction 4 with 1 rules applied. Total rules applied 3711 place count 774 transition count 40752
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 3711 place count 774 transition count 40650
Deduced a syphon composed of 102 places in 46 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 3915 place count 672 transition count 40650
Discarding 78 places :
Symmetric choice reduction at 5 with 78 rule applications. Total rules 3993 place count 594 transition count 40572
Iterating global reduction 5 with 78 rules applied. Total rules applied 4071 place count 594 transition count 40572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 4073 place count 594 transition count 40570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4074 place count 593 transition count 40570
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 4102 place count 565 transition count 4277
Iterating global reduction 7 with 28 rules applied. Total rules applied 4130 place count 565 transition count 4277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 4133 place count 565 transition count 4274
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4135 place count 563 transition count 4272
Iterating global reduction 8 with 2 rules applied. Total rules applied 4137 place count 563 transition count 4272
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4139 place count 561 transition count 4270
Iterating global reduction 8 with 2 rules applied. Total rules applied 4141 place count 561 transition count 4270
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 4213 place count 525 transition count 4234
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4222 place count 516 transition count 4225
Iterating global reduction 8 with 9 rules applied. Total rules applied 4231 place count 516 transition count 4225
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4237 place count 510 transition count 4219
Iterating global reduction 8 with 6 rules applied. Total rules applied 4243 place count 510 transition count 4219
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4245 place count 508 transition count 4217
Iterating global reduction 8 with 2 rules applied. Total rules applied 4247 place count 508 transition count 4217
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 4261 place count 501 transition count 4235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 4263 place count 501 transition count 4233
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 4268 place count 501 transition count 4228
Free-agglomeration rule applied 83 times.
Iterating global reduction 9 with 83 rules applied. Total rules applied 4351 place count 501 transition count 4145
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 9 with 83 rules applied. Total rules applied 4434 place count 418 transition count 4145
Drop transitions (Redundant composition of simpler transitions.) removed 510 transitions
Redundant transition composition rules discarded 510 transitions
Iterating global reduction 10 with 510 rules applied. Total rules applied 4944 place count 418 transition count 3635
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 4945 place count 418 transition count 3634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4946 place count 417 transition count 3634
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 4950 place count 417 transition count 3634
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 4953 place count 417 transition count 3631
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 4958 place count 417 transition count 3631
Applied a total of 4958 rules in 17795 ms. Remains 417 /2746 variables (removed 2329) and now considering 3631/42776 (removed 39145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17812 ms. Remains : 417/2746 places, 3631/42776 transitions.
RANDOM walk for 40000 steps (1073 resets) in 1501 ms. (26 steps per ms) remains 6/8 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (106 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (124 resets) in 350 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 432 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (114 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
// Phase 1: matrix 3631 rows 417 cols
[2025-06-05 05:26:25] [INFO ] Computed 8 invariants in 67 ms
[2025-06-05 05:26:26] [INFO ] State equation strengthened by 972 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/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 193/365 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3610/3975 variables, 365/373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3975 variables, 946/1319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3975 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 62/4037 variables, 43/1362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4037 variables, 25/1387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4037 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 10/4047 variables, 8/1395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4047 variables, 1/1396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4047 variables, 0/1396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/4048 variables, 1/1397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4048 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/4048 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4048/4048 variables, and 1397 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7577 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 417/417 constraints, ReadFeed: 972/972 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 193/365 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:36] [INFO ] Deduced a trap composed of 58 places in 2126 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:38] [INFO ] Deduced a trap composed of 43 places in 2174 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:40] [INFO ] Deduced a trap composed of 46 places in 2156 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:42] [INFO ] Deduced a trap composed of 51 places in 2158 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:44] [INFO ] Deduced a trap composed of 47 places in 1985 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:46] [INFO ] Deduced a trap composed of 51 places in 1940 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:48] [INFO ] Deduced a trap composed of 50 places in 2097 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:50] [INFO ] Deduced a trap composed of 52 places in 2070 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:52] [INFO ] Deduced a trap composed of 54 places in 1958 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:54] [INFO ] Deduced a trap composed of 54 places in 1860 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:56] [INFO ] Deduced a trap composed of 52 places in 1915 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:26:58] [INFO ] Deduced a trap composed of 52 places in 1922 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:00] [INFO ] Deduced a trap composed of 59 places in 1903 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality8750925146396441543.prop.
[2025-06-05 05:27:02] [INFO ] Deduced a trap composed of 56 places in 2136 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:04] [INFO ] Deduced a trap composed of 59 places in 1941 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:06] [INFO ] Deduced a trap composed of 58 places in 1897 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:08] [INFO ] Deduced a trap composed of 55 places in 1791 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:10] [INFO ] Deduced a trap composed of 25 places in 1980 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:12] [INFO ] Deduced a trap composed of 61 places in 1795 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:14] [INFO ] Deduced a trap composed of 65 places in 2023 ms of which 55 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:16] [INFO ] Deduced a trap composed of 54 places in 1868 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:18] [INFO ] Deduced a trap composed of 54 places in 1818 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:20] [INFO ] Deduced a trap composed of 63 places in 2079 ms of which 44 ms to minimize.
SMT process timed out in 54861ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 172 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 3631/3631 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 417 transition count 3619
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 405 transition count 3618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 404 transition count 3618
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 404 transition count 3616
Deduced a syphon composed of 2 places in 87 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 402 transition count 3616
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 401 transition count 3615
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 401 transition count 3615
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 400 transition count 3614
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 400 transition count 3614
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 44 place count 395 transition count 3609
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 393 transition count 3607
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 393 transition count 3607
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 391 transition count 3605
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 391 transition count 3605
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 390 transition count 3604
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 390 transition count 3604
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 390 transition count 3596
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 70 place count 382 transition count 3596
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 382 transition count 3595
Applied a total of 71 rules in 2325 ms. Remains 382 /417 variables (removed 35) and now considering 3595/3631 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2325 ms. Remains : 382/417 places, 3595/3631 transitions.
RANDOM walk for 40000 steps (1108 resets) in 792 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (125 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (118 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 108135 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 6
Probabilistic random walk after 108135 steps, saw 22355 distinct states, run finished after 3010 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 3595 rows 382 cols
[2025-06-05 05:27:26] [INFO ] Computed 8 invariants in 72 ms
[2025-06-05 05:27:26] [INFO ] State equation strengthened by 1221 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 164/336 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3580/3916 variables, 336/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3916 variables, 1195/1539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3916 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 56/3972 variables, 41/1580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3972 variables, 26/1606 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3972 variables, 0/1606 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/3977 variables, 5/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3977 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/3977 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3977/3977 variables, and 1611 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6331 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 382/382 constraints, ReadFeed: 1221/1221 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 164/336 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:35] [INFO ] Deduced a trap composed of 51 places in 1825 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:36] [INFO ] Deduced a trap composed of 53 places in 1726 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:38] [INFO ] Deduced a trap composed of 42 places in 1923 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:40] [INFO ] Deduced a trap composed of 48 places in 1702 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:42] [INFO ] Deduced a trap composed of 42 places in 1787 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:44] [INFO ] Deduced a trap composed of 52 places in 1946 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:46] [INFO ] Deduced a trap composed of 44 places in 1812 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:48] [INFO ] Deduced a trap composed of 47 places in 2293 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:50] [INFO ] Deduced a trap composed of 51 places in 2126 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:52] [INFO ] Deduced a trap composed of 54 places in 2075 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:54] [INFO ] Deduced a trap composed of 57 places in 2057 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:56] [INFO ] Deduced a trap composed of 57 places in 1751 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:27:58] [INFO ] Deduced a trap composed of 54 places in 1980 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:00] [INFO ] Deduced a trap composed of 23 places in 1989 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:02] [INFO ] Deduced a trap composed of 57 places in 2025 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:04] [INFO ] Deduced a trap composed of 47 places in 2134 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:07] [INFO ] Deduced a trap composed of 58 places in 2281 ms of which 38 ms to minimize.
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2025-12 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 17/25 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3580/3916 variables, 336/361 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3916 variables, 1195/1556 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:15] [INFO ] Deduced a trap composed of 46 places in 2487 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:17] [INFO ] Deduced a trap composed of 27 places in 2248 ms of which 80 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3916 variables, 2/1558 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3916 variables, 0/1558 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 56/3972 variables, 41/1599 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3972 variables, 26/1625 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3972 variables, 1/1626 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3972 variables, 0/1626 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2025-09 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 5/3977 variables, 5/1631 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:29] [INFO ] Deduced a trap composed of 29 places in 2870 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:32] [INFO ] Deduced a trap composed of 48 places in 2954 ms of which 90 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3977 variables, 2/1633 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3977 variables, 0/1633 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/3977 variables, 0/1633 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3977/3977 variables, and 1633 constraints, problems are : Problem set: 2 solved, 4 unsolved in 62546 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 382/382 constraints, ReadFeed: 1221/1221 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69431ms problems are : Problem set: 2 solved, 4 unsolved
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1456 ms.
Support contains 77 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 3595/3595 transitions.
Graph (trivial) has 193 edges and 382 vertex of which 12 / 382 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 376 transition count 3502
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 92 rules applied. Total rules applied 172 place count 297 transition count 3489
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 180 place count 290 transition count 3488
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 180 place count 290 transition count 3476
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 204 place count 278 transition count 3476
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 215 place count 267 transition count 2602
Iterating global reduction 3 with 11 rules applied. Total rules applied 226 place count 267 transition count 2602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 267 transition count 2601
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 231 place count 263 transition count 2597
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 263 transition count 2597
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 261 transition count 2595
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 261 transition count 2595
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 267 place count 247 transition count 2581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 270 place count 247 transition count 2578
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 281 place count 236 transition count 2567
Iterating global reduction 5 with 11 rules applied. Total rules applied 292 place count 236 transition count 2567
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 300 place count 228 transition count 2559
Iterating global reduction 5 with 8 rules applied. Total rules applied 308 place count 228 transition count 2559
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 319 place count 228 transition count 2548
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 322 place count 225 transition count 2545
Iterating global reduction 6 with 3 rules applied. Total rules applied 325 place count 225 transition count 2545
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 332 place count 225 transition count 2538
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 334 place count 224 transition count 2548
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 356 place count 224 transition count 2526
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 223 transition count 2534
Free-agglomeration rule applied 26 times with reduction of 576 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 384 place count 223 transition count 1932
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 411 place count 197 transition count 1931
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 416 place count 192 transition count 1926
Iterating global reduction 8 with 5 rules applied. Total rules applied 421 place count 192 transition count 1926
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 422 place count 192 transition count 1925
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 425 place count 192 transition count 1925
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 426 place count 192 transition count 1924
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 427 place count 192 transition count 1923
Applied a total of 427 rules in 2625 ms. Remains 192 /382 variables (removed 190) and now considering 1923/3595 (removed 1672) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2626 ms. Remains : 192/382 places, 1923/3595 transitions.
RANDOM walk for 40000 steps (903 resets) in 4516 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (92 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (92 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 248960 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :1 out of 3
Probabilistic random walk after 248960 steps, saw 46972 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :1
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1923 rows 192 cols
[2025-06-05 05:28:44] [INFO ] Computed 10 invariants in 24 ms
[2025-06-05 05:28:44] [INFO ] State equation strengthened by 1548 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 154/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/2115 variables, 192/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2115 variables, 1548/1750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2115 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2115 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2115/2115 variables, and 1750 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2843 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 1548/1548 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 154/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:49] [INFO ] Deduced a trap composed of 23 places in 1333 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:50] [INFO ] Deduced a trap composed of 24 places in 943 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:51] [INFO ] Deduced a trap composed of 20 places in 1265 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:52] [INFO ] Deduced a trap composed of 25 places in 1003 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:53] [INFO ] Deduced a trap composed of 25 places in 1310 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:54] [INFO ] Deduced a trap composed of 25 places in 958 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:55] [INFO ] Deduced a trap composed of 23 places in 1064 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:28:56] [INFO ] Deduced a trap composed of 26 places in 1054 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/192 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1923/2115 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2115 variables, 1548/1758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2115 variables, 1/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2115 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2115 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2115/2115 variables, and 1759 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12768 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 1548/1548 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16167ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 37 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 1923/1923 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 1887
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 76 place count 156 transition count 1883
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 155 transition count 1881
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 153 transition count 1881
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 81 place count 153 transition count 1879
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 151 transition count 1879
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 148 transition count 1876
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 148 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 147 transition count 1875
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 147 transition count 1875
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 107 place count 140 transition count 1868
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 136 transition count 1864
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 136 transition count 1864
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 123 place count 136 transition count 1856
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 127 place count 136 transition count 1852
Free-agglomeration rule applied 14 times with reduction of 288 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 141 place count 136 transition count 1550
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 5 with 112 rules applied. Total rules applied 253 place count 122 transition count 1452
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 6 with 63 rules applied. Total rules applied 316 place count 122 transition count 1389
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 320 place count 122 transition count 1389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 321 place count 122 transition count 1388
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 323 place count 122 transition count 1386
Applied a total of 323 rules in 1914 ms. Remains 122 /192 variables (removed 70) and now considering 1386/1923 (removed 537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1914 ms. Remains : 122/192 places, 1386/1923 transitions.
RANDOM walk for 40000 steps (1097 resets) in 957 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (121 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 380593 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 380593 steps, saw 58789 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :0
// Phase 1: matrix 1386 rows 122 cols
[2025-06-05 05:29:05] [INFO ] Computed 10 invariants in 7 ms
[2025-06-05 05:29:06] [INFO ] State equation strengthened by 1249 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1386/1508 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1508 variables, 1249/1381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1508 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1508 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1508/1508 variables, and 1381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 122/122 constraints, ReadFeed: 1249/1249 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:08] [INFO ] Deduced a trap composed of 12 places in 837 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:09] [INFO ] Deduced a trap composed of 14 places in 710 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:09] [INFO ] Deduced a trap composed of 14 places in 656 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:10] [INFO ] Deduced a trap composed of 14 places in 684 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:11] [INFO ] Deduced a trap composed of 14 places in 709 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:11] [INFO ] Deduced a trap composed of 15 places in 476 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:12] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:13] [INFO ] Deduced a trap composed of 14 places in 592 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:13] [INFO ] Deduced a trap composed of 15 places in 517 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:14] [INFO ] Deduced a trap composed of 14 places in 534 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:14] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:14] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 05:29:15] [INFO ] Deduced a trap composed of 14 places in 520 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1386/1508 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1508 variables, 1249/1394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1508 variables, 1/1395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1508 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1508 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1508/1508 variables, and 1395 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9824 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 122/122 constraints, ReadFeed: 1249/1249 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11580ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 566 steps, including 48 resets, run visited all 2 properties in 30 ms. (steps per millisecond=18 )
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 39 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 206772 ms.

BK_STOP 1749101357720

--------------------
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-08b"
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-08b, 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-174903490700110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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