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.r136-tall-171631132900546.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 DoubleExponent-PT-004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 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 DoubleExponent-PT-004-CTLFireability-2024-00
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-01
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-02
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-03
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-04
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-05
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-06
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-07
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-08
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-09
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-10
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-11
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716385756125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 13:49:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:49:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:49:17] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-22 13:49:17] [INFO ] Transformed 216 places.
[2024-05-22 13:49:17] [INFO ] Transformed 198 transitions.
[2024-05-22 13:49:17] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 82 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 33 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2024-05-22 13:49:17] [INFO ] Computed 21 invariants in 28 ms
[2024-05-22 13:49:17] [INFO ] Implicit Places using invariants in 275 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 16 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 13:49:17] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 13:49:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 13:49:17] [INFO ] Invariant cache hit.
[2024-05-22 13:49:18] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 735 ms. Remains : 209/216 places, 197/198 transitions.
Support contains 82 out of 209 places after structural reductions.
[2024-05-22 13:49:18] [INFO ] Flatten gal took : 36 ms
[2024-05-22 13:49:18] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:49:18] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 80 out of 209 places (down from 82) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 57 to 56
RANDOM walk for 40000 steps (1322 resets) in 1886 ms. (21 steps per ms) remains 34/56 properties
BEST_FIRST walk for 4000 steps (113 resets) in 151 ms. (26 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (114 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (117 resets) in 114 ms. (34 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (106 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (111 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (114 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (111 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (110 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (115 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (107 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (115 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (107 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (118 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (117 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (107 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (112 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (111 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (109 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (105 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (108 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (104 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (116 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (109 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (105 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (120 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (113 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (108 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (103 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (113 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
[2024-05-22 13:49:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 119/168 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 13:49:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 6/174 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 2/176 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 186/362 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 43/405 variables, 32/228 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 12 (OVERLAPS) 1/406 variables, 1/229 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-22 13:49:21] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/230 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-22 13:49:22] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:49:22] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:49:22] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:49:22] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 4/234 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/234 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/234 constraints. Problems are: Problem set: 5 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 234 constraints, problems are : Problem set: 5 solved, 29 unsolved in 3936 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 5 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 121/161 variables, 14/14 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/15 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 6/167 variables, 2/17 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-22 13:49:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/18 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 6/173 variables, 3/21 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 186/359 variables, 173/194 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 10/204 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/204 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 46/405 variables, 35/239 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 19/258 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 5/263 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-22 13:49:25] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 1/264 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/264 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 1/406 variables, 1/265 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-22 13:49:26] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2024-05-22 13:49:26] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 2/267 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/267 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 20 (OVERLAPS) 0/406 variables, 0/267 constraints. Problems are: Problem set: 5 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 267 constraints, problems are : Problem set: 5 solved, 29 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 29/34 constraints, Known Traps: 10/10 constraints]
After SMT, in 8980ms problems are : Problem set: 5 solved, 29 unsolved
Fused 29 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2553 ms.
Support contains 40 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 207 transition count 173
Reduce places removed 22 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 185 transition count 168
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 180 transition count 168
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 56 place count 180 transition count 156
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 80 place count 168 transition count 156
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 128 place count 144 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 136 place count 140 transition count 132
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 143 place count 140 transition count 125
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 150 place count 133 transition count 125
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 161 place count 133 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 132 transition count 124
Applied a total of 162 rules in 74 ms. Remains 132 /209 variables (removed 77) and now considering 124/197 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 132/209 places, 124/197 transitions.
RANDOM walk for 40000 steps (3817 resets) in 673 ms. (59 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4001 steps (275 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (280 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (269 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (268 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (277 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (284 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (268 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (262 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (284 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (267 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (272 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (285 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (267 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (281 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (281 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (280 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (266 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (271 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (276 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (272 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (271 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (274 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (282 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (271 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (268 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (272 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (264 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (274 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 236693 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :16 out of 28
Probabilistic random walk after 236693 steps, saw 118528 distinct states, run finished after 3004 ms. (steps per millisecond=78 ) properties seen :16
// Phase 1: matrix 124 rows 132 cols
[2024-05-22 13:49:34] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 13:49:34] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 46/126 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 2 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 2 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:49:35] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 124/251 variables, 127/164 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 5/256 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/256 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 178 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 46/126 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 13:49:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 124/251 variables, 127/165 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 9/181 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 5/256 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 191 constraints, problems are : Problem set: 0 solved, 12 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 132/132 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 21/21 constraints]
After SMT, in 2485ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 18445 ms.
Support contains 16 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 124/124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 132 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 128 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 128 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 127 transition count 119
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 2 with 18 rules applied. Total rules applied 28 place count 118 transition count 110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 115 transition count 110
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 115 transition count 103
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 48 place count 108 transition count 103
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 108 transition count 103
Applied a total of 54 rules in 23 ms. Remains 108 /132 variables (removed 24) and now considering 103/124 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 108/132 places, 103/124 transitions.
RANDOM walk for 40000 steps (5465 resets) in 795 ms. (50 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3575 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3567 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3541 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3500 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3583 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3511 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3572 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3536 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3512 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3556 resets) in 112 ms. (353 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3503 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3578 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 261901 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :6 out of 12
Probabilistic random walk after 261901 steps, saw 131627 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :6
// Phase 1: matrix 103 rows 108 cols
[2024-05-22 13:49:59] [INFO ] Computed 19 invariants in 9 ms
[2024-05-22 13:49:59] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 38/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 55/102 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 103/206 variables, 103/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 5/211 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/211 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 151 constraints, problems are : Problem set: 0 solved, 6 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 108/108 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 38/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 55/102 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:00] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 103/206 variables, 103/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 13/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 5/211 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/211 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/211 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 159 constraints, problems are : Problem set: 0 solved, 6 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 108/108 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2855 ms.
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 103/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 99
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 104 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 104 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 103 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 100 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 100 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 99 transition count 94
Applied a total of 18 rules in 14 ms. Remains 99 /108 variables (removed 9) and now considering 94/103 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 99/108 places, 94/103 transitions.
RANDOM walk for 40000 steps (5526 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3512 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3548 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3526 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3548 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3563 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3500 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 340713 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 6
Probabilistic random walk after 340713 steps, saw 171033 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 94 rows 99 cols
[2024-05-22 13:50:07] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 13:50:07] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 45/87 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 94/188 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 14/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/193 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 141 constraints, problems are : Problem set: 0 solved, 6 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 99/99 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:07] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 45/87 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:08] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 13:50:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/94 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 94/188 variables, 94/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 5/193 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/193 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/193 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/193 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/193 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 150 constraints, problems are : Problem set: 0 solved, 6 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 99/99 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2641 ms.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Applied a total of 0 rules in 17 ms. Remains 99 /99 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 99/99 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-22 13:50:10] [INFO ] Invariant cache hit.
[2024-05-22 13:50:11] [INFO ] Implicit Places using invariants in 72 ms returned [22, 67, 72, 90, 96]
[2024-05-22 13:50:11] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/99 places, 94/94 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 93
Applied a total of 2 rules in 7 ms. Remains 96 /97 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 96 cols
[2024-05-22 13:50:11] [INFO ] Computed 17 invariants in 2 ms
[2024-05-22 13:50:11] [INFO ] Implicit Places using invariants in 69 ms returned [22, 87, 93]
[2024-05-22 13:50:11] [INFO ] Actually due to overlaps returned [93, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 94/99 places, 93/94 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 92
Applied a total of 2 rules in 12 ms. Remains 93 /94 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 93 cols
[2024-05-22 13:50:11] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 13:50:11] [INFO ] Implicit Places using invariants in 60 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 92/99 places, 92/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 92
Applied a total of 1 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 92 cols
[2024-05-22 13:50:11] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 13:50:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 13:50:11] [INFO ] Invariant cache hit.
[2024-05-22 13:50:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 13:50:11] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 92/99 places, 92/94 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 491 ms. Remains : 92/99 places, 92/94 transitions.
RANDOM walk for 40000 steps (6249 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3853 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3792 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3861 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3873 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3901 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3874 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 373446 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 6
Probabilistic random walk after 373446 steps, saw 186846 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-22 13:50:14] [INFO ] Invariant cache hit.
[2024-05-22 13:50:14] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 16/87 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 92/179 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/184 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 121 constraints, problems are : Problem set: 0 solved, 6 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 16/87 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:14] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:50:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:50:15] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 92/179 variables, 87/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 5/184 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 137 constraints, problems are : Problem set: 0 solved, 6 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5881 ms.
Support contains 9 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 92/92 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 13:50:21] [INFO ] Invariant cache hit.
[2024-05-22 13:50:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 13:50:21] [INFO ] Invariant cache hit.
[2024-05-22 13:50:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 13:50:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-22 13:50:21] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
[2024-05-22 13:50:21] [INFO ] Invariant cache hit.
[2024-05-22 13:50:21] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 13:50:22] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-05-22 13:50:22] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-05-22 13:50:22] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:50:22] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/184 variables, 92/110 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 124 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2488 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 13:50:24] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 92/184 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 13:50:25] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:50:25] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 218 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
After SMT, in 5897ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6170 ms. Remains : 92/92 places, 92/92 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 91 transition count 91
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 91 transition count 85
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 85 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 83 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 83 transition count 83
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 2 with 2 rules applied. Total rules applied 20 place count 82 transition count 82
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 81 transition count 81
Applied a total of 22 rules in 11 ms. Remains 81 /92 variables (removed 11) and now considering 81/92 (removed 11) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 13:50:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 13:50:27] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 13:50:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:50:27] [INFO ] After 53ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2024-05-22 13:50:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:50:27] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 13:50:27] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 13:50:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 13:50:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-22 13:50:27] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 13:50:27] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 13:50:27] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-22 13:50:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:50:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-22 13:50:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2024-05-22 13:50:28] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 13:50:28] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 526 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-004-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:50:28] [INFO ] Flatten gal took : 21 ms
[2024-05-22 13:50:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:50:28] [INFO ] Input system was already deterministic with 197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 13:50:28] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 13:50:28] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-22 13:50:28] [INFO ] Invariant cache hit.
[2024-05-22 13:50:28] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 13:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:50:31] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:50:31] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:50:33] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 13:50:33] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-22 13:50:33] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:50:33] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:50:34] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-22 13:50:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:50:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:50:35] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:50:35] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:50:36] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:50:36] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-22 13:50:37] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:50:38] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:50:53] [INFO ] Deduced a trap composed of 63 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:51:03] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46217ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46219ms
Finished structural reductions in LTL mode , in 1 iterations and 46771 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 13:51:14] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:51:14] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:51:15] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 13:51:15] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:51:15] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:51:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16551580762188888020.gal : 4 ms
[2024-05-22 13:51:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9880058653120159759.ctl : 2 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/CTLFireability16551580762188888020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9880058653120159759.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:51:45] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:51:45] [INFO ] Applying decomposition
[2024-05-22 13:51:45] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3225005473088060890.txt' '-o' '/tmp/graph3225005473088060890.bin' '-w' '/tmp/graph3225005473088060890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3225005473088060890.bin' '-l' '-1' '-v' '-w' '/tmp/graph3225005473088060890.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:51:45] [INFO ] Decomposing Gal with order
[2024-05-22 13:51:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:51:45] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 13:51:45] [INFO ] Flatten gal took : 45 ms
[2024-05-22 13:51:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-22 13:51:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4292756460956767732.gal : 14 ms
[2024-05-22 13:51:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6545239619130692556.ctl : 0 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/CTLFireability4292756460956767732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6545239619130692556.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 9 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 13:52:15] [INFO ] Invariant cache hit.
[2024-05-22 13:52:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 13:52:15] [INFO ] Invariant cache hit.
[2024-05-22 13:52:15] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 13:52:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:52:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:52:18] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:52:20] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:52:20] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:52:21] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:52:21] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:52:21] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-22 13:52:21] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:52:21] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-22 13:52:22] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:52:23] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:52:23] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-22 13:52:23] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:52:24] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:52:26] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:52:41] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:52:50] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46502ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46506ms
Finished structural reductions in LTL mode , in 1 iterations and 46847 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 13:53:02] [INFO ] Flatten gal took : 21 ms
[2024-05-22 13:53:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:53:02] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 13:53:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:53:02] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:53:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10578972828882281077.gal : 1 ms
[2024-05-22 13:53:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14625523183625223000.ctl : 1 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/CTLFireability10578972828882281077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14625523183625223000.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:53:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:53:32] [INFO ] Applying decomposition
[2024-05-22 13:53:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6235071893543315743.txt' '-o' '/tmp/graph6235071893543315743.bin' '-w' '/tmp/graph6235071893543315743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6235071893543315743.bin' '-l' '-1' '-v' '-w' '/tmp/graph6235071893543315743.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:53:32] [INFO ] Decomposing Gal with order
[2024-05-22 13:53:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:53:32] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 13:53:32] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:53:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 13:53:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13822663167860272098.gal : 5 ms
[2024-05-22 13:53:32] [INFO ] Time to serialize properties into /tmp/CTLFireability18428218621286427617.ctl : 1 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/CTLFireability13822663167860272098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18428218621286427617.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 13:54:02] [INFO ] Invariant cache hit.
[2024-05-22 13:54:02] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 13:54:02] [INFO ] Invariant cache hit.
[2024-05-22 13:54:02] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 13:54:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:54:05] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-22 13:54:05] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:54:07] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:54:08] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:54:08] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:54:08] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:54:08] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:54:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:54:08] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:54:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:54:10] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:54:10] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:54:10] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:54:11] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:54:13] [INFO ] Deduced a trap composed of 55 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:54:28] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:54:38] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46328ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46330ms
Finished structural reductions in LTL mode , in 1 iterations and 46672 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 13:54:49] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:54:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:54:49] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 13:54:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:54:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:54:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3646809530847668956.gal : 2 ms
[2024-05-22 13:54:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13470911696270946784.ctl : 1 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/CTLFireability3646809530847668956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13470911696270946784.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:55:19] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:55:19] [INFO ] Applying decomposition
[2024-05-22 13:55:19] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8161889815262883673.txt' '-o' '/tmp/graph8161889815262883673.bin' '-w' '/tmp/graph8161889815262883673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8161889815262883673.bin' '-l' '-1' '-v' '-w' '/tmp/graph8161889815262883673.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:55:19] [INFO ] Decomposing Gal with order
[2024-05-22 13:55:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:55:19] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-22 13:55:19] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:55:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-22 13:55:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16653242317980089203.gal : 3 ms
[2024-05-22 13:55:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6313080280896498609.ctl : 0 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/CTLFireability16653242317980089203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6313080280896498609.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 159 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 171 place count 122 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 121 transition count 109
Applied a total of 172 rules in 17 ms. Remains 121 /209 variables (removed 88) and now considering 109/197 (removed 88) transitions.
// Phase 1: matrix 109 rows 121 cols
[2024-05-22 13:55:49] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 13:55:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 13:55:49] [INFO ] Invariant cache hit.
[2024-05-22 13:55:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 13:55:49] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-22 13:55:49] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-22 13:55:49] [INFO ] Invariant cache hit.
[2024-05-22 13:55:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/229 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/230 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 13:55:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:55:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:55:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/230 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 121/121 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/229 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 105/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 13:55:59] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:56:00] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 258 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 121/121 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints]
After SMT, in 14291ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14292ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/209 places, 109/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14575 ms. Remains : 121/209 places, 109/197 transitions.
[2024-05-22 13:56:03] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:56:03] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:56:03] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-22 13:56:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:56:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:56:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14637077644105993667.gal : 1 ms
RANDOM walk for 40000 steps (4069 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
[2024-05-22 13:56:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality906196523061990508.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14637077644105993667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality906196523061990508.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40000 steps (2708 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality906196523061990508.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 100
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :100 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 1865
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1865 after 46163
Reachability property DoubleExponent-PT-004-CTLFireability-2024-04 is true.
FORMULA DoubleExponent-PT-004-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,250355,0.115856,7768,2,6394,16,19074,6,0,596,11357,0
Total reachable state count : 250355

Verifying 1 reachability properties.
Reachability property DoubleExponent-PT-004-CTLFireability-2024-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-004-CTLFireability-2024-04,1,0.116734,8028,2,122,16,19074,7,0,600,11357,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 168151 steps, run visited all 1 properties in 371 ms. (steps per millisecond=453 )
Probabilistic random walk after 168151 steps, saw 84107 distinct states, run finished after 374 ms. (steps per millisecond=449 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 13:56:04] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 13:56:04] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 13:56:04] [INFO ] Invariant cache hit.
[2024-05-22 13:56:04] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 13:56:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:56:07] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:56:07] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:56:09] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:56:09] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:56:09] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-05-22 13:56:09] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:56:10] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:56:10] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:56:10] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-22 13:56:11] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:56:11] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:56:12] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:56:12] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-22 13:56:13] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:56:14] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:56:29] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:56:39] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46158ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46160ms
Finished structural reductions in LTL mode , in 1 iterations and 46511 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 13:56:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:56:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:56:50] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 13:56:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:56:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:56:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12942662845711893557.gal : 1 ms
[2024-05-22 13:56:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2751049008820686423.ctl : 1 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/CTLFireability12942662845711893557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2751049008820686423.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:57:20] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:57:20] [INFO ] Applying decomposition
[2024-05-22 13:57:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7161354664038265741.txt' '-o' '/tmp/graph7161354664038265741.bin' '-w' '/tmp/graph7161354664038265741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7161354664038265741.bin' '-l' '-1' '-v' '-w' '/tmp/graph7161354664038265741.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:57:21] [INFO ] Decomposing Gal with order
[2024-05-22 13:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:57:21] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-22 13:57:21] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 13:57:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10086950563316306957.gal : 3 ms
[2024-05-22 13:57:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16309862032168666736.ctl : 0 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/CTLFireability10086950563316306957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16309862032168666736.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 13:57:51] [INFO ] Invariant cache hit.
[2024-05-22 13:57:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 13:57:51] [INFO ] Invariant cache hit.
[2024-05-22 13:57:51] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 13:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:57:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-22 13:57:54] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:57:56] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:57:56] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:57:56] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:57:56] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:57:56] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:57:57] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:57:57] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:57:58] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:57:58] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:57:58] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:57:59] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:58:00] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:58:01] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:58:16] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:58:26] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46313ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46315ms
Finished structural reductions in LTL mode , in 1 iterations and 46642 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 13:58:37] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:58:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:58:37] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 13:58:37] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:58:37] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:58:37] [INFO ] Time to serialize gal into /tmp/CTLFireability18293329483812856940.gal : 1 ms
[2024-05-22 13:58:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2816172836883059039.ctl : 0 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/CTLFireability18293329483812856940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2816172836883059039.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:59:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:59:07] [INFO ] Applying decomposition
[2024-05-22 13:59:07] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1661340825852060097.txt' '-o' '/tmp/graph1661340825852060097.bin' '-w' '/tmp/graph1661340825852060097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1661340825852060097.bin' '-l' '-1' '-v' '-w' '/tmp/graph1661340825852060097.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:59:07] [INFO ] Decomposing Gal with order
[2024-05-22 13:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:59:07] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 13:59:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:59:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 13:59:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4891867294642234618.gal : 2 ms
[2024-05-22 13:59:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12659726364081737574.ctl : 0 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/CTLFireability4891867294642234618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12659726364081737574.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 13:59:37] [INFO ] Invariant cache hit.
[2024-05-22 13:59:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 13:59:37] [INFO ] Invariant cache hit.
[2024-05-22 13:59:38] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 13:59:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:59:40] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:59:40] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:59:43] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:59:43] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 13:59:43] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:59:43] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:59:43] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:59:44] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:59:44] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:59:44] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:59:45] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:59:45] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:59:45] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:59:46] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 13:59:48] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:00:03] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:00:13] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46291ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46294ms
Finished structural reductions in LTL mode , in 1 iterations and 46622 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 14:00:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:00:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:00:24] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 14:00:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:00:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:00:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8127178961740638683.gal : 1 ms
[2024-05-22 14:00:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11930944277399793536.ctl : 0 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/CTLFireability8127178961740638683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11930944277399793536.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:00:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:00:54] [INFO ] Applying decomposition
[2024-05-22 14:00:54] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1862967080067530549.txt' '-o' '/tmp/graph1862967080067530549.bin' '-w' '/tmp/graph1862967080067530549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1862967080067530549.bin' '-l' '-1' '-v' '-w' '/tmp/graph1862967080067530549.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:00:54] [INFO ] Decomposing Gal with order
[2024-05-22 14:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:00:54] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 14:00:54] [INFO ] Flatten gal took : 23 ms
[2024-05-22 14:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 14:00:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6305780942374416925.gal : 16 ms
[2024-05-22 14:00:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11340883699263833937.ctl : 0 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/CTLFireability6305780942374416925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11340883699263833937.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 207 transition count 152
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 164 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 162 transition count 150
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 162 transition count 140
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 161 place count 127 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 127 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 126 transition count 114
Applied a total of 163 rules in 28 ms. Remains 126 /209 variables (removed 83) and now considering 114/197 (removed 83) transitions.
// Phase 1: matrix 114 rows 126 cols
[2024-05-22 14:01:24] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 14:01:24] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 14:01:24] [INFO ] Invariant cache hit.
[2024-05-22 14:01:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 14:01:25] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-22 14:01:25] [INFO ] Redundant transitions in 6 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-22 14:01:25] [INFO ] Invariant cache hit.
[2024-05-22 14:01:25] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/239 variables, 125/144 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/240 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 149 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 126/126 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/239 variables, 125/144 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 110/258 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/240 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 262 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 126/126 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 11970ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 11973ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/209 places, 114/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12251 ms. Remains : 126/209 places, 114/197 transitions.
[2024-05-22 14:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:01:37] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 14:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:01:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17239523946185987501.gal : 1 ms
[2024-05-22 14:01:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15853101690263039626.ctl : 1 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/CTLFireability17239523946185987501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15853101690263039626.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:02:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:02:07] [INFO ] Applying decomposition
[2024-05-22 14:02:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11588457229484378720.txt' '-o' '/tmp/graph11588457229484378720.bin' '-w' '/tmp/graph11588457229484378720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11588457229484378720.bin' '-l' '-1' '-v' '-w' '/tmp/graph11588457229484378720.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:02:07] [INFO ] Decomposing Gal with order
[2024-05-22 14:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:02:07] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-22 14:02:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 14:02:07] [INFO ] Time to serialize gal into /tmp/CTLFireability18006115464837584596.gal : 2 ms
[2024-05-22 14:02:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9324556821576511594.ctl : 0 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/CTLFireability18006115464837584596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9324556821576511594.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 95 place count 160 transition count 140
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 165 place count 125 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 124 transition count 112
Applied a total of 166 rules in 19 ms. Remains 124 /209 variables (removed 85) and now considering 112/197 (removed 85) transitions.
// Phase 1: matrix 112 rows 124 cols
[2024-05-22 14:02:37] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 14:02:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:02:37] [INFO ] Invariant cache hit.
[2024-05-22 14:02:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 14:02:37] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-22 14:02:37] [INFO ] Redundant transitions in 7 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-22 14:02:37] [INFO ] Invariant cache hit.
[2024-05-22 14:02:37] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/235 variables, 123/142 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 1/236 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 14:02:39] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:02:39] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:02:40] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 14:02:41] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 14:02:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-22 14:02:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 155 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/235 variables, 123/142 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/236 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 14:02:53] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:02:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 268 constraints, problems are : Problem set: 0 solved, 111 unsolved in 13477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 8/8 constraints]
After SMT, in 19667ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 19669ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/209 places, 112/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19935 ms. Remains : 124/209 places, 112/197 transitions.
[2024-05-22 14:02:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:02:57] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:02:57] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-22 14:02:57] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:02:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 14:02:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6137631959381199321.gal : 1 ms
[2024-05-22 14:02:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4826997457216497440.ctl : 0 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/CTLFireability6137631959381199321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4826997457216497440.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.
Detected timeout of ITS tools.
[2024-05-22 14:03:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:03:27] [INFO ] Applying decomposition
[2024-05-22 14:03:27] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3677342714402510300.txt' '-o' '/tmp/graph3677342714402510300.bin' '-w' '/tmp/graph3677342714402510300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3677342714402510300.bin' '-l' '-1' '-v' '-w' '/tmp/graph3677342714402510300.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:03:27] [INFO ] Decomposing Gal with order
[2024-05-22 14:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:03:27] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-22 14:03:27] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2024-05-22 14:03:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3153293509053048013.gal : 2 ms
[2024-05-22 14:03:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1989587349253473091.ctl : 0 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/CTLFireability3153293509053048013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1989587349253473091.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 14:03:57] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 14:03:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 14:03:57] [INFO ] Invariant cache hit.
[2024-05-22 14:03:57] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 14:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:04:00] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-22 14:04:00] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:04:02] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:04:02] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:04:02] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:04:02] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:04:03] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:04:03] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:04:03] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:04:04] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:04:04] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:04:05] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:04:05] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:04:06] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:04:07] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16237 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:04:22] [INFO ] Deduced a trap composed of 63 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:04:32] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46275ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46278ms
Finished structural reductions in LTL mode , in 1 iterations and 46587 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 14:04:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:04:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:04:43] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 14:04:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:04:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:04:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8538821715577545029.gal : 1 ms
[2024-05-22 14:04:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5015788167922290924.ctl : 0 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/CTLFireability8538821715577545029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5015788167922290924.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.
Detected timeout of ITS tools.
[2024-05-22 14:05:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 14:05:13] [INFO ] Applying decomposition
[2024-05-22 14:05:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17938682838185813574.txt' '-o' '/tmp/graph17938682838185813574.bin' '-w' '/tmp/graph17938682838185813574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17938682838185813574.bin' '-l' '-1' '-v' '-w' '/tmp/graph17938682838185813574.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:05:13] [INFO ] Decomposing Gal with order
[2024-05-22 14:05:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:05:13] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-22 14:05:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:05:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 14:05:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12753211726575042547.gal : 3 ms
[2024-05-22 14:05:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4140292196523223911.ctl : 1 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/CTLFireability12753211726575042547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4140292196523223911.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 14:05:44] [INFO ] Invariant cache hit.
[2024-05-22 14:05:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 14:05:44] [INFO ] Invariant cache hit.
[2024-05-22 14:05:44] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 14:05:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:05:46] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-22 14:05:47] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:05:49] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:05:49] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:05:49] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:05:49] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:05:49] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:05:50] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:05:50] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:05:50] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:05:51] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:05:51] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:05:52] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:05:53] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:05:54] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:06:09] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:06:18] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46377ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46379ms
Finished structural reductions in LTL mode , in 1 iterations and 46712 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 14:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:06:30] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 14:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17259926049169580743.gal : 1 ms
[2024-05-22 14:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1939678293888222017.ctl : 0 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/CTLFireability17259926049169580743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1939678293888222017.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:07:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:07:00] [INFO ] Applying decomposition
[2024-05-22 14:07:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9863641571519313157.txt' '-o' '/tmp/graph9863641571519313157.bin' '-w' '/tmp/graph9863641571519313157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9863641571519313157.bin' '-l' '-1' '-v' '-w' '/tmp/graph9863641571519313157.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:07:00] [INFO ] Decomposing Gal with order
[2024-05-22 14:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:07:00] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-22 14:07:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 14:07:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12294085667894860532.gal : 2 ms
[2024-05-22 14:07:00] [INFO ] Time to serialize properties into /tmp/CTLFireability685381991319260657.ctl : 1 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/CTLFireability12294085667894860532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability685381991319260657.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-22 14:07:30] [INFO ] Invariant cache hit.
[2024-05-22 14:07:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 14:07:30] [INFO ] Invariant cache hit.
[2024-05-22 14:07:31] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 14:07:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:07:33] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-22 14:07:33] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/230 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:07:36] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:07:36] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:07:36] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:07:36] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:07:36] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:07:37] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:07:37] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:07:37] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:07:38] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:07:38] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-22 14:07:38] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:07:39] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:07:41] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 243 constraints, problems are : Problem set: 0 solved, 196 unsolved in 15976 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/243 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:07:56] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 14:08:05] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 46010ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46012ms
Finished structural reductions in LTL mode , in 1 iterations and 46341 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 14:08:17] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:08:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:08:17] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 14:08:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:08:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:08:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6334773213719455967.gal : 1 ms
[2024-05-22 14:08:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4946189351653509686.ctl : 0 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/CTLFireability6334773213719455967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4946189351653509686.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.
Detected timeout of ITS tools.
[2024-05-22 14:08:47] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:08:47] [INFO ] Applying decomposition
[2024-05-22 14:08:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6772457121268668720.txt' '-o' '/tmp/graph6772457121268668720.bin' '-w' '/tmp/graph6772457121268668720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6772457121268668720.bin' '-l' '-1' '-v' '-w' '/tmp/graph6772457121268668720.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:08:47] [INFO ] Decomposing Gal with order
[2024-05-22 14:08:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:08:47] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 14:08:47] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:08:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 14:08:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15995486051317160195.gal : 2 ms
[2024-05-22 14:08:47] [INFO ] Time to serialize properties into /tmp/CTLFireability740733326359412272.ctl : 0 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/CTLFireability15995486051317160195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability740733326359412272.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 173 place count 121 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 120 transition count 108
Applied a total of 174 rules in 17 ms. Remains 120 /209 variables (removed 89) and now considering 108/197 (removed 89) transitions.
// Phase 1: matrix 108 rows 120 cols
[2024-05-22 14:09:17] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 14:09:17] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:09:17] [INFO ] Invariant cache hit.
[2024-05-22 14:09:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 14:09:17] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-05-22 14:09:17] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-22 14:09:17] [INFO ] Invariant cache hit.
[2024-05-22 14:09:17] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/227 variables, 119/138 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/228 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 14:09:19] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 14:09:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 147 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 120/120 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/227 variables, 119/138 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 104/248 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/228 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 254 constraints, problems are : Problem set: 0 solved, 107 unsolved in 10420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 120/120 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 15005ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 15007ms
Starting structural reductions in SI_CTL mode, iteration 1 : 120/209 places, 108/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15270 ms. Remains : 120/209 places, 108/197 transitions.
[2024-05-22 14:09:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:09:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:09:32] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-22 14:09:32] [INFO ] Flatten gal took : 2 ms
[2024-05-22 14:09:32] [INFO ] Flatten gal took : 2 ms
[2024-05-22 14:09:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5278599178486412714.gal : 1 ms
[2024-05-22 14:09:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13757154970860248151.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5278599178486412714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13757154970860248151.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13757154970860248151.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 48
RANDOM walk for 40000 steps (4076 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 100
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :100 after 515
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :515 after 1625
BEST_FIRST walk for 40003 steps (2692 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1625 after 21116
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :21116 after 152719
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :152719 after 451128
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :451128 after 1.08383e+06
Interrupted probabilistic random walk after 1245746 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1245746 steps, saw 622891 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
[2024-05-22 14:09:35] [INFO ] Invariant cache hit.
[2024-05-22 14:09:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/52 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/96 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/135 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/137 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 83/220 variables, 90/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/228 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/228 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/228 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/228 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 120/120 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/52 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/96 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/135 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:35] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/137 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 83/220 variables, 90/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/220 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/220 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/228 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/228 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/228 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/228 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 120/120 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 108/108 transitions.
Graph (complete) has 289 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 119 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 106
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 109 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 34 place count 103 transition count 97
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 103 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 60 place count 90 transition count 84
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 75 place count 90 transition count 84
Applied a total of 75 rules in 9 ms. Remains 90 /120 variables (removed 30) and now considering 84/108 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 90/120 places, 84/108 transitions.
RANDOM walk for 4000000 steps (508039 resets) in 3681 ms. (1086 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (337167 resets) in 2755 ms. (1451 steps per ms) remains 1/1 properties
Probably explored full state space saw : 480715 states, properties seen :0
Probabilistic random walk after 961443 steps, saw 480715 distinct states, run finished after 2306 ms. (steps per millisecond=416 ) properties seen :0
Interrupted probabilistic random walk after 1157901 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :0 out of 1
Exhaustive walk after 1157901 steps, saw 579258 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
// Phase 1: matrix 84 rows 90 cols
[2024-05-22 14:09:43] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 14:09:43] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/85 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 14:09:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:09:43] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/169 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 13/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/174 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/85 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/169 variables, 85/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/174 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 14:09:43] [INFO ] Invariant cache hit.
[2024-05-22 14:09:43] [INFO ] Implicit Places using invariants in 97 ms returned [21, 27, 58, 63, 81, 87]
[2024-05-22 14:09:43] [INFO ] Actually due to overlaps returned [63, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 88/90 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 83
Applied a total of 2 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 87 cols
[2024-05-22 14:09:43] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 14:09:44] [INFO ] Implicit Places using invariants in 68 ms returned [21, 27, 78, 84]
[2024-05-22 14:09:44] [INFO ] Actually due to overlaps returned [84, 78]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/90 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 82
Applied a total of 2 rules in 3 ms. Remains 84 /85 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 84 cols
[2024-05-22 14:09:44] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 14:09:44] [INFO ] Implicit Places using invariants in 52 ms returned [21, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/90 places, 82/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 14:09:44] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 14:09:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 14:09:44] [INFO ] Invariant cache hit.
[2024-05-22 14:09:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:09:44] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 81/90 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 477 ms. Remains : 81/90 places, 81/84 transitions.
RANDOM walk for 4000000 steps (571921 resets) in 3988 ms. (1002 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (363739 resets) in 2657 ms. (1504 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1441648 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1441648 steps, saw 720838 distinct states, run finished after 3003 ms. (steps per millisecond=480 ) properties seen :0
[2024-05-22 14:09:49] [INFO ] Invariant cache hit.
[2024-05-22 14:09:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 14:09:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:09:50] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 14:09:50] [INFO ] Invariant cache hit.
[2024-05-22 14:09:50] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 14:09:50] [INFO ] Invariant cache hit.
[2024-05-22 14:09:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:09:50] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-22 14:09:50] [INFO ] Redundant transitions in 11 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 14:09:50] [INFO ] Invariant cache hit.
[2024-05-22 14:09:50] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:09:51] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 1 ms to minimize.
[2024-05-22 14:09:51] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:09:51] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2024-05-22 14:09:52] [INFO ] Deduced a trap composed of 38 places in 539 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:09:52] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/162 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:09:52] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3077 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:09:54] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:09:54] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:09:55] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3394 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 6497ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6897 ms. Remains : 81/81 places, 81/81 transitions.
RANDOM walk for 400000 steps (57125 resets) in 2090 ms. (191 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-22 14:09:57] [INFO ] Invariant cache hit.
[2024-05-22 14:09:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:09:57] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:09:57] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 14:09:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:09:57] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:09:57] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:09:57] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:09:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:09:57] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:09:57] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 14:09:57] [INFO ] After 10ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:09:57] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:09:57] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (571995 resets) in 3871 ms. (1033 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (363390 resets) in 2519 ms. (1587 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.08383e+06 after 1.82431e+07
Interrupted probabilistic random walk after 1482651 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1482651 steps, saw 741349 distinct states, run finished after 3001 ms. (steps per millisecond=494 ) properties seen :0
[2024-05-22 14:10:02] [INFO ] Invariant cache hit.
[2024-05-22 14:10:02] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.82431e+07 after 8.28428e+07
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 14:10:02] [INFO ] Invariant cache hit.
[2024-05-22 14:10:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 14:10:03] [INFO ] Invariant cache hit.
[2024-05-22 14:10:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:10:03] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-22 14:10:03] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 14:10:03] [INFO ] Invariant cache hit.
[2024-05-22 14:10:03] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:03] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:10:03] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:10:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-22 14:10:03] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:04] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/162 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :8.28428e+07 after 2.4577e+08
[2024-05-22 14:10:04] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2162 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:06] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:10:06] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:07] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.4577e+08 after 9.18276e+08
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 5568ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5569ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5814 ms. Remains : 81/81 places, 81/81 transitions.
RANDOM walk for 400000 steps (57329 resets) in 477 ms. (836 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-22 14:10:08] [INFO ] Invariant cache hit.
[2024-05-22 14:10:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:10:08] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:10:08] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 14:10:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:10:08] [INFO ] After 7ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:10:08] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:10:08] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:10:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:10:09] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:10:09] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 14:10:09] [INFO ] After 10ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:10:09] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:10:09] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (5771 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3681 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1333258 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1333258 steps, saw 666634 distinct states, run finished after 3003 ms. (steps per millisecond=443 ) properties seen :0
[2024-05-22 14:10:12] [INFO ] Invariant cache hit.
[2024-05-22 14:10:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:12] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
RANDOM walk for 40000 steps (5694 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3748 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :9.18276e+08 after 2.25084e+09
Interrupted probabilistic random walk after 1346672 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1346672 steps, saw 673341 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-05-22 14:10:15] [INFO ] Invariant cache hit.
[2024-05-22 14:10:15] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:10:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 14:10:16] [INFO ] Invariant cache hit.
[2024-05-22 14:10:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 14:10:16] [INFO ] Invariant cache hit.
[2024-05-22 14:10:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:10:16] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-22 14:10:16] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 14:10:16] [INFO ] Invariant cache hit.
[2024-05-22 14:10:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:16] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-05-22 14:10:16] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-22 14:10:16] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:10:16] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:17] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/162 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:17] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:19] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-22 14:10:19] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:10:20] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 5598ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5823 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 6 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2024-05-22 14:10:21] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 14:10:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-22 14:10:21] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:10:21] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 14:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:10:21] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:10:21] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 14:10:21] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:10:21] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:10:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:10:21] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:10:22] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 14:10:22] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:10:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-22 14:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2024-05-22 14:10:22] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:10:22] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 201 ms.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 6 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
[2024-05-22 14:10:22] [INFO ] Invariant cache hit.
[2024-05-22 14:10:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:10:22] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:10:22] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 14:10:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:10:22] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:10:22] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 14:10:22] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2024-05-22 14:10:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:10:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:10:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16374862733823061206.gal : 1 ms
[2024-05-22 14:10:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8532054458388312245.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16374862733823061206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8532054458388312245.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8532054458388312245.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 88
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :88 after 170
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :170 after 284
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :284 after 608
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :608 after 1452
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1452 after 3220
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3220 after 6819
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6819 after 13950
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :13950 after 28277
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28277 after 56852
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :56852 after 114039
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :2.25084e+09 after 4.90715e+09
Detected timeout of ITS tools.
[2024-05-22 14:10:37] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:10:37] [INFO ] Applying decomposition
[2024-05-22 14:10:37] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15246096253583354337.txt' '-o' '/tmp/graph15246096253583354337.bin' '-w' '/tmp/graph15246096253583354337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15246096253583354337.bin' '-l' '-1' '-v' '-w' '/tmp/graph15246096253583354337.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:10:37] [INFO ] Decomposing Gal with order
[2024-05-22 14:10:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:10:37] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-22 14:10:37] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:10:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 0 ms.
[2024-05-22 14:10:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6939018833858227053.gal : 1 ms
[2024-05-22 14:10:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9198920241150548810.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6939018833858227053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9198920241150548810.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9198920241150548810.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :225 after 349
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30210 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 14:10:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:10:52] [INFO ] Applying decomposition
[2024-05-22 14:10:52] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11035188310554344646.txt' '-o' '/tmp/graph11035188310554344646.bin' '-w' '/tmp/graph11035188310554344646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11035188310554344646.bin' '-l' '-1' '-v' '-w' '/tmp/graph11035188310554344646.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:10:52] [INFO ] Decomposing Gal with order
[2024-05-22 14:10:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:10:52] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-22 14:10:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:10:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 14:10:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17004948031087662196.gal : 2 ms
[2024-05-22 14:10:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7086669105897102725.prop : 1 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17004948031087662196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7086669105897102725.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7086669105897102725.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :79 after 86
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :86 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2157 after 2259
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :843476 after 843513
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.40758e+06 after 1.40764e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.40764e+06 after 1.40777e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.40777e+06 after 1.40802e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.40802e+06 after 1.46752e+06
Detected timeout of ITS tools.
[2024-05-22 14:20:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:20:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:20:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4046551029423051583.gal : 1 ms
[2024-05-22 14:20:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14789640809249730099.ctl : 0 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/CTLFireability4046551029423051583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14789640809249730099.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:21:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:21:22] [INFO ] Applying decomposition
[2024-05-22 14:21:22] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12554429423740958600.txt' '-o' '/tmp/graph12554429423740958600.bin' '-w' '/tmp/graph12554429423740958600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12554429423740958600.bin' '-l' '-1' '-v' '-w' '/tmp/graph12554429423740958600.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:21:22] [INFO ] Decomposing Gal with order
[2024-05-22 14:21:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:21:22] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 14:21:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 1 ms.
[2024-05-22 14:21:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9307393026131561338.gal : 2 ms
[2024-05-22 14:21:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3404437816782729784.ctl : 0 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/CTLFireability9307393026131561338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3404437816782729784.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 99 place count 158 transition count 137
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 117 place count 149 transition count 137
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 171 place count 122 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 121 transition count 109
Applied a total of 172 rules in 15 ms. Remains 121 /209 variables (removed 88) and now considering 109/197 (removed 88) transitions.
// Phase 1: matrix 109 rows 121 cols
[2024-05-22 14:21:52] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 14:21:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 14:21:52] [INFO ] Invariant cache hit.
[2024-05-22 14:21:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 14:21:52] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-05-22 14:21:52] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-22 14:21:52] [INFO ] Invariant cache hit.
[2024-05-22 14:21:52] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/229 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/230 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 14:21:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:21:55] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-22 14:21:55] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 14:21:55] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/230 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 14:21:57] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/230 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 151 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 121/121 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/229 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 105/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 259 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 121/121 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints]
After SMT, in 16104ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 16106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/209 places, 109/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16362 ms. Remains : 121/209 places, 109/197 transitions.
[2024-05-22 14:22:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:22:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:22:08] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-22 14:22:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:22:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 14:22:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16098740783850166873.gal : 0 ms
[2024-05-22 14:22:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3246655943508920850.ctl : 0 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/CTLFireability16098740783850166873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3246655943508920850.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:22:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:22:38] [INFO ] Applying decomposition
[2024-05-22 14:22:38] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11696969941674398187.txt' '-o' '/tmp/graph11696969941674398187.bin' '-w' '/tmp/graph11696969941674398187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11696969941674398187.bin' '-l' '-1' '-v' '-w' '/tmp/graph11696969941674398187.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:22:39] [INFO ] Decomposing Gal with order
[2024-05-22 14:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:22:39] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-22 14:22:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 14:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16111017134639400937.gal : 1 ms
[2024-05-22 14:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3944898864765791231.ctl : 1 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/CTLFireability16111017134639400937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3944898864765791231.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 151
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 163 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 161 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 93 place count 161 transition count 140
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 167 place count 124 transition count 112
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 124 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 123 transition count 111
Applied a total of 170 rules in 17 ms. Remains 123 /209 variables (removed 86) and now considering 111/197 (removed 86) transitions.
// Phase 1: matrix 111 rows 123 cols
[2024-05-22 14:23:09] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 14:23:09] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 14:23:09] [INFO ] Invariant cache hit.
[2024-05-22 14:23:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 14:23:09] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-22 14:23:09] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-22 14:23:09] [INFO ] Invariant cache hit.
[2024-05-22 14:23:09] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/233 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/234 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 14:23:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:23:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 14:23:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 150 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 123/123 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/233 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/234 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 14:23:19] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 261 constraints, problems are : Problem set: 0 solved, 110 unsolved in 10714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 123/123 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 4/4 constraints]
After SMT, in 15144ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 15147ms
Starting structural reductions in SI_CTL mode, iteration 1 : 123/209 places, 111/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15406 ms. Remains : 123/209 places, 111/197 transitions.
[2024-05-22 14:23:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:23:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:23:24] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-22 14:23:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 14:23:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 14:23:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11569213804020577892.gal : 1 ms
[2024-05-22 14:23:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18319729525794690671.ctl : 1 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/CTLFireability11569213804020577892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18319729525794690671.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:23:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:23:54] [INFO ] Applying decomposition
[2024-05-22 14:23:54] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6407050829552858091.txt' '-o' '/tmp/graph6407050829552858091.bin' '-w' '/tmp/graph6407050829552858091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6407050829552858091.bin' '-l' '-1' '-v' '-w' '/tmp/graph6407050829552858091.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:23:54] [INFO ] Decomposing Gal with order
[2024-05-22 14:23:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:23:54] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-22 14:23:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:23:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 14:23:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9658897636897365670.gal : 1 ms
[2024-05-22 14:23:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16202491058944668063.ctl : 1 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/CTLFireability9658897636897365670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16202491058944668063.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 14:24:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:24:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:24:24] [INFO ] Applying decomposition
[2024-05-22 14:24:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2441737754416473300.txt' '-o' '/tmp/graph2441737754416473300.bin' '-w' '/tmp/graph2441737754416473300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2441737754416473300.bin' '-l' '-1' '-v' '-w' '/tmp/graph2441737754416473300.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:24:24] [INFO ] Decomposing Gal with order
[2024-05-22 14:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:24:24] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 14:24:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 14:24:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7514432652799127632.gal : 2 ms
[2024-05-22 14:24:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12726640369836354678.ctl : 1 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/CTLFireability7514432652799127632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12726640369836354678.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="DoubleExponent-PT-004"
export BK_EXAMINATION="CTLFireability"
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 DoubleExponent-PT-004, 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 r136-tall-171631132900546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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