Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532200369.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 itstools
Input is StigmergyElection-PT-09b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.1K 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 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 18:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 11 18:49 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 37M 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-09b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-09b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717014528226

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 20:28:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:28:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:28:50] [INFO ] Load time of PNML (sax parser for PT used): 1518 ms
[2024-05-29 20:28:51] [INFO ] Transformed 1243 places.
[2024-05-29 20:28:51] [INFO ] Transformed 41210 transitions.
[2024-05-29 20:28:51] [INFO ] Found NUPN structural information;
[2024-05-29 20:28:51] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 1962 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA StigmergyElection-PT-09b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 138 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Discarding 131 places :
Symmetric choice reduction at 0 with 131 rule applications. Total rules 131 place count 1112 transition count 41079
Iterating global reduction 0 with 131 rules applied. Total rules applied 262 place count 1112 transition count 41079
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 322 place count 1052 transition count 41019
Iterating global reduction 0 with 60 rules applied. Total rules applied 382 place count 1052 transition count 41019
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 393 place count 1041 transition count 41008
Iterating global reduction 0 with 11 rules applied. Total rules applied 404 place count 1041 transition count 41008
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 407 place count 1038 transition count 41005
Iterating global reduction 0 with 3 rules applied. Total rules applied 410 place count 1038 transition count 41005
Applied a total of 410 rules in 2007 ms. Remains 1038 /1243 variables (removed 205) and now considering 41005/41210 (removed 205) transitions.
// Phase 1: matrix 41005 rows 1038 cols
[2024-05-29 20:28:54] [INFO ] Computed 10 invariants in 840 ms
[2024-05-29 20:29:06] [INFO ] Implicit Places using invariants in 12823 ms returned []
Implicit Place search using SMT only with invariants took 12865 ms to find 0 implicit places.
Running 41004 sub problems to find dead transitions.
[2024-05-29 20:29:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1037/42043 variables, and 0 constraints, problems are : Problem set: 0 solved, 41004 unsolved in 30623 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1038 constraints, PredecessorRefiner: 41004/1579 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41004 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1037/42043 variables, and 0 constraints, problems are : Problem set: 0 solved, 41004 unsolved in 30364 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1038 constraints, PredecessorRefiner: 39425/1579 constraints, Known Traps: 0/0 constraints]
After SMT, in 742168ms problems are : Problem set: 0 solved, 41004 unsolved
Search for dead transitions found 0 dead transitions in 742683ms
Starting structural reductions in LTL mode, iteration 1 : 1038/1243 places, 41005/41210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 757741 ms. Remains : 1038/1243 places, 41005/41210 transitions.
Support contains 138 out of 1038 places after structural reductions.
[2024-05-29 20:41:34] [INFO ] Flatten gal took : 4009 ms
[2024-05-29 20:41:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-09b-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 20:41:37] [INFO ] Flatten gal took : 3709 ms
[2024-05-29 20:41:45] [INFO ] Input system was already deterministic with 41005 transitions.
Support contains 119 out of 1038 places (down from 138) after GAL structural reductions.
RANDOM walk for 40000 steps (257 resets) in 3232 ms. (12 steps per ms) remains 23/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
[2024-05-29 20:41:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 872/912 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 126/1038 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
SMT process timed out in 5450ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 41005/41005 transitions.
Graph (trivial) has 987 edges and 1038 vertex of which 124 / 1038 are part of one of the 22 SCC in 14 ms
Free SCC test removed 102 places
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 2749 edges and 936 vertex of which 928 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.156 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 601 rules applied. Total rules applied 603 place count 928 transition count 40267
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 614 rules applied. Total rules applied 1217 place count 334 transition count 40247
Reduce places removed 11 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 28 rules applied. Total rules applied 1245 place count 323 transition count 40230
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 1262 place count 306 transition count 40230
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1262 place count 306 transition count 40194
Deduced a syphon composed of 36 places in 20 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1334 place count 270 transition count 40194
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1343 place count 261 transition count 40185
Iterating global reduction 4 with 9 rules applied. Total rules applied 1352 place count 261 transition count 40185
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1352 place count 261 transition count 40180
Deduced a syphon composed of 5 places in 21 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1362 place count 256 transition count 40180
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1367 place count 251 transition count 29242
Iterating global reduction 4 with 5 rules applied. Total rules applied 1372 place count 251 transition count 29242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1373 place count 251 transition count 29241
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 13 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1457 place count 209 transition count 29198
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1464 place count 209 transition count 29191
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1488 place count 185 transition count 2269
Iterating global reduction 6 with 24 rules applied. Total rules applied 1512 place count 185 transition count 2269
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1525 place count 185 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1526 place count 184 transition count 2255
Iterating global reduction 7 with 1 rules applied. Total rules applied 1527 place count 184 transition count 2255
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1553 place count 171 transition count 2242
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 7 with 16 rules applied. Total rules applied 1569 place count 163 transition count 2250
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1572 place count 163 transition count 2247
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1586 place count 163 transition count 2233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1588 place count 162 transition count 2239
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1596 place count 162 transition count 2231
Free-agglomeration rule applied 49 times.
Iterating global reduction 8 with 49 rules applied. Total rules applied 1645 place count 162 transition count 2182
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 8 with 49 rules applied. Total rules applied 1694 place count 113 transition count 2182
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1698 place count 109 transition count 2178
Iterating global reduction 9 with 4 rules applied. Total rules applied 1702 place count 109 transition count 2178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1704 place count 109 transition count 2176
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1710 place count 109 transition count 2170
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 1713 place count 109 transition count 2170
Applied a total of 1713 rules in 11747 ms. Remains 109 /1038 variables (removed 929) and now considering 2170/41005 (removed 38835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11747 ms. Remains : 109/1038 places, 2170/41005 transitions.
RANDOM walk for 40000 steps (1559 resets) in 2061 ms. (19 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40004 steps (215 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (211 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (216 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (215 resets) in 91 ms. (434 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (217 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (210 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (238 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
// Phase 1: matrix 2170 rows 109 cols
[2024-05-29 20:42:04] [INFO ] Computed 10 invariants in 8 ms
[2024-05-29 20:42:05] [INFO ] State equation strengthened by 2045 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 59/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/109 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2170/2279 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2279 variables, 2045/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2279 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2279 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2279/2279 variables, and 2164 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, ReadFeed: 2045/2045 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 59/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:07] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 6 ms to minimize.
[2024-05-29 20:42:07] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 2 ms to minimize.
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 1 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 0 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 0 ms to minimize.
[2024-05-29 20:42:10] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 40/109 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:10] [INFO ] Deduced a trap composed of 16 places in 362 ms of which 2 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 16 places in 355 ms of which 1 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 1 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 0 ms to minimize.
[2024-05-29 20:42:12] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 0 ms to minimize.
[2024-05-29 20:42:12] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 1 ms to minimize.
[2024-05-29 20:42:12] [INFO ] Deduced a trap composed of 17 places in 367 ms of which 0 ms to minimize.
[2024-05-29 20:42:13] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 0 ms to minimize.
[2024-05-29 20:42:13] [INFO ] Deduced a trap composed of 18 places in 339 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2170/2279 variables, 109/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2279 variables, 2045/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2279 variables, 6/2192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 18 places in 591 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 1 ms to minimize.
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 1 ms to minimize.
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 21 places in 430 ms of which 1 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2279 variables, 5/2197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 16 places in 630 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 16 places in 513 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 12 places in 471 ms of which 1 ms to minimize.
[2024-05-29 20:42:21] [INFO ] Deduced a trap composed of 19 places in 528 ms of which 0 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 1 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 29 places in 470 ms of which 1 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 24 places in 399 ms of which 2 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 21 places in 361 ms of which 2 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2279 variables, 9/2206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 0 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 1 ms to minimize.
[2024-05-29 20:42:26] [INFO ] Deduced a trap composed of 15 places in 365 ms of which 1 ms to minimize.
[2024-05-29 20:42:26] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2279 variables, 4/2210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2279 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2279 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2279/2279 variables, and 2210 constraints, problems are : Problem set: 0 solved, 6 unsolved in 21596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, ReadFeed: 2045/2045 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 40/40 constraints]
After SMT, in 23879ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 1263 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 2170/2170 transitions.
Graph (trivial) has 71 edges and 109 vertex of which 14 / 109 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 520 edges and 101 vertex of which 100 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 100 transition count 2130
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 75 transition count 2128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 74 transition count 2128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 56 place count 74 transition count 2126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 72 transition count 2126
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 67 place count 65 transition count 2119
Iterating global reduction 3 with 7 rules applied. Total rules applied 74 place count 65 transition count 2119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 64 transition count 2117
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 64 transition count 2117
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 98 place count 53 transition count 2106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 104 place count 53 transition count 2100
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 115 place count 42 transition count 2089
Iterating global reduction 4 with 11 rules applied. Total rules applied 126 place count 42 transition count 2089
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 156 place count 42 transition count 2059
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 41 transition count 2061
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 200 place count 41 transition count 2019
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 207 place count 41 transition count 2012
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 368 place count 34 transition count 1858
Drop transitions (Redundant composition of simpler transitions.) removed 287 transitions
Redundant transition composition rules discarded 287 transitions
Iterating global reduction 6 with 287 rules applied. Total rules applied 655 place count 34 transition count 1571
Applied a total of 655 rules in 1647 ms. Remains 34 /109 variables (removed 75) and now considering 1571/2170 (removed 599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1647 ms. Remains : 34/109 places, 1571/2170 transitions.
RANDOM walk for 19180 steps (4 resets) in 269 ms. (71 steps per ms) remains 0/2 properties
[2024-05-29 20:42:35] [INFO ] Flatten gal took : 3412 ms
[2024-05-29 20:42:39] [INFO ] Flatten gal took : 3608 ms
[2024-05-29 20:42:45] [INFO ] Input system was already deterministic with 41005 transitions.
Computed a total of 143 stabilizing places and 152 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1038/1038 places, 41005/41005 transitions.
Graph (trivial) has 1058 edges and 1038 vertex of which 158 / 1038 are part of one of the 27 SCC in 2 ms
Free SCC test removed 131 places
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 632 transitions
Trivial Post-agglo rules discarded 632 transitions
Performed 632 trivial Post agglomeration. Transition count delta: 632
Iterating post reduction 0 with 632 rules applied. Total rules applied 633 place count 906 transition count 40223
Reduce places removed 632 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 650 rules applied. Total rules applied 1283 place count 274 transition count 40205
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 1294 place count 265 transition count 40203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1296 place count 263 transition count 40203
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1296 place count 263 transition count 40174
Deduced a syphon composed of 29 places in 29 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1354 place count 234 transition count 40174
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1374 place count 214 transition count 40152
Iterating global reduction 4 with 20 rules applied. Total rules applied 1394 place count 214 transition count 40152
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 1 rules applied. Total rules applied 1395 place count 214 transition count 40151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1396 place count 213 transition count 40151
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1396 place count 213 transition count 40146
Deduced a syphon composed of 5 places in 30 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1406 place count 208 transition count 40146
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1414 place count 200 transition count 29203
Iterating global reduction 6 with 8 rules applied. Total rules applied 1422 place count 200 transition count 29203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1424 place count 200 transition count 29201
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1426 place count 198 transition count 29197
Iterating global reduction 7 with 2 rules applied. Total rules applied 1428 place count 198 transition count 29197
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 15 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 1494 place count 165 transition count 29164
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1523 place count 136 transition count 1992
Iterating global reduction 7 with 29 rules applied. Total rules applied 1552 place count 136 transition count 1992
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1567 place count 136 transition count 1977
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1574 place count 129 transition count 1963
Iterating global reduction 8 with 7 rules applied. Total rules applied 1581 place count 129 transition count 1963
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1588 place count 122 transition count 1949
Iterating global reduction 8 with 7 rules applied. Total rules applied 1595 place count 122 transition count 1949
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1597 place count 121 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1598 place count 120 transition count 1939
Iterating global reduction 8 with 1 rules applied. Total rules applied 1599 place count 120 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1600 place count 120 transition count 1938
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1609 place count 120 transition count 1929
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1627 place count 111 transition count 1920
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1628 place count 110 transition count 1919
Applied a total of 1628 rules in 9321 ms. Remains 110 /1038 variables (removed 928) and now considering 1919/41005 (removed 39086) transitions.
[2024-05-29 20:42:55] [INFO ] Flow matrix only has 1909 transitions (discarded 10 similar events)
// Phase 1: matrix 1909 rows 110 cols
[2024-05-29 20:42:55] [INFO ] Computed 2 invariants in 36 ms
[2024-05-29 20:42:56] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-05-29 20:42:56] [INFO ] Flow matrix only has 1909 transitions (discarded 10 similar events)
[2024-05-29 20:42:56] [INFO ] Invariant cache hit.
[2024-05-29 20:42:57] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 20:42:59] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3475 ms to find 0 implicit places.
[2024-05-29 20:42:59] [INFO ] Redundant transitions in 133 ms returned []
Running 1905 sub problems to find dead transitions.
[2024-05-29 20:42:59] [INFO ] Flow matrix only has 1909 transitions (discarded 10 similar events)
[2024-05-29 20:42:59] [INFO ] Invariant cache hit.
[2024-05-29 20:42:59] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
At refinement iteration 2 (OVERLAPS) 7/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
[2024-05-29 20:43:42] [INFO ] Deduced a trap composed of 18 places in 659 ms of which 6 ms to minimize.
[2024-05-29 20:43:43] [INFO ] Deduced a trap composed of 20 places in 703 ms of which 2 ms to minimize.
[2024-05-29 20:43:43] [INFO ] Deduced a trap composed of 19 places in 661 ms of which 1 ms to minimize.
[2024-05-29 20:43:44] [INFO ] Deduced a trap composed of 18 places in 651 ms of which 0 ms to minimize.
[2024-05-29 20:43:45] [INFO ] Deduced a trap composed of 21 places in 572 ms of which 1 ms to minimize.
[2024-05-29 20:43:45] [INFO ] Deduced a trap composed of 12 places in 582 ms of which 1 ms to minimize.
[2024-05-29 20:43:46] [INFO ] Deduced a trap composed of 18 places in 596 ms of which 1 ms to minimize.
[2024-05-29 20:43:47] [INFO ] Deduced a trap composed of 19 places in 626 ms of which 1 ms to minimize.
[2024-05-29 20:43:47] [INFO ] Deduced a trap composed of 19 places in 586 ms of which 1 ms to minimize.
[2024-05-29 20:43:48] [INFO ] Deduced a trap composed of 12 places in 638 ms of which 1 ms to minimize.
[2024-05-29 20:43:48] [INFO ] Deduced a trap composed of 19 places in 578 ms of which 1 ms to minimize.
[2024-05-29 20:43:49] [INFO ] Deduced a trap composed of 19 places in 656 ms of which 1 ms to minimize.
[2024-05-29 20:43:50] [INFO ] Deduced a trap composed of 23 places in 669 ms of which 1 ms to minimize.
[2024-05-29 20:43:50] [INFO ] Deduced a trap composed of 21 places in 658 ms of which 1 ms to minimize.
[2024-05-29 20:43:51] [INFO ] Deduced a trap composed of 21 places in 765 ms of which 1 ms to minimize.
[2024-05-29 20:43:52] [INFO ] Deduced a trap composed of 19 places in 662 ms of which 1 ms to minimize.
[2024-05-29 20:43:53] [INFO ] Deduced a trap composed of 19 places in 609 ms of which 1 ms to minimize.
[2024-05-29 20:43:53] [INFO ] Deduced a trap composed of 19 places in 568 ms of which 1 ms to minimize.
[2024-05-29 20:43:54] [INFO ] Deduced a trap composed of 28 places in 707 ms of which 1 ms to minimize.
[2024-05-29 20:43:55] [INFO ] Deduced a trap composed of 20 places in 791 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 110/2019 variables, and 22 constraints, problems are : Problem set: 0 solved, 1905 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/110 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1905/1394 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1905 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
At refinement iteration 2 (OVERLAPS) 7/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
[2024-05-29 20:44:08] [INFO ] Deduced a trap composed of 19 places in 650 ms of which 1 ms to minimize.
[2024-05-29 20:44:08] [INFO ] Deduced a trap composed of 25 places in 651 ms of which 0 ms to minimize.
[2024-05-29 20:44:09] [INFO ] Deduced a trap composed of 25 places in 635 ms of which 1 ms to minimize.
[2024-05-29 20:44:10] [INFO ] Deduced a trap composed of 15 places in 620 ms of which 1 ms to minimize.
[2024-05-29 20:44:10] [INFO ] Deduced a trap composed of 21 places in 622 ms of which 1 ms to minimize.
[2024-05-29 20:44:11] [INFO ] Deduced a trap composed of 19 places in 624 ms of which 0 ms to minimize.
[2024-05-29 20:44:12] [INFO ] Deduced a trap composed of 20 places in 604 ms of which 1 ms to minimize.
[2024-05-29 20:44:12] [INFO ] Deduced a trap composed of 19 places in 582 ms of which 0 ms to minimize.
[2024-05-29 20:44:13] [INFO ] Deduced a trap composed of 20 places in 579 ms of which 0 ms to minimize.
[2024-05-29 20:44:13] [INFO ] Deduced a trap composed of 19 places in 569 ms of which 0 ms to minimize.
[2024-05-29 20:44:14] [INFO ] Deduced a trap composed of 18 places in 646 ms of which 1 ms to minimize.
[2024-05-29 20:44:15] [INFO ] Deduced a trap composed of 18 places in 643 ms of which 1 ms to minimize.
[2024-05-29 20:44:15] [INFO ] Deduced a trap composed of 21 places in 623 ms of which 0 ms to minimize.
[2024-05-29 20:44:16] [INFO ] Deduced a trap composed of 24 places in 635 ms of which 1 ms to minimize.
[2024-05-29 20:44:17] [INFO ] Deduced a trap composed of 25 places in 623 ms of which 0 ms to minimize.
[2024-05-29 20:44:17] [INFO ] Deduced a trap composed of 25 places in 603 ms of which 1 ms to minimize.
[2024-05-29 20:44:18] [INFO ] Deduced a trap composed of 21 places in 589 ms of which 1 ms to minimize.
[2024-05-29 20:44:18] [INFO ] Deduced a trap composed of 12 places in 617 ms of which 1 ms to minimize.
[2024-05-29 20:44:19] [INFO ] Deduced a trap composed of 19 places in 611 ms of which 1 ms to minimize.
[2024-05-29 20:44:20] [INFO ] Deduced a trap composed of 20 places in 600 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1905 unsolved
[2024-05-29 20:44:21] [INFO ] Deduced a trap composed of 19 places in 569 ms of which 0 ms to minimize.
[2024-05-29 20:44:22] [INFO ] Deduced a trap composed of 20 places in 655 ms of which 0 ms to minimize.
[2024-05-29 20:44:22] [INFO ] Deduced a trap composed of 25 places in 581 ms of which 1 ms to minimize.
[2024-05-29 20:44:23] [INFO ] Deduced a trap composed of 19 places in 558 ms of which 1 ms to minimize.
[2024-05-29 20:44:23] [INFO ] Deduced a trap composed of 19 places in 527 ms of which 0 ms to minimize.
[2024-05-29 20:44:24] [INFO ] Deduced a trap composed of 18 places in 614 ms of which 0 ms to minimize.
[2024-05-29 20:44:24] [INFO ] Deduced a trap composed of 18 places in 581 ms of which 1 ms to minimize.
[2024-05-29 20:44:25] [INFO ] Deduced a trap composed of 24 places in 675 ms of which 1 ms to minimize.
[2024-05-29 20:44:26] [INFO ] Deduced a trap composed of 20 places in 662 ms of which 1 ms to minimize.
[2024-05-29 20:44:27] [INFO ] Deduced a trap composed of 12 places in 640 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 110/2019 variables, and 52 constraints, problems are : Problem set: 0 solved, 1905 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/110 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1394 constraints, Known Traps: 50/50 constraints]
After SMT, in 88878ms problems are : Problem set: 0 solved, 1905 unsolved
Search for dead transitions found 0 dead transitions in 88896ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/1038 places, 1919/41005 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101842 ms. Remains : 110/1038 places, 1919/41005 transitions.
[2024-05-29 20:44:28] [INFO ] Flatten gal took : 180 ms
[2024-05-29 20:44:28] [INFO ] Flatten gal took : 184 ms
[2024-05-29 20:44:29] [INFO ] Input system was already deterministic with 1919 transitions.
[2024-05-29 20:44:29] [INFO ] Flatten gal took : 163 ms
[2024-05-29 20:44:29] [INFO ] Flatten gal took : 164 ms
[2024-05-29 20:44:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4635864704213948849.gal : 78 ms
[2024-05-29 20:44:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3361998850239919475.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4635864704213948849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3361998850239919475.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.

BK_STOP 1717015489718

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-09b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-09b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532200369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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