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.r536-tall-171690532100346.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 ltsminxred
Input is StigmergyElection-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532100346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 5.3M 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 StigmergyElection-PT-08a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717247851154

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:17:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:17:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:17:32] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2024-06-01 13:17:32] [INFO ] Transformed 114 places.
[2024-06-01 13:17:32] [INFO ] Transformed 6882 transitions.
[2024-06-01 13:17:32] [INFO ] Found NUPN structural information;
[2024-06-01 13:17:32] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 641
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 641
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 92 transition count 627
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 92 transition count 627
Applied a total of 44 rules in 30 ms. Remains 92 /114 variables (removed 22) and now considering 627/664 (removed 37) transitions.
[2024-06-01 13:17:33] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
// Phase 1: matrix 618 rows 92 cols
[2024-06-01 13:17:33] [INFO ] Computed 2 invariants in 25 ms
[2024-06-01 13:17:33] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 13:17:33] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2024-06-01 13:17:33] [INFO ] Invariant cache hit.
[2024-06-01 13:17:33] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-06-01 13:17:33] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 626 sub problems to find dead transitions.
[2024-06-01 13:17:33] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2024-06-01 13:17:33] [INFO ] Invariant cache hit.
[2024-06-01 13:17:33] [INFO ] State equation strengthened by 549 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 8 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 4 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 4 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:17:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:18:04] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:08] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:18:08] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:18:08] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-06-01 13:18:08] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:18:10] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 92/710 variables, and 142 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/92 constraints, ReadFeed: 0/549 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:17] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:18:17] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:18:17] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:21] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-06-01 13:18:28] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-06-01 13:18:28] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 8 (OVERLAPS) 617/709 variables, 92/246 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/709 variables, 548/794 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 709/710 variables, and 1420 constraints, problems are : Problem set: 0 solved, 626 unsolved in 32413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 548/549 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 152/152 constraints]
After SMT, in 69224ms problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 69250ms
Starting structural reductions in LTL mode, iteration 1 : 92/114 places, 627/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70005 ms. Remains : 92/114 places, 627/664 transitions.
Support contains 14 out of 92 places after structural reductions.
[2024-06-01 13:18:43] [INFO ] Flatten gal took : 137 ms
[2024-06-01 13:18:43] [INFO ] Flatten gal took : 71 ms
[2024-06-01 13:18:43] [INFO ] Input system was already deterministic with 627 transitions.
Reduction of identical properties reduced properties to check from 18 to 12
RANDOM walk for 40000 steps (21 resets) in 2356 ms. (16 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
[2024-06-01 13:18:44] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2024-06-01 13:18:44] [INFO ] Invariant cache hit.
[2024-06-01 13:18:44] [INFO ] State equation strengthened by 549 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/92 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 617/709 variables, 92/94 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 548/642 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/642 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/710 variables, 1/643 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/710 variables, 0/643 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/710 variables, 0/643 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 643 constraints, problems are : Problem set: 4 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 549/549 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 91/710 variables, and 1 constraints, problems are : Problem set: 5 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/92 constraints, ReadFeed: 0/549 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 485ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:18:45] [INFO ] Input system was already deterministic with 627 transitions.
Computed a total of 18 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 37 ms
[2024-06-01 13:18:45] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 8 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 37 ms
[2024-06-01 13:18:45] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 8 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:18:45] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 33 ms
[2024-06-01 13:18:45] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 33 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 124 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 33/92 places, 305/627 transitions.
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 28 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:18:46] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:18:46] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 72 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 33/92 places, 305/627 transitions.
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 13:18:47] [INFO ] Input system was already deterministic with 305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 91/92 places, 625/627 transitions.
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 25 ms
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:18:47] [INFO ] Input system was already deterministic with 625 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 65 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 33/92 places, 305/627 transitions.
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 12 ms
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 13:18:47] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:18:47] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:18:47] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 13:18:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 627 transitions and 8592 arcs took 10 ms.
Total runtime 75202 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-00
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-01
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-02
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-04
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-06
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-07
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-08
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-09
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-10
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2024-11
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2023-12
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2023-13
Could not compute solution for formula : StigmergyElection-PT-08a-CTLFireability-2023-15

BK_STOP 1717247927925

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/980/ctl_0_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/980/ctl_1_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/980/ctl_2_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/980/ctl_3_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/980/ctl_4_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/980/ctl_5_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/980/ctl_6_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/980/ctl_7_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/980/ctl_8_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/980/ctl_9_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/980/ctl_10_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/980/ctl_11_
ctl formula name StigmergyElection-PT-08a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/980/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-08a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-08a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532100346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;