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.r092-tall-171624189800705.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 DES-PT-30b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 42K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 103K 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 DES-PT-30b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-30b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-30b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-30b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-30b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-30b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716351215231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 04:13:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:13:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:13:36] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 04:13:36] [INFO ] Transformed 399 places.
[2024-05-22 04:13:36] [INFO ] Transformed 350 transitions.
[2024-05-22 04:13:36] [INFO ] Found NUPN structural information;
[2024-05-22 04:13:36] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-30b-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 380 transition count 334
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 380 transition count 334
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 372 transition count 326
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 372 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 372 transition count 320
Applied a total of 57 rules in 96 ms. Remains 372 /399 variables (removed 27) and now considering 320/350 (removed 30) transitions.
// Phase 1: matrix 320 rows 372 cols
[2024-05-22 04:13:36] [INFO ] Computed 62 invariants in 21 ms
[2024-05-22 04:13:37] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-22 04:13:37] [INFO ] Invariant cache hit.
[2024-05-22 04:13:37] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-22 04:13:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/372 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 319 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 320/692 variables, 372/434 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:13:45] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 23 ms to minimize.
[2024-05-22 04:13:45] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:13:45] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-22 04:13:45] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:13:46] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-22 04:13:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:13:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:13:48] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 14/448 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:13:50] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:13:50] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:13:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:13:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:13:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:13:51] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:13:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:13:51] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:13:52] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:13:52] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:13:55] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:13:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:13:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:13:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:13:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:13:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:13:56] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:13:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:13:58] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:13:59] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 10/468 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:14:00] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-22 04:14:02] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/692 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 692/692 variables, and 476 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/372 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:10] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:14:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:14:10] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:14:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:14:10] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:14:11] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:14:11] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:14:11] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:14:11] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:13] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-22 04:14:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:14:13] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:14:13] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 5 ms to minimize.
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:18] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:21] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:14:21] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:25] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:14:25] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:14:25] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:14:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 04:14:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-22 04:14:33] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:14:33] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/692 variables, and 135 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/372 constraints, PredecessorRefiner: 0/319 constraints, Known Traps: 73/73 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 372/399 places, 320/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61234 ms. Remains : 372/399 places, 320/350 transitions.
Support contains 84 out of 372 places after structural reductions.
[2024-05-22 04:14:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 04:14:38] [INFO ] Flatten gal took : 50 ms
FORMULA DES-PT-30b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 04:14:38] [INFO ] Flatten gal took : 22 ms
[2024-05-22 04:14:38] [INFO ] Input system was already deterministic with 320 transitions.
Support contains 73 out of 372 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (355 resets) in 1699 ms. (23 steps per ms) remains 19/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
[2024-05-22 04:14:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 25/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 128/186 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 165/351 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 5/356 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 9 (OVERLAPS) 306/662 variables, 356/418 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 18/680 variables, 10/428 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/680 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 6/686 variables, 3/431 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/431 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 4/690 variables, 2/433 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/690 variables, 0/433 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 2/692 variables, 1/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/692 variables, 0/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 0/692 variables, 0/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 434 constraints, problems are : Problem set: 2 solved, 17 unsolved in 3166 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 25/53 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 128/181 variables, 29/32 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 170/351 variables, 27/59 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 5/356 variables, 3/62 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 306/662 variables, 356/418 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 16/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-22 04:14:43] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:14:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-22 04:14:43] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:14:43] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:14:43] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:14:43] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 6/440 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 3/443 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-22 04:14:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:14:46] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:14:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 3/446 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/692 variables, and 446 constraints, problems are : Problem set: 2 solved, 17 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 356/372 constraints, PredecessorRefiner: 16/19 constraints, Known Traps: 12/12 constraints]
After SMT, in 8191ms problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 369 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 369 transition count 299
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 353 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 352 transition count 298
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 352 transition count 292
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 346 transition count 292
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 340 transition count 286
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 340 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 340 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 339 transition count 283
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 69 place count 335 transition count 279
Iterating global reduction 5 with 4 rules applied. Total rules applied 73 place count 335 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 76 place count 335 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 76 place count 335 transition count 274
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 80 place count 333 transition count 274
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 236 place count 255 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 255 transition count 195
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 253 transition count 200
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 244 place count 253 transition count 197
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 247 place count 250 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 248 place count 250 transition count 196
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 250 place count 250 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 249 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 252 place count 248 transition count 195
Applied a total of 252 rules in 157 ms. Remains 248 /372 variables (removed 124) and now considering 195/320 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 248/372 places, 195/320 transitions.
RANDOM walk for 40000 steps (1620 resets) in 844 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (27 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (29 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (24 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (25 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 670221 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :11 out of 17
Probabilistic random walk after 670221 steps, saw 109688 distinct states, run finished after 3005 ms. (steps per millisecond=223 ) properties seen :11
// Phase 1: matrix 195 rows 248 cols
[2024-05-22 04:14:50] [INFO ] Computed 63 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 152/183 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 31/214 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 22/236 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 195/437 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/443 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/443 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 311 constraints, problems are : Problem set: 0 solved, 6 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 152/183 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 31/214 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 04:14:51] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/236 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/242 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 195/437 variables, 242/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 04:14:51] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/443 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/443 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/443 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/443 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 319 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 1837ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9280 ms.
Support contains 13 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 195/195 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 248 transition count 194
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 2 place count 247 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 193
Applied a total of 4 rules in 18 ms. Remains 246 /248 variables (removed 2) and now considering 193/195 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 246/248 places, 193/195 transitions.
RANDOM walk for 40000 steps (1643 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (271 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (295 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (270 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (252 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (273 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (284 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 95413 steps, run visited all 6 properties in 644 ms. (steps per millisecond=148 )
Probabilistic random walk after 95413 steps, saw 31556 distinct states, run finished after 648 ms. (steps per millisecond=147 ) properties seen :6
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-30b-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 04:15:02] [INFO ] Flatten gal took : 17 ms
[2024-05-22 04:15:02] [INFO ] Flatten gal took : 18 ms
[2024-05-22 04:15:02] [INFO ] Input system was already deterministic with 320 transitions.
Computed a total of 181 stabilizing places and 173 stable transitions
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 361 transition count 309
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 361 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 361 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 355 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 355 transition count 302
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 354 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 354 transition count 295
Applied a total of 43 rules in 27 ms. Remains 354 /372 variables (removed 18) and now considering 295/320 (removed 25) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-22 04:15:02] [INFO ] Computed 62 invariants in 18 ms
[2024-05-22 04:15:03] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 04:15:03] [INFO ] Invariant cache hit.
[2024-05-22 04:15:03] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-22 04:15:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:09] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:15:09] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-22 04:15:09] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:15:09] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:15:10] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-22 04:15:10] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:15:11] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:15:11] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:15:11] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:15:11] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 10/426 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:13] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-22 04:15:13] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:15:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:15:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:17] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:15:18] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:15:18] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:15:22] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:15:23] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:15:23] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:26] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-22 04:15:26] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:15:27] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:15:27] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:15:27] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 5/458 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:29] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:15:30] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:32] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:15:32] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:15:33] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 463 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 47/109 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:35] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-22 04:15:36] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:15:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:15:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:15:38] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:15:38] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 295/649 variables, 354/477 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 294/771 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:15:59] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 772 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 62/62 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 354/372 places, 295/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 354/372 places, 295/320 transitions.
[2024-05-22 04:16:03] [INFO ] Flatten gal took : 17 ms
[2024-05-22 04:16:03] [INFO ] Flatten gal took : 15 ms
[2024-05-22 04:16:03] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-22 04:16:03] [INFO ] Flatten gal took : 15 ms
[2024-05-22 04:16:03] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:16:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5602576680911152851.gal : 32 ms
[2024-05-22 04:16:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17934031712983324482.ctl : 4 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/CTLCardinality5602576680911152851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17934031712983324482.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 04:16:33] [INFO ] Flatten gal took : 21 ms
[2024-05-22 04:16:33] [INFO ] Applying decomposition
[2024-05-22 04:16:33] [INFO ] Flatten gal took : 58 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/graph45937023131351992.txt' '-o' '/tmp/graph45937023131351992.bin' '-w' '/tmp/graph45937023131351992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph45937023131351992.bin' '-l' '-1' '-v' '-w' '/tmp/graph45937023131351992.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:16:34] [INFO ] Decomposing Gal with order
[2024-05-22 04:16:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:16:34] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 04:16:34] [INFO ] Flatten gal took : 81 ms
[2024-05-22 04:16:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2024-05-22 04:16:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9869201854475207314.gal : 6 ms
[2024-05-22 04:16:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality2601537874058466603.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/CTLCardinality9869201854475207314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2601537874058466603.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.10807e+20,18.5491,342584,6587,2243,675111,9154,686,589740,300,52988,0


Converting to forward existential form...Done !
original formula: AG((AF(AX(AG(((i8.i4.u58.p327==0)||(i9.i1.u74.p388==1))))) * ((i9.i0.u15.p178==0)||(i3.u9.p114==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(EX(!(!(E(TRUE U !(((i8.i4.u58.p327==0)||(i9.i1.u74.p388==1))))))))))] = FALSE * [(Fwd...222
(forward)formula 0,0,18.6744,342584,1,0,675111,9154,696,589740,305,52988,3077
FORMULA DES-PT-30b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 365 transition count 301
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 350 transition count 301
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 350 transition count 291
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 340 transition count 291
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 332 transition count 283
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 332 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 332 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 331 transition count 280
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 326 transition count 275
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 326 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 326 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 88 place count 325 transition count 269
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 325 transition count 267
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 323 transition count 267
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 234 place count 252 transition count 196
Applied a total of 234 rules in 76 ms. Remains 252 /372 variables (removed 120) and now considering 196/320 (removed 124) transitions.
// Phase 1: matrix 196 rows 252 cols
[2024-05-22 04:16:53] [INFO ] Computed 59 invariants in 9 ms
[2024-05-22 04:16:53] [INFO ] Implicit Places using invariants in 157 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 251/372 places, 196/320 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 245 ms. Remains : 251/372 places, 196/320 transitions.
[2024-05-22 04:16:53] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:16:53] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:16:53] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-22 04:16:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 04:16:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 04:16:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17586422809508049670.gal : 2 ms
[2024-05-22 04:16:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11259284835035899451.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/CTLCardinality17586422809508049670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11259284835035899451.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 04:17:23] [INFO ] Flatten gal took : 11 ms
[2024-05-22 04:17:23] [INFO ] Applying decomposition
[2024-05-22 04:17:23] [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/graph14385186744583651739.txt' '-o' '/tmp/graph14385186744583651739.bin' '-w' '/tmp/graph14385186744583651739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14385186744583651739.bin' '-l' '-1' '-v' '-w' '/tmp/graph14385186744583651739.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:17:23] [INFO ] Decomposing Gal with order
[2024-05-22 04:17:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:17:23] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 04:17:23] [INFO ] Flatten gal took : 17 ms
[2024-05-22 04:17:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 04:17:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2628378689704352377.gal : 3 ms
[2024-05-22 04:17:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality15645985683236906345.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/CTLCardinality2628378689704352377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15645985683236906345.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.62227e+14,1.76596,60768,5101,3818,132559,14661,404,115617,316,111693,0


Converting to forward existential form...Done !
original formula: EF(((AG(((u17.p34==0)&&(i8.i0.u6.p179==1))) * (i7.i0.u24.p285==1)) * (i6.i0.u0.p128==0)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i6.i0.u0.p128==0)) * (i7.i0.u24.p285==1)) * !(E(TRUE U !(((u17.p34==0)&&(i8.i0.u6.p179==1...171
Reverse transition relation is NOT exact ! Due to transitions t116, t157, t158, t161, t164, u16.t75, u17.t136, u52.t2, u52.t166, i0.t12, i0.u3.t16, i0.u3.t...640
(forward)formula 0,0,7.89339,266688,1,0,579101,79255,2743,609095,3401,484934,781422
FORMULA DES-PT-30b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 365 transition count 302
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 351 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 350 transition count 301
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 350 transition count 291
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 51 place count 340 transition count 291
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 60 place count 331 transition count 282
Iterating global reduction 3 with 9 rules applied. Total rules applied 69 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 330 transition count 279
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 79 place count 324 transition count 273
Iterating global reduction 5 with 6 rules applied. Total rules applied 85 place count 324 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 91 place count 324 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 93 place count 323 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 93 place count 323 transition count 263
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 99 place count 320 transition count 263
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 233 place count 253 transition count 196
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 253 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 236 place count 251 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 250 transition count 194
Applied a total of 237 rules in 72 ms. Remains 250 /372 variables (removed 122) and now considering 194/320 (removed 126) transitions.
// Phase 1: matrix 194 rows 250 cols
[2024-05-22 04:17:31] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 04:17:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 04:17:31] [INFO ] Invariant cache hit.
[2024-05-22 04:17:31] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 04:17:32] [INFO ] Redundant transitions in 6 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-22 04:17:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/246 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 3/249 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 194/443 variables, 249/307 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 04:17:37] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-22 04:17:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:17:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 04:17:42] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-22 04:17:42] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:17:43] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/444 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 314 constraints, problems are : Problem set: 0 solved, 189 unsolved in 16739 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/246 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 3/249 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 194/443 variables, 249/313 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 189/502 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-22 04:18:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 04:18:16] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/444 variables, and 505 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/250 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints]
After SMT, in 46826ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 46828ms
Starting structural reductions in SI_CTL mode, iteration 1 : 250/372 places, 194/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47229 ms. Remains : 250/372 places, 194/320 transitions.
[2024-05-22 04:18:18] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:18:18] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:18:18] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-22 04:18:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:18:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:18:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality5130192691732169956.gal : 2 ms
[2024-05-22 04:18:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality4741812185725900376.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/CTLCardinality5130192691732169956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4741812185725900376.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 04:18:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:18:48] [INFO ] Applying decomposition
[2024-05-22 04:18:48] [INFO ] Flatten gal took : 8 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/graph12615815122866815582.txt' '-o' '/tmp/graph12615815122866815582.bin' '-w' '/tmp/graph12615815122866815582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12615815122866815582.bin' '-l' '-1' '-v' '-w' '/tmp/graph12615815122866815582.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:18:49] [INFO ] Decomposing Gal with order
[2024-05-22 04:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:18:49] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-22 04:18:49] [INFO ] Flatten gal took : 13 ms
[2024-05-22 04:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 1 ms.
[2024-05-22 04:18:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7984184005296801318.gal : 2 ms
[2024-05-22 04:18:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11964634620804154078.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/CTLCardinality7984184005296801318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11964634620804154078.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.46893e+14,1.80099,63684,6832,2981,153378,8981,332,131405,318,51845,0


Converting to forward existential form...Done !
original formula: EG(EF(((AF((i2.u9.p223==1)) * ((i12.u47.p365==0)||(i0.u2.p127==1))) * ((AF((u14.p94==1)) + EG((u51.p46==1))) + (EF(((i1.u8.p199==0)||(i11...201
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(EG(!((i2.u9.p223==1)))) * ((i12.u47.p365==0)||(i0.u2.p127==1))) * ((!(EG(!((u14.p94==1))...274
Reverse transition relation is NOT exact ! Due to transitions t117, t156, t159, t161, u14.t76, u51.t2, u51.t163, i0.t13, i0.u2.t17, i0.u2.t21, i0.u2.t22, i...640
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 300
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 300
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 349 transition count 290
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 339 transition count 290
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 331 transition count 282
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 330 transition count 279
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 325 transition count 274
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 325 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 88 place count 324 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 324 transition count 266
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 322 transition count 266
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 234 place count 251 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 249 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 248 transition count 193
Applied a total of 237 rules in 55 ms. Remains 248 /372 variables (removed 124) and now considering 193/320 (removed 127) transitions.
// Phase 1: matrix 193 rows 248 cols
[2024-05-22 04:19:19] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 04:19:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 04:19:19] [INFO ] Invariant cache hit.
[2024-05-22 04:19:19] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-22 04:19:19] [INFO ] Redundant transitions in 7 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-22 04:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/247 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 193/440 variables, 247/305 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 04:19:22] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:19:23] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 04:19:26] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/441 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 04:19:30] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:19:30] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:19:30] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-22 04:19:30] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 04:19:32] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 0/441 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 314 constraints, problems are : Problem set: 0 solved, 190 unsolved in 18829 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 2/247 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 193/440 variables, 247/313 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 190/503 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 1/441 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 504 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 8/8 constraints]
After SMT, in 48913ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 48916ms
Starting structural reductions in SI_CTL mode, iteration 1 : 248/372 places, 193/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49332 ms. Remains : 248/372 places, 193/320 transitions.
[2024-05-22 04:20:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:20:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:20:08] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-22 04:20:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:20:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:20:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7119800518072884440.gal : 2 ms
[2024-05-22 04:20:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality16637504010795065235.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/CTLCardinality7119800518072884440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16637504010795065235.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 04:20:38] [INFO ] Flatten gal took : 10 ms
[2024-05-22 04:20:38] [INFO ] Applying decomposition
[2024-05-22 04:20:38] [INFO ] Flatten gal took : 7 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/graph9441166574953192444.txt' '-o' '/tmp/graph9441166574953192444.bin' '-w' '/tmp/graph9441166574953192444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9441166574953192444.bin' '-l' '-1' '-v' '-w' '/tmp/graph9441166574953192444.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:20:38] [INFO ] Decomposing Gal with order
[2024-05-22 04:20:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:20:38] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-22 04:20:38] [INFO ] Flatten gal took : 11 ms
[2024-05-22 04:20:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 04:20:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality14553630773090446432.gal : 2 ms
[2024-05-22 04:20:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality9381830829154590581.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/CTLCardinality14553630773090446432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9381830829154590581.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.74709e+14,3.05488,97536,10954,3802,249536,7612,324,183868,305,39249,0


Converting to forward existential form...Done !
original formula: EG(((i1.i2.u12.p232==0)||(u16.p7==1)))
=> equivalent forward existential formula: [FwdG(Init,((i1.i2.u12.p232==0)||(u16.p7==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 300
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 300
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 349 transition count 290
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 339 transition count 290
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 330 transition count 281
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 330 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 330 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 329 transition count 278
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 79 place count 323 transition count 272
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 323 transition count 272
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 323 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 322 transition count 265
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 93 place count 322 transition count 262
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 99 place count 319 transition count 262
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 241 place count 248 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 246 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 245 transition count 189
Applied a total of 244 rules in 51 ms. Remains 245 /372 variables (removed 127) and now considering 189/320 (removed 131) transitions.
// Phase 1: matrix 189 rows 245 cols
[2024-05-22 04:21:08] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:21:08] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 04:21:08] [INFO ] Invariant cache hit.
[2024-05-22 04:21:09] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-22 04:21:09] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 04:21:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 2/244 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 189/433 variables, 244/302 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 04:21:12] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:21:12] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:21:12] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 04:21:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 04:21:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:21:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 1/434 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 04:21:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:21:19] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 186 unsolved in 16342 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 2/244 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 189/433 variables, 244/310 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 186/496 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (OVERLAPS) 1/434 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 497 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 8/8 constraints]
After SMT, in 46440ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 46443ms
Starting structural reductions in SI_CTL mode, iteration 1 : 245/372 places, 189/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46878 ms. Remains : 245/372 places, 189/320 transitions.
[2024-05-22 04:21:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:21:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:21:55] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-22 04:21:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:21:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:21:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12599341287959085070.gal : 22 ms
[2024-05-22 04:21:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12969667334293242524.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/ReachabilityCardinality12599341287959085070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12969667334293242524.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (1282 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (239 resets) in 66 ms. (597 steps per ms) remains 1/1 properties

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 ...330
Loading property file /tmp/ReachabilityCardinality12969667334293242524.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 62
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :62 after 848
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :848 after 5196
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5196 after 14171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :14171 after 427952
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.01197e+06 after 1.22897e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.29221e+07 after 1.73833e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.73833e+07 after 5.96871e+08
Interrupted probabilistic random walk after 1618881 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1618881 steps, saw 220411 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
[2024-05-22 04:21:58] [INFO ] Invariant cache hit.
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) 126/127 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 34/161 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/190 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/197 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/344 variables, 197/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/364 variables, 11/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/365 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/404 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/404 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/404 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 30/434 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 245/245 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) 126/127 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/161 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/190 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/197 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/344 variables, 197/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/364 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/365 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/404 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/404 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 30/434 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 189/189 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 243 transition count 185
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 239 transition count 181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 237 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 236 transition count 182
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 236 transition count 182
Applied a total of 21 rules in 21 ms. Remains 236 /245 variables (removed 9) and now considering 182/189 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 236/245 places, 182/189 transitions.
SDD size :5.96871e+08 after 7.00695e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.00695e+09 after 9.97408e+09
RANDOM walk for 4000000 steps (191250 resets) in 14452 ms. (276 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (36543 resets) in 5921 ms. (675 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.97408e+09 after 1.06668e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.70812e+10 after 1.78562e+10
Interrupted probabilistic random walk after 8466360 steps, run timeout after 15001 ms. (steps per millisecond=564 ) properties seen :0 out of 1
Probabilistic random walk after 8466360 steps, saw 1161738 distinct states, run finished after 15001 ms. (steps per millisecond=564 ) properties seen :0
// Phase 1: matrix 182 rows 236 cols
[2024-05-22 04:22:19] [INFO ] Computed 60 invariants in 3 ms
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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:22:20] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/187 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/342 variables, 194/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/355 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/357 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/389 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 29/418 variables, 29/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-22 04:22:20] [INFO ] Invariant cache hit.
[2024-05-22 04:22:20] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 04:22:20] [INFO ] Invariant cache hit.
[2024-05-22 04:22:20] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-22 04:22:20] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-22 04:22:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:22:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:22:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:22:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-22 04:22:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:22:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:22:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 302 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10265 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:22:32] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.78562e+10 after 1.42824e+11
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:23:00] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 483 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 8/8 constraints]
After SMT, in 40366ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 40368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40731 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 400000 steps (19133 resets) in 2921 ms. (136 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-22 04:23:01] [INFO ] Invariant cache hit.
[2024-05-22 04:23:01] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 04:23:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:23:01] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:23:01] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 04:23:01] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (190373 resets) in 10835 ms. (369 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (36506 resets) in 4656 ms. (858 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.84651e+11 after 6.47904e+11
Interrupted probabilistic random walk after 6677051 steps, run timeout after 12001 ms. (steps per millisecond=556 ) properties seen :0 out of 1
Probabilistic random walk after 6677051 steps, saw 917022 distinct states, run finished after 12002 ms. (steps per millisecond=556 ) properties seen :0
[2024-05-22 04:23:18] [INFO ] Invariant cache hit.
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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/355 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/357 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/389 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/418 variables, 29/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-22 04:23:18] [INFO ] Invariant cache hit.
[2024-05-22 04:23:18] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 04:23:18] [INFO ] Invariant cache hit.
[2024-05-22 04:23:19] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-22 04:23:19] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-22 04:23:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:23:21] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:23:21] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:23:25] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 302 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10284 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:23:31] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:23:58] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 483 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 8/8 constraints]
After SMT, in 40383ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 40385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40782 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 400000 steps (19073 resets) in 994 ms. (402 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-22 04:23:59] [INFO ] Invariant cache hit.
[2024-05-22 04:23:59] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 04:23:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:24:00] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:24:00] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 04:24:00] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1927 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (335 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1664773 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :0 out of 1
Probabilistic random walk after 1664773 steps, saw 230839 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :0
[2024-05-22 04:24:03] [INFO ] Invariant cache hit.
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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/355 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/357 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/389 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/418 variables, 29/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 40000 steps (1938 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (368 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1692248 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :0 out of 1
Probabilistic random walk after 1692248 steps, saw 234638 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
[2024-05-22 04:24:06] [INFO ] Invariant cache hit.
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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 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) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/355 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/357 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/389 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/418 variables, 29/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-22 04:24:07] [INFO ] Invariant cache hit.
[2024-05-22 04:24:07] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 04:24:07] [INFO ] Invariant cache hit.
[2024-05-22 04:24:07] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-22 04:24:07] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-22 04:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:24:10] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:24:10] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:24:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-22 04:24:11] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:24:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:24:13] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 302 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10317 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:24:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 04:24:47] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 483 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 8/8 constraints]
After SMT, in 40400ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 40403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40775 ms. Remains : 236/236 places, 182/182 transitions.
Attempting over-approximation, by ignoring read arcs.
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 236 transition count 182
Applied a total of 1 rules in 31 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 236 cols
[2024-05-22 04:24:47] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 04:24:47] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 04:24:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 04:24:47] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 04:24:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 04:24:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 04:24:48] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:24:48] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:24:48] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 268 ms.
Attempting over-approximation, by ignoring read arcs.
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 236 transition count 182
Applied a total of 1 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 04:24:48] [INFO ] Invariant cache hit.
[2024-05-22 04:24:48] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 04:24:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:24:48] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 04:24:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 04:24:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:24:48] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:24:48] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:24:48] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:24:48] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:24:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:24:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17747206890831417305.gal : 5 ms
[2024-05-22 04:24:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9216398820771477853.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/ReachabilityCardinality17747206890831417305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9216398820771477853.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/ReachabilityCardinality9216398820771477853.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 38
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :38 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 156
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :156 after 2570
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2570 after 7000
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7000 after 90832
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :197648 after 270380
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.84298e+06 after 3.49537e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.49537e+06 after 3.269e+08
Reachability property DES-PT-30b-CTLCardinality-2024-06 is true.
FORMULA DES-PT-30b-CTLCardinality-2024-06 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 262145 fixpoint passes
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.269e+08 after 1.54284e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.54284e+09 after 1.98833e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.98833e+09 after 2.00375e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.85325e+09 after 6.0934e+09
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,3.58885e+12,184.766,3038812,2,1.38696e+06,25,1.41502e+07,6,0,1166,1.3687e+07,0
Total reachable state count : 3588849560032

Verifying 1 reachability properties.
Reachability property DES-PT-30b-CTLCardinality-2024-06 is true.

Detected timeout of ITS tools.
[2024-05-22 04:25:03] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:25:03] [INFO ] Applying decomposition
[2024-05-22 04:25:03] [INFO ] Flatten gal took : 7 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/graph27082236223199636.txt' '-o' '/tmp/graph27082236223199636.bin' '-w' '/tmp/graph27082236223199636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph27082236223199636.bin' '-l' '-1' '-v' '-w' '/tmp/graph27082236223199636.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:25:03] [INFO ] Decomposing Gal with order
[2024-05-22 04:25:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:25:03] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-22 04:25:03] [INFO ] Flatten gal took : 20 ms
[2024-05-22 04:25:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-22 04:25:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14879297967705021840.gal : 7 ms
[2024-05-22 04:25:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13629023059595847715.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/ReachabilityCardinality14879297967705021840.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13629023059595847715.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 ...309
Loading property file /tmp/ReachabilityCardinality13629023059595847715.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 258
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :258 after 4132
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4132 after 50736
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50736 after 2.47989e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.47989e+09 after 4.30651e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.30651e+09 after 7.04643e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-CTLCardinality-2024-06,1,185.16,3038812,2,246,25,1.41502e+07,7,0,1169,1.3687e+07,0
ITS tools runner thread asked to quit. Dying gracefully.
Reachability property DES-PT-30b-CTLCardinality-2024-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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\_mod\_flat,5.86767e+12,2.96945,105320,20543,955,283922,3645,264,306815,304,8539,0
Total reachable state count : 5867666823370

Verifying 1 reachability properties.
Reachability property DES-PT-30b-CTLCardinality-2024-06 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
DES-PT-30b-CTLCardinality-2024-06,1.11349e+07,2.99916,105584,257,264,283922,3645,266,306815,307,8539,0
Over-approximation ignoring read arcs solved -1 properties in 18399 ms.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 362 transition count 310
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 362 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 362 transition count 309
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 356 transition count 303
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 356 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 356 transition count 298
Applied a total of 38 rules in 13 ms. Remains 356 /372 variables (removed 16) and now considering 298/320 (removed 22) transitions.
// Phase 1: matrix 298 rows 356 cols
[2024-05-22 04:25:06] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 04:25:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 04:25:06] [INFO ] Invariant cache hit.
[2024-05-22 04:25:07] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-22 04:25:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/356 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 298/654 variables, 356/418 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:25:21] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 5/431 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:24] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:26] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:25:27] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:25:28] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-22 04:25:29] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 04:25:29] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-22 04:25:30] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 19/451 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 457 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/356 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:25:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-22 04:25:39] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:25:39] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:25:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:25:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:25:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:25:40] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 04:25:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:25:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:25:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 04:25:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:42] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:25:42] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:25:42] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:25:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:25:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:25:44] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:46] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 04:25:47] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:25:47] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:25:48] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:25:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 298/654 variables, 356/480 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 297/777 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 777 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 62/62 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 356/372 places, 298/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 356/372 places, 298/320 transitions.
[2024-05-22 04:26:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:26:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:26:07] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-22 04:26:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:26:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality7148122706628999141.gal : 1 ms
[2024-05-22 04:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality1169028280037217000.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/CTLCardinality7148122706628999141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1169028280037217000.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 04:26:37] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:26:37] [INFO ] Applying decomposition
[2024-05-22 04:26:37] [INFO ] Flatten gal took : 8 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/graph7483792908675301126.txt' '-o' '/tmp/graph7483792908675301126.bin' '-w' '/tmp/graph7483792908675301126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7483792908675301126.bin' '-l' '-1' '-v' '-w' '/tmp/graph7483792908675301126.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:26:37] [INFO ] Decomposing Gal with order
[2024-05-22 04:26:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:26:37] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 04:26:37] [INFO ] Flatten gal took : 21 ms
[2024-05-22 04:26:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 04:26:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality3366823560701125138.gal : 5 ms
[2024-05-22 04:26:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15466107338002491765.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/CTLCardinality3366823560701125138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15466107338002491765.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.43251e+20,5.28073,153272,15968,2722,362679,18922,646,349647,314,134409,0


Converting to forward existential form...Done !
original formula: A((AG(((i2.u6.p141==0) + EF(((i7.u56.p323==0)||(i10.u78.p394==1))))) + AX(((!(((i7.u39.p265==1)&&(i3.u11.p163==1))&&((i2.u5.p134==0)||(i3...317
=> equivalent forward existential formula: [((Init * !(EG(!(((EX(((u33.p84==0)||(i9.u66.p358==1))) * (u35.p254==0)) * ((i10.u78.p53==1) * (!(E(TRUE U !((u3...714
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t116, t221, t259, t292, u35.t77, u33.t80, u8.t196, u8.t197, u8.t198, u8.t199, u8.t20...931
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 365 transition count 301
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 350 transition count 301
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 350 transition count 291
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 340 transition count 291
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 331 transition count 282
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 330 transition count 279
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 79 place count 324 transition count 273
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 324 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 324 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 323 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 93 place count 323 transition count 263
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 99 place count 320 transition count 263
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 239 place count 250 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 250 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 248 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 247 transition count 191
Applied a total of 243 rules in 54 ms. Remains 247 /372 variables (removed 125) and now considering 191/320 (removed 129) transitions.
// Phase 1: matrix 191 rows 247 cols
[2024-05-22 04:27:07] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:27:07] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 04:27:07] [INFO ] Invariant cache hit.
[2024-05-22 04:27:07] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-22 04:27:07] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-22 04:27:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 2/246 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 191/437 variables, 246/304 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-22 04:27:10] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:27:11] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-22 04:27:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:27:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:27:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:27:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 1/438 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-22 04:27:19] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:27:19] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:27:19] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/438 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (OVERLAPS) 0/438 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 314 constraints, problems are : Problem set: 0 solved, 188 unsolved in 18137 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 2/246 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 191/437 variables, 246/313 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 188/501 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 1/438 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 502 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 9/9 constraints]
After SMT, in 48214ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 48216ms
Starting structural reductions in SI_CTL mode, iteration 1 : 247/372 places, 191/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48643 ms. Remains : 247/372 places, 191/320 transitions.
[2024-05-22 04:27:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:27:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:27:56] [INFO ] Input system was already deterministic with 191 transitions.
[2024-05-22 04:27:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:27:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:27:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2460351194985002212.gal : 1 ms
[2024-05-22 04:27:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12936620819148714236.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/CTLCardinality2460351194985002212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12936620819148714236.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 04:28:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:28:26] [INFO ] Applying decomposition
[2024-05-22 04:28:26] [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/graph5439295107174652627.txt' '-o' '/tmp/graph5439295107174652627.bin' '-w' '/tmp/graph5439295107174652627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5439295107174652627.bin' '-l' '-1' '-v' '-w' '/tmp/graph5439295107174652627.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:28:26] [INFO ] Decomposing Gal with order
[2024-05-22 04:28:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:28:26] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 04:28:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 04:28:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 1 ms.
[2024-05-22 04:28:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality14710497764345661355.gal : 2 ms
[2024-05-22 04:28:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality6930104914745612112.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/CTLCardinality14710497764345661355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6930104914745612112.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47555e+14,3.94312,95100,15935,2960,224016,8746,342,223422,319,50092,0


Converting to forward existential form...Done !
original formula: AF(((AG(EF((i13.i0.u50.p376==1))) * (i1.u7.p199==1)) * AF(!(E((u52.p39==1) U (i13.i1.u49.p359==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(E(TRUE U (i13.i0.u50.p376==1))))) * (i1.u7.p199==1)) * !(EG(!(!(E((u52.p39==1) U (i1...189
Reverse transition relation is NOT exact ! Due to transitions t113, t153, t156, t158, u14.t73, u52.t2, u52.t160, i0.t10, i0.u2.t14, i0.u2.t18, i0.u2.t19, i...621
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 300
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 300
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 349 transition count 290
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 339 transition count 290
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 331 transition count 282
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 330 transition count 279
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 325 transition count 274
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 325 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 88 place count 324 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 324 transition count 266
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 322 transition count 266
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 228 place count 254 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 252 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 251 transition count 196
Applied a total of 231 rules in 36 ms. Remains 251 /372 variables (removed 121) and now considering 196/320 (removed 124) transitions.
// Phase 1: matrix 196 rows 251 cols
[2024-05-22 04:28:56] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:28:56] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 04:28:56] [INFO ] Invariant cache hit.
[2024-05-22 04:28:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-22 04:28:56] [INFO ] Redundant transitions in 0 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-22 04:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 1/248 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 2/250 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 196/446 variables, 250/308 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-22 04:29:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:29:02] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:29:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-22 04:29:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:29:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-22 04:29:05] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (OVERLAPS) 1/447 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-22 04:29:09] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:29:09] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:29:10] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:29:10] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 319 constraints, problems are : Problem set: 0 solved, 192 unsolved in 19054 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 1/248 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 2/250 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 196/446 variables, 250/318 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 192/510 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-22 04:29:26] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 192 unsolved
SMT process timed out in 49139ms, After SMT, problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 49142ms
Starting structural reductions in SI_CTL mode, iteration 1 : 251/372 places, 196/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49562 ms. Remains : 251/372 places, 196/320 transitions.
[2024-05-22 04:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:29:45] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-22 04:29:45] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:29:45] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:29:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality1294309666867883083.gal : 2 ms
[2024-05-22 04:29:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12488640984192889246.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/CTLCardinality1294309666867883083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12488640984192889246.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 04:30:16] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:30:16] [INFO ] Applying decomposition
[2024-05-22 04:30:16] [INFO ] Flatten gal took : 16 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/graph14609432883004919934.txt' '-o' '/tmp/graph14609432883004919934.bin' '-w' '/tmp/graph14609432883004919934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14609432883004919934.bin' '-l' '-1' '-v' '-w' '/tmp/graph14609432883004919934.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:30:16] [INFO ] Decomposing Gal with order
[2024-05-22 04:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:30:16] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 04:30:16] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 04:30:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality3215455307932404545.gal : 2 ms
[2024-05-22 04:30:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality1380988468292728381.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/CTLCardinality3215455307932404545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1380988468292728381.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.85372e+14,2.42994,74936,5615,3830,176516,8369,377,133916,320,45843,0


Converting to forward existential form...Done !
original formula: EF(AG(((i1.u4.p171==0)||(i11.i0.u17.p258==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i1.u4.p171==0)||(i11.i0.u17.p258==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t118, t157, t158, t161, t164, u15.t77, u16.t137, u50.t2, u50.t166, i0.t14, i0.u2.t18, i0.u2.t...655
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 365 transition count 302
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 351 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 350 transition count 301
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 350 transition count 292
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 49 place count 341 transition count 292
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 57 place count 333 transition count 284
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 333 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 333 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 332 transition count 281
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 74 place count 327 transition count 276
Iterating global reduction 5 with 5 rules applied. Total rules applied 79 place count 327 transition count 276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 83 place count 327 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 83 place count 327 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 89 place count 324 transition count 269
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 231 place count 253 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 253 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 253 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 251 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 250 transition count 195
Applied a total of 236 rules in 43 ms. Remains 250 /372 variables (removed 122) and now considering 195/320 (removed 125) transitions.
// Phase 1: matrix 195 rows 250 cols
[2024-05-22 04:30:46] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 04:30:46] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 04:30:46] [INFO ] Invariant cache hit.
[2024-05-22 04:30:46] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-22 04:30:46] [INFO ] Redundant transitions in 0 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-22 04:30:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 3/249 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 195/444 variables, 249/307 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 04:30:50] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-22 04:30:50] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 04:30:53] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 04:30:54] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:30:54] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 04:30:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:30:56] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 1/445 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (OVERLAPS) 0/445 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 315 constraints, problems are : Problem set: 0 solved, 191 unsolved in 18168 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 3/249 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 195/444 variables, 249/314 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 191/505 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 04:31:15] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 191 unsolved
SMT process timed out in 48259ms, After SMT, problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 48261ms
Starting structural reductions in SI_CTL mode, iteration 1 : 250/372 places, 195/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48658 ms. Remains : 250/372 places, 195/320 transitions.
[2024-05-22 04:31:34] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:31:34] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:31:34] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-22 04:31:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 04:31:34] [INFO ] Flatten gal took : 6 ms
[2024-05-22 04:31:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality17344395830016996221.gal : 1 ms
[2024-05-22 04:31:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16879885307651157893.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/CTLCardinality17344395830016996221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16879885307651157893.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 04:32:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:32:04] [INFO ] Applying decomposition
[2024-05-22 04:32:04] [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/graph9729794481331111937.txt' '-o' '/tmp/graph9729794481331111937.bin' '-w' '/tmp/graph9729794481331111937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9729794481331111937.bin' '-l' '-1' '-v' '-w' '/tmp/graph9729794481331111937.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:32:04] [INFO ] Decomposing Gal with order
[2024-05-22 04:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:32:04] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-22 04:32:04] [INFO ] Flatten gal took : 11 ms
[2024-05-22 04:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 1 ms.
[2024-05-22 04:32:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1180218068046323252.gal : 1 ms
[2024-05-22 04:32:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11213432678057264898.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/CTLCardinality1180218068046323252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11213432678057264898.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.61801e+14,1.65363,61852,6241,2789,151507,11419,377,111888,318,54315,0


Converting to forward existential form...Done !
original formula: AG(E(EG(AF(((i4.u18.p7==1)&&((i0.u3.p104==0)||(i0.u3.p154==1))))) U (((i11.i0.u21.p277==0) * E(A(((i2.u44.p351==0)||(i12.i0.u45.p353==1))...270
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(!(EG(!(((i4.u18.p7==1)&&((i0.u3.p104==0)||(i0.u3.p154==1))))))) U (((i11.i0.u21.p277=...395
Reverse transition relation is NOT exact ! Due to transitions t116, t156, t159, t162, u16.t46, u52.t2, u52.t164, i0.t10, i0.u3.t13, i0.u3.t78, i0.u3.t82, i...634
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 363 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 363 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 363 transition count 309
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 359 transition count 305
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 359 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 359 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 358 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 358 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 358 transition count 299
Applied a total of 35 rules in 23 ms. Remains 358 /372 variables (removed 14) and now considering 299/320 (removed 21) transitions.
// Phase 1: matrix 299 rows 358 cols
[2024-05-22 04:32:35] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 04:32:35] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 04:32:35] [INFO ] Invariant cache hit.
[2024-05-22 04:32:35] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2024-05-22 04:32:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/358 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 298 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (OVERLAPS) 299/657 variables, 358/420 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:32:41] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:32:41] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:32:41] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:32:42] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:32:42] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:32:42] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
[2024-05-22 04:32:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:32:42] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:32:42] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:32:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:32:43] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:32:43] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:32:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:32:43] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 14/434 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:32:46] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:32:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:32:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:32:47] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:32:47] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:32:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:32:47] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:32:47] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:32:49] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 16/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:32:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:32:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:32:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 04:32:53] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:32:54] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:33:03] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/657 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/657 variables, and 456 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/358 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 36/98 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:33:07] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:33:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:33:08] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:33:08] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:33:08] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 04:33:08] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:33:09] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-22 04:33:09] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:33:10] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:33:11] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:33:12] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:33:13] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 299/657 variables, 358/481 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 298/779 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 04:33:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 04:33:35] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:33:35] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:33:35] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 783 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 65/65 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 358/372 places, 299/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 358/372 places, 299/320 transitions.
[2024-05-22 04:33:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:33:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:33:35] [INFO ] Input system was already deterministic with 299 transitions.
[2024-05-22 04:33:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:33:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:33:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4385490774140091566.gal : 2 ms
[2024-05-22 04:33:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality3232384978315766614.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/CTLCardinality4385490774140091566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3232384978315766614.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 04:34:05] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:34:05] [INFO ] Applying decomposition
[2024-05-22 04:34:05] [INFO ] Flatten gal took : 7 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/graph15042748993568423247.txt' '-o' '/tmp/graph15042748993568423247.bin' '-w' '/tmp/graph15042748993568423247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15042748993568423247.bin' '-l' '-1' '-v' '-w' '/tmp/graph15042748993568423247.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:34:05] [INFO ] Decomposing Gal with order
[2024-05-22 04:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:34:05] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 04:34:05] [INFO ] Flatten gal took : 13 ms
[2024-05-22 04:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 04:34:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10904103583022063934.gal : 2 ms
[2024-05-22 04:34:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1472524738521482585.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/CTLCardinality10904103583022063934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1472524738521482585.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00145e+20,8.24288,257652,19063,2514,685924,18639,723,535916,321,88530,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 361 transition count 309
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 361 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 361 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 355 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 355 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 354 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 354 transition count 294
Applied a total of 44 rules in 12 ms. Remains 354 /372 variables (removed 18) and now considering 294/320 (removed 26) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-22 04:34:36] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 04:34:36] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 04:34:36] [INFO ] Invariant cache hit.
[2024-05-22 04:34:36] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-22 04:34:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/648 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:34:42] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:34:42] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:34:42] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:34:42] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:34:49] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:34:49] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:34:49] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:34:50] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:34:51] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:34:51] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-22 04:34:53] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:34:53] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:34:53] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:34:54] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:34:57] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:34:57] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:34:57] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:34:57] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:34:57] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:35:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:35:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:35:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-22 04:35:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:35:05] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-22 04:35:05] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-22 04:35:05] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 4 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 451 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 35/97 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 04:35:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:35:11] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:35:11] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:35:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:35:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:35:13] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/648 variables, 354/469 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 293/762 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:35:29] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 764 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 55/55 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 354/372 places, 294/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 354/372 places, 294/320 transitions.
[2024-05-22 04:35:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:35:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:35:36] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-22 04:35:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:35:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:35:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality104072387148447253.gal : 10 ms
[2024-05-22 04:35:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5323586265503877783.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/CTLCardinality104072387148447253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5323586265503877783.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 04:36:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:36:06] [INFO ] Applying decomposition
[2024-05-22 04:36:06] [INFO ] Flatten gal took : 7 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/graph7432882079155980646.txt' '-o' '/tmp/graph7432882079155980646.bin' '-w' '/tmp/graph7432882079155980646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7432882079155980646.bin' '-l' '-1' '-v' '-w' '/tmp/graph7432882079155980646.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:36:06] [INFO ] Decomposing Gal with order
[2024-05-22 04:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:36:06] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 04:36:06] [INFO ] Flatten gal took : 27 ms
[2024-05-22 04:36:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 04:36:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality11616905895900923389.gal : 16 ms
[2024-05-22 04:36:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality12261490120605935982.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/CTLCardinality11616905895900923389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12261490120605935982.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.
[2024-05-22 04:36:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 04:36:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:36:37] [INFO ] Applying decomposition
[2024-05-22 04:36:37] [INFO ] Flatten gal took : 8 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/graph7997122567649397783.txt' '-o' '/tmp/graph7997122567649397783.bin' '-w' '/tmp/graph7997122567649397783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7997122567649397783.bin' '-l' '-1' '-v' '-w' '/tmp/graph7997122567649397783.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:36:37] [INFO ] Decomposing Gal with order
[2024-05-22 04:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:36:37] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 04:36:37] [INFO ] Flatten gal took : 15 ms
[2024-05-22 04:36:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-22 04:36:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5796330841258055549.gal : 4 ms
[2024-05-22 04:36:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1971004747782780232.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/CTLCardinality5796330841258055549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1971004747782780232.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.01261e+21,33.3619,808896,9838,2725,2.11243e+06,13091,779,1.44944e+06,337,74100,0


Converting to forward existential form...Done !
original formula: EG(EF(((AF((i4.i2.u26.p223==1)) * ((i10.i3.u75.p365==0)||(i1.i0.u8.p127==1))) * ((AF((u35.p94==1)) + EG((u80.p46==1))) + (EF(((i4.i1.u22....217
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(EG(!((i4.i2.u26.p223==1)))) * ((i10.i3.u75.p365==0)||(i1.i0.u8.p127==1))) * ((!(EG(!((u3...290
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t61, t236, t278, u80.t17, u35.t82, i1.t129, i1.i0.u8.t211, i1.i0.u8.t212, i1.i0.u8.t...1257
Detected timeout of ITS tools.
[2024-05-22 05:04:17] [INFO ] Applying decomposition
[2024-05-22 05:04:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:04:17] [INFO ] Decomposing Gal with order
[2024-05-22 05:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:04:17] [INFO ] Removed a total of 130 redundant transitions.
[2024-05-22 05:04:17] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:04:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 449 labels/synchronizations in 10 ms.
[2024-05-22 05:04:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11766766735910321380.gal : 19 ms
[2024-05-22 05:04:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality12131718325352878141.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/CTLCardinality11766766735910321380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12131718325352878141.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 8 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;