Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690529800198.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r399-tall-171690529800198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 38M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716994707374

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 14:58:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 14:58:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:58:30] [INFO ] Load time of PNML (sax parser for PT used): 1571 ms
[2024-05-29 14:58:30] [INFO ] Transformed 2746 places.
[2024-05-29 14:58:30] [INFO ] Transformed 42776 transitions.
[2024-05-29 14:58:30] [INFO ] Found NUPN structural information;
[2024-05-29 14:58:30] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 1902 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (242 resets) in 3743 ms. (10 steps per ms) remains 11/13 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 391 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (27 resets) in 301 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (27 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (30 resets) in 915 ms. (43 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (29 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (29 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (29 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
// Phase 1: matrix 42776 rows 2746 cols
[2024-05-29 14:58:34] [INFO ] Computed 10 invariants in 1092 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2599/2727 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2727 variables, 2599/2736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/2736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/2746 variables, 1/2737 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2746 variables, 19/2756 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2746 variables, 0/2756 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 6776ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2469 edges and 2746 vertex of which 147 / 2746 are part of one of the 22 SCC in 16 ms
Free SCC test removed 125 places
Drop transitions (Empty/Sink Transition effects.) removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Graph (complete) has 4713 edges and 2621 vertex of which 2607 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.137 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1791 transitions
Trivial Post-agglo rules discarded 1791 transitions
Performed 1791 trivial Post agglomeration. Transition count delta: 1791
Iterating post reduction 0 with 1798 rules applied. Total rules applied 1800 place count 2607 transition count 40812
Reduce places removed 1791 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 1 with 1822 rules applied. Total rules applied 3622 place count 816 transition count 40781
Reduce places removed 12 places and 0 transitions.
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Iterating post reduction 2 with 124 rules applied. Total rules applied 3746 place count 804 transition count 40669
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 116 rules applied. Total rules applied 3862 place count 692 transition count 40665
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 3862 place count 692 transition count 40563
Deduced a syphon composed of 102 places in 21 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 4066 place count 590 transition count 40563
Discarding 85 places :
Symmetric choice reduction at 4 with 85 rule applications. Total rules 4151 place count 505 transition count 40478
Iterating global reduction 4 with 85 rules applied. Total rules applied 4236 place count 505 transition count 40478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 4239 place count 505 transition count 40475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4240 place count 504 transition count 40475
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4240 place count 504 transition count 40473
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4244 place count 502 transition count 40473
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 4280 place count 466 transition count 2606
Iterating global reduction 6 with 36 rules applied. Total rules applied 4316 place count 466 transition count 2606
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4324 place count 466 transition count 2598
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4328 place count 462 transition count 2594
Iterating global reduction 7 with 4 rules applied. Total rules applied 4332 place count 462 transition count 2594
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4333 place count 461 transition count 2593
Iterating global reduction 7 with 1 rules applied. Total rules applied 4334 place count 461 transition count 2593
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 4412 place count 422 transition count 2554
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4419 place count 415 transition count 2547
Iterating global reduction 7 with 7 rules applied. Total rules applied 4426 place count 415 transition count 2547
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4430 place count 411 transition count 2543
Iterating global reduction 7 with 4 rules applied. Total rules applied 4434 place count 411 transition count 2543
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4437 place count 408 transition count 2540
Iterating global reduction 7 with 3 rules applied. Total rules applied 4440 place count 408 transition count 2540
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 4448 place count 404 transition count 2558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4449 place count 404 transition count 2557
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 4454 place count 404 transition count 2552
Free-agglomeration rule applied 76 times.
Iterating global reduction 8 with 76 rules applied. Total rules applied 4530 place count 404 transition count 2476
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 8 with 76 rules applied. Total rules applied 4606 place count 328 transition count 2476
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 4611 place count 323 transition count 2471
Iterating global reduction 9 with 5 rules applied. Total rules applied 4616 place count 323 transition count 2471
Drop transitions (Redundant composition of simpler transitions.) removed 507 transitions
Redundant transition composition rules discarded 507 transitions
Iterating global reduction 9 with 507 rules applied. Total rules applied 5123 place count 323 transition count 1964
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 5130 place count 323 transition count 1964
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 5133 place count 323 transition count 1961
Applied a total of 5133 rules in 7514 ms. Remains 323 /2746 variables (removed 2423) and now considering 1961/42776 (removed 40815) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7529 ms. Remains : 323/2746 places, 1961/42776 transitions.
RANDOM walk for 40000 steps (607 resets) in 1140 ms. (35 steps per ms) remains 9/11 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (70 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (71 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (67 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (70 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (69 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (72 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
// Phase 1: matrix 1961 rows 323 cols
[2024-05-29 14:58:48] [INFO ] Computed 10 invariants in 17 ms
[2024-05-29 14:58:48] [INFO ] State equation strengthened by 1371 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 204/322 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/323 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1961/2284 variables, 323/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2284 variables, 1371/1704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2284 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/2284 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2284/2284 variables, and 1704 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 323/323 constraints, ReadFeed: 1371/1371 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 204/322 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 14:58:51] [INFO ] Deduced a trap composed of 42 places in 968 ms of which 23 ms to minimize.
[2024-05-29 14:58:52] [INFO ] Deduced a trap composed of 57 places in 1025 ms of which 3 ms to minimize.
[2024-05-29 14:58:53] [INFO ] Deduced a trap composed of 51 places in 848 ms of which 3 ms to minimize.
[2024-05-29 14:58:54] [INFO ] Deduced a trap composed of 37 places in 729 ms of which 5 ms to minimize.
[2024-05-29 14:58:54] [INFO ] Deduced a trap composed of 56 places in 703 ms of which 5 ms to minimize.
[2024-05-29 14:58:55] [INFO ] Deduced a trap composed of 43 places in 663 ms of which 15 ms to minimize.
[2024-05-29 14:58:56] [INFO ] Deduced a trap composed of 45 places in 594 ms of which 1 ms to minimize.
[2024-05-29 14:58:56] [INFO ] Deduced a trap composed of 42 places in 583 ms of which 2 ms to minimize.
[2024-05-29 14:58:57] [INFO ] Deduced a trap composed of 52 places in 604 ms of which 1 ms to minimize.
[2024-05-29 14:58:58] [INFO ] Deduced a trap composed of 45 places in 661 ms of which 2 ms to minimize.
[2024-05-29 14:58:58] [INFO ] Deduced a trap composed of 44 places in 704 ms of which 2 ms to minimize.
[2024-05-29 14:58:59] [INFO ] Deduced a trap composed of 47 places in 653 ms of which 1 ms to minimize.
[2024-05-29 14:59:00] [INFO ] Deduced a trap composed of 47 places in 641 ms of which 2 ms to minimize.
[2024-05-29 14:59:00] [INFO ] Deduced a trap composed of 44 places in 613 ms of which 2 ms to minimize.
[2024-05-29 14:59:01] [INFO ] Deduced a trap composed of 48 places in 598 ms of which 2 ms to minimize.
[2024-05-29 14:59:02] [INFO ] Deduced a trap composed of 56 places in 711 ms of which 1 ms to minimize.
[2024-05-29 14:59:02] [INFO ] Deduced a trap composed of 54 places in 615 ms of which 1 ms to minimize.
[2024-05-29 14:59:03] [INFO ] Deduced a trap composed of 52 places in 646 ms of which 2 ms to minimize.
[2024-05-29 14:59:03] [INFO ] Deduced a trap composed of 60 places in 538 ms of which 2 ms to minimize.
[2024-05-29 14:59:04] [INFO ] Deduced a trap composed of 38 places in 571 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 14:59:05] [INFO ] Deduced a trap composed of 51 places in 688 ms of which 2 ms to minimize.
[2024-05-29 14:59:05] [INFO ] Deduced a trap composed of 40 places in 637 ms of which 2 ms to minimize.
[2024-05-29 14:59:06] [INFO ] Deduced a trap composed of 49 places in 704 ms of which 2 ms to minimize.
[2024-05-29 14:59:07] [INFO ] Deduced a trap composed of 51 places in 577 ms of which 1 ms to minimize.
[2024-05-29 14:59:07] [INFO ] Deduced a trap composed of 53 places in 571 ms of which 2 ms to minimize.
[2024-05-29 14:59:08] [INFO ] Deduced a trap composed of 64 places in 644 ms of which 2 ms to minimize.
[2024-05-29 14:59:09] [INFO ] Deduced a trap composed of 51 places in 684 ms of which 2 ms to minimize.
[2024-05-29 14:59:09] [INFO ] Deduced a trap composed of 59 places in 671 ms of which 1 ms to minimize.
[2024-05-29 14:59:10] [INFO ] Deduced a trap composed of 62 places in 588 ms of which 2 ms to minimize.
[2024-05-29 14:59:11] [INFO ] Deduced a trap composed of 44 places in 610 ms of which 2 ms to minimize.
[2024-05-29 14:59:11] [INFO ] Deduced a trap composed of 74 places in 632 ms of which 2 ms to minimize.
[2024-05-29 14:59:12] [INFO ] Deduced a trap composed of 56 places in 592 ms of which 2 ms to minimize.
[2024-05-29 14:59:12] [INFO ] Deduced a trap composed of 50 places in 524 ms of which 2 ms to minimize.
[2024-05-29 14:59:13] [INFO ] Deduced a trap composed of 60 places in 573 ms of which 2 ms to minimize.
[2024-05-29 14:59:13] [INFO ] Deduced a trap composed of 72 places in 526 ms of which 1 ms to minimize.
[2024-05-29 14:59:14] [INFO ] Deduced a trap composed of 56 places in 530 ms of which 2 ms to minimize.
[2024-05-29 14:59:15] [INFO ] Deduced a trap composed of 48 places in 604 ms of which 2 ms to minimize.
[2024-05-29 14:59:15] [INFO ] Deduced a trap composed of 54 places in 626 ms of which 1 ms to minimize.
[2024-05-29 14:59:16] [INFO ] Deduced a trap composed of 51 places in 588 ms of which 1 ms to minimize.
[2024-05-29 14:59:16] [INFO ] Deduced a trap composed of 56 places in 591 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 14:59:17] [INFO ] Deduced a trap composed of 50 places in 561 ms of which 2 ms to minimize.
[2024-05-29 14:59:18] [INFO ] Deduced a trap composed of 35 places in 504 ms of which 2 ms to minimize.
[2024-05-29 14:59:18] [INFO ] Deduced a trap composed of 54 places in 601 ms of which 1 ms to minimize.
[2024-05-29 14:59:19] [INFO ] Deduced a trap composed of 42 places in 564 ms of which 1 ms to minimize.
[2024-05-29 14:59:19] [INFO ] Deduced a trap composed of 76 places in 567 ms of which 1 ms to minimize.
[2024-05-29 14:59:20] [INFO ] Deduced a trap composed of 63 places in 549 ms of which 2 ms to minimize.
[2024-05-29 14:59:20] [INFO ] Deduced a trap composed of 54 places in 527 ms of which 2 ms to minimize.
[2024-05-29 14:59:21] [INFO ] Deduced a trap composed of 58 places in 532 ms of which 2 ms to minimize.
[2024-05-29 14:59:21] [INFO ] Deduced a trap composed of 58 places in 526 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 14:59:22] [INFO ] Deduced a trap composed of 39 places in 589 ms of which 2 ms to minimize.
[2024-05-29 14:59:23] [INFO ] Deduced a trap composed of 42 places in 554 ms of which 2 ms to minimize.
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 14:59:23] [INFO ] Deduced a trap composed of 33 places in 693 ms of which 2 ms to minimize.
[2024-05-29 14:59:24] [INFO ] Deduced a trap composed of 57 places in 653 ms of which 2 ms to minimize.
[2024-05-29 14:59:25] [INFO ] Deduced a trap composed of 37 places in 625 ms of which 2 ms to minimize.
[2024-05-29 14:59:25] [INFO ] Deduced a trap composed of 52 places in 623 ms of which 1 ms to minimize.
[2024-05-29 14:59:26] [INFO ] Deduced a trap composed of 44 places in 585 ms of which 1 ms to minimize.
[2024-05-29 14:59:27] [INFO ] Deduced a trap composed of 35 places in 595 ms of which 3 ms to minimize.
[2024-05-29 14:59:27] [INFO ] Deduced a trap composed of 44 places in 562 ms of which 2 ms to minimize.
[2024-05-29 14:59:28] [INFO ] Deduced a trap composed of 48 places in 557 ms of which 1 ms to minimize.
[2024-05-29 14:59:28] [INFO ] Deduced a trap composed of 35 places in 517 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2023-04 is UNSAT
Problem StigmergyCommit-PT-08b-ReachabilityCardinality-2023-10 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/69 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 14:59:29] [INFO ] Deduced a trap composed of 40 places in 541 ms of which 1 ms to minimize.
[2024-05-29 14:59:30] [INFO ] Deduced a trap composed of 42 places in 618 ms of which 1 ms to minimize.
[2024-05-29 14:59:30] [INFO ] Deduced a trap composed of 36 places in 588 ms of which 1 ms to minimize.
[2024-05-29 14:59:31] [INFO ] Deduced a trap composed of 52 places in 566 ms of which 2 ms to minimize.
[2024-05-29 14:59:31] [INFO ] Deduced a trap composed of 43 places in 529 ms of which 1 ms to minimize.
[2024-05-29 14:59:32] [INFO ] Deduced a trap composed of 44 places in 492 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 6/75 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 14:59:32] [INFO ] Deduced a trap composed of 60 places in 467 ms of which 1 ms to minimize.
[2024-05-29 14:59:33] [INFO ] Deduced a trap composed of 64 places in 506 ms of which 1 ms to minimize.
[2024-05-29 14:59:33] [INFO ] Deduced a trap composed of 44 places in 541 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 3/78 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 14:59:34] [INFO ] Deduced a trap composed of 43 places in 486 ms of which 1 ms to minimize.
[2024-05-29 14:59:35] [INFO ] Deduced a trap composed of 54 places in 561 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/80 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 14:59:35] [INFO ] Deduced a trap composed of 55 places in 545 ms of which 2 ms to minimize.
SMT process timed out in 47815ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 1961/1961 transitions.
Graph (trivial) has 187 edges and 323 vertex of which 14 / 323 are part of one of the 6 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 1086 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 314 transition count 1868
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 83 rules applied. Total rules applied 163 place count 237 transition count 1862
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 170 place count 236 transition count 1856
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 180 place count 230 transition count 1852
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 180 place count 230 transition count 1842
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 200 place count 220 transition count 1842
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 215 place count 205 transition count 1572
Iterating global reduction 4 with 15 rules applied. Total rules applied 230 place count 205 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 205 transition count 1571
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 237 place count 199 transition count 1565
Iterating global reduction 5 with 6 rules applied. Total rules applied 243 place count 199 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 198 transition count 1564
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 198 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 197 transition count 1563
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 197 transition count 1563
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 279 place count 181 transition count 1547
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 294 place count 181 transition count 1532
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 310 place count 165 transition count 1516
Iterating global reduction 6 with 16 rules applied. Total rules applied 326 place count 165 transition count 1516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 328 place count 165 transition count 1514
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 337 place count 156 transition count 1505
Iterating global reduction 7 with 9 rules applied. Total rules applied 346 place count 156 transition count 1505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 348 place count 156 transition count 1503
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 352 place count 152 transition count 1499
Iterating global reduction 8 with 4 rules applied. Total rules applied 356 place count 152 transition count 1499
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 365 place count 152 transition count 1490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 367 place count 151 transition count 1500
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 379 place count 151 transition count 1488
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 9 with 2 rules applied. Total rules applied 381 place count 150 transition count 1496
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 385 place count 150 transition count 1492
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 408 place count 150 transition count 1469
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 431 place count 127 transition count 1469
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 436 place count 127 transition count 1464
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 439 place count 127 transition count 1464
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 441 place count 127 transition count 1462
Applied a total of 441 rules in 1702 ms. Remains 127 /323 variables (removed 196) and now considering 1462/1961 (removed 499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1703 ms. Remains : 127/323 places, 1462/1961 transitions.
RANDOM walk for 40000 steps (1205 resets) in 828 ms. (48 steps per ms) remains 5/7 properties
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (147 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (147 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (142 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (149 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (140 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
// Phase 1: matrix 1462 rows 127 cols
[2024-05-29 14:59:38] [INFO ] Computed 10 invariants in 7 ms
[2024-05-29 14:59:38] [INFO ] State equation strengthened by 1341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 91/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1462/1589 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1589 variables, 1341/1478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 0/1478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1589 variables, 0/1478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1589/1589 variables, and 1478 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 127/127 constraints, ReadFeed: 1341/1341 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 91/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 14:59:40] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2024-05-29 14:59:40] [INFO ] Deduced a trap composed of 20 places in 451 ms of which 1 ms to minimize.
[2024-05-29 14:59:40] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 1 ms to minimize.
[2024-05-29 14:59:41] [INFO ] Deduced a trap composed of 20 places in 413 ms of which 1 ms to minimize.
[2024-05-29 14:59:41] [INFO ] Deduced a trap composed of 21 places in 372 ms of which 0 ms to minimize.
[2024-05-29 14:59:42] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 1 ms to minimize.
[2024-05-29 14:59:42] [INFO ] Deduced a trap composed of 12 places in 373 ms of which 1 ms to minimize.
[2024-05-29 14:59:42] [INFO ] Deduced a trap composed of 17 places in 344 ms of which 1 ms to minimize.
[2024-05-29 14:59:43] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2024-05-29 14:59:43] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 1 ms to minimize.
[2024-05-29 14:59:43] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2024-05-29 14:59:43] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 0 ms to minimize.
[2024-05-29 14:59:44] [INFO ] Deduced a trap composed of 16 places in 417 ms of which 1 ms to minimize.
[2024-05-29 14:59:44] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 1 ms to minimize.
[2024-05-29 14:59:45] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 1 ms to minimize.
[2024-05-29 14:59:45] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 2 ms to minimize.
[2024-05-29 14:59:46] [INFO ] Deduced a trap composed of 14 places in 382 ms of which 1 ms to minimize.
[2024-05-29 14:59:46] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 1 ms to minimize.
[2024-05-29 14:59:46] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 0 ms to minimize.
[2024-05-29 14:59:47] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1462/1589 variables, 127/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 1341/1498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1589 variables, 5/1503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1589 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1589 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1589/1589 variables, and 1503 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9977 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 127/127 constraints, ReadFeed: 1341/1341 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 20/20 constraints]
After SMT, in 11524ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1575 steps, including 84 resets, run visited all 5 properties in 31 ms. (steps per millisecond=50 )
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 40 ms.
All properties solved without resorting to model-checking.
Total runtime 81020 ms.
ITS solved all properties within timeout

BK_STOP 1716994789636

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r399-tall-171690529800198"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;