Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399800578.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 161K 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 BusinessProcesses-PT-17-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716336918182

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 00:15:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:15:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:15:19] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-22 00:15:19] [INFO ] Transformed 650 places.
[2024-05-22 00:15:19] [INFO ] Transformed 580 transitions.
[2024-05-22 00:15:19] [INFO ] Found NUPN structural information;
[2024-05-22 00:15:19] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Support contains 114 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 575 transition count 508
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 575 transition count 508
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 169 place count 545 transition count 478
Iterating global reduction 1 with 30 rules applied. Total rules applied 199 place count 545 transition count 478
Applied a total of 199 rules in 114 ms. Remains 545 /646 variables (removed 101) and now considering 478/576 (removed 98) transitions.
// Phase 1: matrix 478 rows 545 cols
[2024-05-22 00:15:19] [INFO ] Computed 105 invariants in 28 ms
[2024-05-22 00:15:20] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-22 00:15:20] [INFO ] Invariant cache hit.
[2024-05-22 00:15:20] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-22 00:15:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/545 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 40 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 115 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 109 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 110 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 108 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 127 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 121 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 109 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 110 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 108 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
SMT process timed out in 30265ms, After SMT, problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 30296ms
Starting structural reductions in LTL mode, iteration 1 : 545/646 places, 478/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31256 ms. Remains : 545/646 places, 478/576 transitions.
Support contains 114 out of 545 places after structural reductions.
[2024-05-22 00:15:51] [INFO ] Flatten gal took : 83 ms
[2024-05-22 00:15:51] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:15:51] [INFO ] Input system was already deterministic with 478 transitions.
RANDOM walk for 40000 steps (260 resets) in 1803 ms. (22 steps per ms) remains 40/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
[2024-05-22 00:15:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 341/420 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 118/538 variables, 45/104 constraints. Problems are: Problem set: 2 solved, 38 unsolved
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/124 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/539 variables, 1/125 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 474/1013 variables, 539/664 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1013 variables, 0/664 constraints. Problems are: Problem set: 2 solved, 38 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 10 (OVERLAPS) 9/1022 variables, 5/669 constraints. Problems are: Problem set: 3 solved, 37 unsolved
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
SMT process timed out in 5052ms, After SMT, problems are : Problem set: 3 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 544 transition count 434
Reduce places removed 43 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 501 transition count 429
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 97 place count 496 transition count 429
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 97 place count 496 transition count 336
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 295 place count 391 transition count 336
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 307 place count 379 transition count 324
Iterating global reduction 3 with 12 rules applied. Total rules applied 319 place count 379 transition count 324
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 540 place count 268 transition count 214
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 541 place count 268 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 542 place count 267 transition count 213
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 551 place count 267 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 552 place count 266 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 265 transition count 212
Applied a total of 553 rules in 147 ms. Remains 265 /545 variables (removed 280) and now considering 212/478 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 265/545 places, 212/478 transitions.
RANDOM walk for 40000 steps (1099 resets) in 873 ms. (45 steps per ms) remains 17/37 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (20 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
// Phase 1: matrix 212 rows 265 cols
[2024-05-22 00:15:57] [INFO ] Computed 91 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 92/118 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 34/152 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 68/220 variables, 31/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/224 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 2/226 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 211/437 variables, 226/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem AtomicPropp37 is UNSAT
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 14/321 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 16/337 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 4/341 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 5/347 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 2 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/437 variables, 15/362 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/437 variables, 5/367 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/437 variables, 2/369 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/437 variables, 0/369 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 40/477 variables, 39/408 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/477 variables, 18/426 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp52 is UNSAT
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/477 variables, 7/433 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/477 variables, 0/433 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 2 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/477 variables, 3/436 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/477 variables, 1/437 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/477 variables, 0/437 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/477 variables, 4/441 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/477 variables, 1/442 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/477 variables, 0/442 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 0/477 variables, 0/442 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 442 constraints, problems are : Problem set: 2 solved, 14 unsolved in 7665 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 92/114 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 0 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 60 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 8/23 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 60 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 61 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 62 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 4/27 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 34/148 variables, 21/48 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 3/51 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/52 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 69/217 variables, 31/83 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 17/100 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 20/120 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 20/140 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 2 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 20/160 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 17/177 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 3/180 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 4 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 20/200 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 8/208 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 4/221 variables, 4/212 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 5/217 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 2/219 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 20/239 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 7/246 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 7/253 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/221 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 2/223 variables, 2/255 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/223 variables, 18/273 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/223 variables, 0/273 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 30 (OVERLAPS) 210/433 variables, 223/496 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/433 variables, 7/503 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/433 variables, 0/503 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 33 (OVERLAPS) 44/477 variables, 42/545 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/477 variables, 19/564 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/477 variables, 7/571 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/477 variables, 42/613 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/477 variables, 0/613 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 38 (OVERLAPS) 0/477 variables, 0/613 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 613 constraints, problems are : Problem set: 2 solved, 14 unsolved in 15040 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 243/243 constraints]
After SMT, in 22735ms problems are : Problem set: 2 solved, 14 unsolved
Parikh walk visited 13 properties in 1644 ms.
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 212/212 transitions.
Graph (trivial) has 65 edges and 265 vertex of which 5 / 265 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 261 transition count 193
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 248 transition count 193
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 248 transition count 175
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 71 place count 222 transition count 175
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 81 place count 212 transition count 165
Iterating global reduction 2 with 10 rules applied. Total rules applied 91 place count 212 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 91 place count 212 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 211 transition count 164
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 147 place count 182 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
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 151 place count 180 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 180 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 179 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 178 transition count 158
Applied a total of 154 rules in 73 ms. Remains 178 /265 variables (removed 87) and now considering 158/212 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 178/265 places, 158/212 transitions.
RANDOM walk for 40000 steps (994 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (271 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Probably explored full state space saw : 11869 states, properties seen :0
Probabilistic random walk after 40295 steps, saw 11869 distinct states, run finished after 139 ms. (steps per millisecond=289 ) properties seen :0
Explored full state space saw : 11869 states, properties seen :0
Exhaustive walk after 40295 steps, saw 11869 distinct states, run finished after 98 ms. (steps per millisecond=411 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-22 00:16:22] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:16:22] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:16:22] [INFO ] Input system was already deterministic with 478 transitions.
Computed a total of 229 stabilizing places and 201 stable transitions
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 514 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 503 transition count 436
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 503 transition count 436
Applied a total of 84 rules in 36 ms. Remains 503 /545 variables (removed 42) and now considering 436/478 (removed 42) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-22 00:16:22] [INFO ] Computed 105 invariants in 12 ms
[2024-05-22 00:16:23] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-22 00:16:23] [INFO ] Invariant cache hit.
[2024-05-22 00:16:23] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2024-05-22 00:16:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 100 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 21 solved, 414 unsolved
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 28 solved, 407 unsolved
[2024-05-22 00:16:37] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:16:37] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:16:37] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:16:37] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:16:37] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:16:38] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:16:39] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:16:39] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:16:39] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:16:39] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:16:39] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:16:40] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:16:40] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 28 solved, 407 unsolved
[2024-05-22 00:16:43] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:44] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:16:45] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:16:46] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:16:46] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:16:46] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 28 solved, 407 unsolved
[2024-05-22 00:16:47] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:16:47] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:47] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:16:48] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:16:48] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:16:48] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:48] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:16:48] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:16:48] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 32 solved, 403 unsolved
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 3 ms to minimize.
SMT process timed out in 30207ms, After SMT, problems are : Problem set: 32 solved, 403 unsolved
Search for dead transitions found 32 dead transitions in 30212ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/545 places, 404/478 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 404
Applied a total of 1 rules in 8 ms. Remains 502 /503 variables (removed 1) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 502 cols
[2024-05-22 00:16:53] [INFO ] Computed 109 invariants in 6 ms
[2024-05-22 00:16:54] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 00:16:54] [INFO ] Invariant cache hit.
[2024-05-22 00:16:54] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 656 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 500/545 places, 404/478 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31742 ms. Remains : 500/545 places, 404/478 transitions.
[2024-05-22 00:16:54] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:16:54] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:16:54] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 00:16:54] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:16:54] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:16:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10231281994372752128.gal : 7 ms
[2024-05-22 00:16:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2246623970919662893.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/CTLFireability10231281994372752128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2246623970919662893.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 00:17:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:17:24] [INFO ] Applying decomposition
[2024-05-22 00:17:24] [INFO ] Flatten gal took : 14 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/graph12797158130714159200.txt' '-o' '/tmp/graph12797158130714159200.bin' '-w' '/tmp/graph12797158130714159200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12797158130714159200.bin' '-l' '-1' '-v' '-w' '/tmp/graph12797158130714159200.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:17:25] [INFO ] Decomposing Gal with order
[2024-05-22 00:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:17:25] [INFO ] Removed a total of 127 redundant transitions.
[2024-05-22 00:17:25] [INFO ] Flatten gal took : 71 ms
[2024-05-22 00:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2024-05-22 00:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7825882160824319832.gal : 9 ms
[2024-05-22 00:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9108362370302281076.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/CTLFireability7825882160824319832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9108362370302281076.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,1.98769e+26,1.3431,47984,6189,30,86218,522,1024,133900,50,1264,0


Converting to forward existential form...Done !
original formula: EX(EF(((EF((i17.i2.u130.p437==1)) * ((i4.u151.p543==1)||(i18.u137.p555==1))) * ((i8.i0.u26.p76==1)||(i16.i1.u101.p295==1)))))
=> equivalent forward existential formula: [(FwdU(((FwdU(EY(Init),TRUE) * ((i8.i0.u26.p76==1)||(i16.i1.u101.p295==1))) * ((i4.u151.p543==1)||(i18.u137.p555...202
(forward)formula 0,1,2.8086,69356,1,0,127746,522,2395,197236,91,1264,379377
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 515 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 515 transition count 448
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 505 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 505 transition count 438
Applied a total of 80 rules in 42 ms. Remains 505 /545 variables (removed 40) and now considering 438/478 (removed 40) transitions.
// Phase 1: matrix 438 rows 505 cols
[2024-05-22 00:17:28] [INFO ] Computed 105 invariants in 10 ms
[2024-05-22 00:17:28] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-22 00:17:28] [INFO ] Invariant cache hit.
[2024-05-22 00:17:28] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-22 00:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 426 unsolved
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 3 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/145 constraints. Problems are: Problem set: 20 solved, 417 unsolved
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/165 constraints. Problems are: Problem set: 33 solved, 404 unsolved
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 5 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/185 constraints. Problems are: Problem set: 33 solved, 404 unsolved
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/205 constraints. Problems are: Problem set: 33 solved, 404 unsolved
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 2 ms to minimize.
SMT process timed out in 30161ms, After SMT, problems are : Problem set: 33 solved, 404 unsolved
Search for dead transitions found 33 dead transitions in 30166ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 505/545 places, 405/478 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 405
Applied a total of 1 rules in 9 ms. Remains 504 /505 variables (removed 1) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 504 cols
[2024-05-22 00:17:59] [INFO ] Computed 110 invariants in 6 ms
[2024-05-22 00:17:59] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 00:17:59] [INFO ] Invariant cache hit.
[2024-05-22 00:17:59] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 659 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 502/545 places, 405/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31609 ms. Remains : 502/545 places, 405/478 transitions.
[2024-05-22 00:17:59] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:17:59] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:17:59] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-22 00:17:59] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:17:59] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:17:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8947420469264191028.gal : 4 ms
[2024-05-22 00:17:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15898572576182583398.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/CTLFireability8947420469264191028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15898572576182583398.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 00:18:29] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:18:29] [INFO ] Applying decomposition
[2024-05-22 00:18:29] [INFO ] Flatten gal took : 20 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/graph7973584058179892961.txt' '-o' '/tmp/graph7973584058179892961.bin' '-w' '/tmp/graph7973584058179892961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7973584058179892961.bin' '-l' '-1' '-v' '-w' '/tmp/graph7973584058179892961.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:18:29] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:30] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-22 00:18:30] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 11 ms.
[2024-05-22 00:18:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9086808022756707071.gal : 7 ms
[2024-05-22 00:18:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17476746358706003524.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/CTLFireability9086808022756707071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17476746358706003524.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.03367e+26,0.504191,25528,3710,31,41196,526,1028,84547,50,1378,0


Converting to forward existential form...Done !
original formula: (EX(EF((i19.u164.p601==1))) * ((EF((i18.i1.u118.p377==0)) + EG((i19.u137.p530==1))) + AG(AF((AF((i6.u28.p85==1)) * (i6.u11.p23==1))))))
=> equivalent forward existential formula: ([(Init * !(EX(E(TRUE U (i19.u164.p601==1)))))] = FALSE * [FwdG(FwdU((Init * !((E(TRUE U (i18.i1.u118.p377==0)) ...248
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t175, t183, t187, t195, t273, t281, t285, t386, t387, t389, t390, t398, i0.i0.u135.t...1376
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
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 515 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 515 transition count 448
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 506 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 506 transition count 439
Applied a total of 78 rules in 45 ms. Remains 506 /545 variables (removed 39) and now considering 439/478 (removed 39) transitions.
// Phase 1: matrix 439 rows 506 cols
[2024-05-22 00:19:00] [INFO ] Computed 105 invariants in 6 ms
[2024-05-22 00:19:00] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-22 00:19:00] [INFO ] Invariant cache hit.
[2024-05-22 00:19:01] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-05-22 00:19:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/506 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 20/125 constraints. Problems are: Problem set: 7 solved, 431 unsolved
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 20/145 constraints. Problems are: Problem set: 10 solved, 428 unsolved
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 116 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 2 ms to minimize.
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 20/165 constraints. Problems are: Problem set: 16 solved, 422 unsolved
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 117 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 20/185 constraints. Problems are: Problem set: 18 solved, 420 unsolved
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 20/205 constraints. Problems are: Problem set: 23 solved, 415 unsolved
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 20/225 constraints. Problems are: Problem set: 33 solved, 405 unsolved
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:31] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 33 solved, 405 unsolved
Search for dead transitions found 33 dead transitions in 30114ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 506/545 places, 406/478 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 505 transition count 406
Applied a total of 1 rules in 9 ms. Remains 505 /506 variables (removed 1) and now considering 406/406 (removed 0) transitions.
// Phase 1: matrix 406 rows 505 cols
[2024-05-22 00:19:31] [INFO ] Computed 110 invariants in 4 ms
[2024-05-22 00:19:31] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 00:19:31] [INFO ] Invariant cache hit.
[2024-05-22 00:19:31] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 689 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 503/545 places, 406/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31720 ms. Remains : 503/545 places, 406/478 transitions.
[2024-05-22 00:19:31] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:19:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:19:31] [INFO ] Input system was already deterministic with 406 transitions.
[2024-05-22 00:19:31] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:19:31] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:19:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17863237118724199387.gal : 4 ms
[2024-05-22 00:19:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1015075097266582473.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/CTLFireability17863237118724199387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1015075097266582473.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 00:20:02] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:20:02] [INFO ] Applying decomposition
[2024-05-22 00:20:02] [INFO ] Flatten gal took : 20 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/graph14480297393511087596.txt' '-o' '/tmp/graph14480297393511087596.bin' '-w' '/tmp/graph14480297393511087596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14480297393511087596.bin' '-l' '-1' '-v' '-w' '/tmp/graph14480297393511087596.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:02] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:02] [INFO ] Removed a total of 128 redundant transitions.
[2024-05-22 00:20:02] [INFO ] Flatten gal took : 49 ms
[2024-05-22 00:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-22 00:20:02] [INFO ] Time to serialize gal into /tmp/CTLFireability16802172927943292214.gal : 16 ms
[2024-05-22 00:20:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2736228083502757267.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/CTLFireability16802172927943292214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2736228083502757267.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.10496e+26,3.6086,115808,11954,33,186413,509,1046,333436,57,1133,0


Converting to forward existential form...Done !
original formula: (EG(AF(AG((((i2.u27.p86==0)||(i5.i3.u112.p355==0))||(i20.i1.u136.p611==0))))) * (EG(EF(((AF((i19.i2.u110.p347==1)) * (i9.i2.u175.p640==0)...462
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!(!(E(TRUE U !((((i2.u27.p86==0)||(i5.i3.u112.p355==0))||(i20.i1.u136.p611==0)))))))))))] = ...890
Reverse transition relation is NOT exact ! Due to transitions t176, t184, t188, t196, t274, t286, t386, t388, t390, t391, t399, i0.t180, i0.u76.t191, i0.u8...1402
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 537 transition count 395
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 463 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 414 place count 306 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 445 place count 305 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 445 place count 305 transition count 256
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 449 place count 303 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 693 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 694 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 177 transition count 135
Applied a total of 695 rules in 96 ms. Remains 177 /545 variables (removed 368) and now considering 135/478 (removed 343) transitions.
// Phase 1: matrix 135 rows 177 cols
[2024-05-22 00:20:32] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 00:20:32] [INFO ] Implicit Places using invariants in 132 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 133 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/545 places, 135/478 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 236 ms. Remains : 156/545 places, 135/478 transitions.
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:20:32] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:20:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11803243627560561687.gal : 2 ms
[2024-05-22 00:20:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3026731319657771236.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/ReachabilityCardinality11803243627560561687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3026731319657771236.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 415 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 689 place count 182 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 690 place count 181 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 691 place count 180 transition count 136
Applied a total of 691 rules in 110 ms. Remains 180 /545 variables (removed 365) and now considering 136/478 (removed 342) transitions.
// Phase 1: matrix 136 rows 180 cols
[2024-05-22 00:20:32] [INFO ] Computed 81 invariants in 2 ms
[2024-05-22 00:20:32] [INFO ] Implicit Places using invariants in 184 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 44, 52, 53, 54, 55, 56, 57, 58]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 186 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/545 places, 136/478 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 300 ms. Remains : 159/545 places, 136/478 transitions.
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:20:33] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18253104919474237048.gal : 1 ms
[2024-05-22 00:20:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15796095792352538322.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/ReachabilityCardinality18253104919474237048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15796095792352538322.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 ...330
Loading property file /tmp/ReachabilityCardinality15796095792352538322.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 450
Reachability property BusinessProcesses-PT-17-CTLFireability-2024-04 is true.
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,1974,0.049802,4852,2,575,12,2233,6,0,772,1024,0
Total reachable state count : 1974

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-17-CTLFireability-2024-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-17-CTLFireability-2024-04,48,0.050414,5212,2,202,12,2233,7,0,781,1024,0
RANDOM walk for 40000 steps (6815 resets) in 502 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1686 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 98 steps, run visited all 1 properties in 10 ms. (steps per millisecond=9 )
Probabilistic random walk after 98 steps, saw 70 distinct states, run finished after 14 ms. (steps per millisecond=7 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 152 place count 462 transition count 287
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 386 place count 335 transition count 287
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 416 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 695 place count 178 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 177 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 697 place count 176 transition count 134
Applied a total of 697 rules in 43 ms. Remains 176 /545 variables (removed 369) and now considering 134/478 (removed 344) transitions.
// Phase 1: matrix 134 rows 176 cols
[2024-05-22 00:20:33] [INFO ] Computed 79 invariants in 1 ms
[2024-05-22 00:20:33] [INFO ] Implicit Places using invariants in 139 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 141 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 155/545 places, 134/478 transitions.
Applied a total of 0 rules in 10 ms. Remains 155 /155 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 199 ms. Remains : 155/545 places, 134/478 transitions.
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:33] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:20:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3448801415165842900.gal : 1 ms
[2024-05-22 00:20:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7217267045884719009.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/CTLFireability3448801415165842900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7217267045884719009.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.
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,13278,0.096637,6924,2,1856,5,11939,6,0,754,8580,0


Converting to forward existential form...Done !
original formula: EF(AG((p533==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p533==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t26, t28, t29, t30, t31, t32, t60, t61, t62, t63, t64, t90, t91, t92, t106, t109, t110, t...260
(forward)formula 0,0,0.536593,28632,1,0,171,98562,253,91,5568,60828,244
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 516 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 505 transition count 438
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 505 transition count 438
Applied a total of 80 rules in 45 ms. Remains 505 /545 variables (removed 40) and now considering 438/478 (removed 40) transitions.
// Phase 1: matrix 438 rows 505 cols
[2024-05-22 00:20:34] [INFO ] Computed 105 invariants in 11 ms
[2024-05-22 00:20:34] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-22 00:20:34] [INFO ] Invariant cache hit.
[2024-05-22 00:20:35] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-22 00:20:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/125 constraints. Problems are: Problem set: 18 solved, 419 unsolved
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 114 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 115 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 3 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/145 constraints. Problems are: Problem set: 27 solved, 410 unsolved
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/165 constraints. Problems are: Problem set: 27 solved, 410 unsolved
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
Problem TDEAD389 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/185 constraints. Problems are: Problem set: 28 solved, 409 unsolved
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/205 constraints. Problems are: Problem set: 28 solved, 409 unsolved
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/225 constraints. Problems are: Problem set: 28 solved, 409 unsolved
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:21:05] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:21:05] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 28 solved, 409 unsolved
Search for dead transitions found 28 dead transitions in 30191ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 505/545 places, 410/478 transitions.
Applied a total of 0 rules in 7 ms. Remains 505 /505 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31117 ms. Remains : 505/545 places, 410/478 transitions.
[2024-05-22 00:21:05] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:21:05] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:21:05] [INFO ] Input system was already deterministic with 410 transitions.
[2024-05-22 00:21:05] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:21:05] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:21:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12115093587189571314.gal : 2 ms
[2024-05-22 00:21:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17394295630490969683.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/CTLFireability12115093587189571314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17394295630490969683.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 00:21:35] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:21:35] [INFO ] Applying decomposition
[2024-05-22 00:21:35] [INFO ] Flatten gal took : 20 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/graph10346405580531487440.txt' '-o' '/tmp/graph10346405580531487440.bin' '-w' '/tmp/graph10346405580531487440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10346405580531487440.bin' '-l' '-1' '-v' '-w' '/tmp/graph10346405580531487440.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:21:35] [INFO ] Decomposing Gal with order
[2024-05-22 00:21:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:21:35] [INFO ] Removed a total of 137 redundant transitions.
[2024-05-22 00:21:35] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:21:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-22 00:21:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3019930281710732257.gal : 6 ms
[2024-05-22 00:21:35] [INFO ] Time to serialize properties into /tmp/CTLFireability562107239837090964.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/CTLFireability3019930281710732257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability562107239837090964.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 -...261
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,1.95522e+26,0.975118,37168,5278,43,62722,709,1043,143247,56,1983,0


Converting to forward existential form...Done !
original formula: (EF((EX(((EX((i21.u143.p573==1)) + (((i12.i0.u73.p219==1)&&(i21.u137.p468==1))&&((((i2.u49.p149==1)&&(i20.i1.u115.p361==1))&&(i2.u151.p54...412
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U (EX(((EX((i21.u143.p573==1)) + (((i12.i0.u73.p219==1)&&(i21.u137.p468==1))&&((((i2.u49.p...691
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t10, t178, t186, t194, t272, t294, t391, t392, t394, t403, i0.t174, i0.i0.u134.t76, i...1342
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
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 268 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 537 transition count 396
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 464 transition count 396
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 148 place count 464 transition count 291
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 376 place count 341 transition count 291
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 407 place count 310 transition count 260
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 439 place count 309 transition count 260
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 439 place count 309 transition count 258
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 443 place count 307 transition count 258
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 687 place count 183 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 182 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 181 transition count 137
Applied a total of 689 rules in 81 ms. Remains 181 /545 variables (removed 364) and now considering 137/478 (removed 341) transitions.
// Phase 1: matrix 137 rows 181 cols
[2024-05-22 00:22:05] [INFO ] Computed 81 invariants in 1 ms
[2024-05-22 00:22:05] [INFO ] Implicit Places using invariants in 134 ms returned [0, 1, 2, 3, 4, 8, 9, 35, 36, 37, 38, 45, 46, 47, 52, 53, 54, 55, 56, 57, 58, 137, 155]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 136 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 158/545 places, 137/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 221 ms. Remains : 158/545 places, 137/478 transitions.
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:22:05] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:22:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4215751536876979536.gal : 1 ms
[2024-05-22 00:22:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4050969027211497886.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/CTLFireability4215751536876979536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4050969027211497886.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.
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,14094,0.105445,7200,2,1877,5,12000,6,0,769,8751,0


Converting to forward existential form...Done !
original formula: EG(!(E((p252==1) U (p90==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E((p252==1) U (p90==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t32, t33, t34, t35, t60, t61, t62, t63, t64, t89, t90, t91, t108, t111, t112, t113,...262
(forward)formula 0,1,1.15785,48020,1,0,269,179618,263,233,5651,205831,390
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 512 transition count 445
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 512 transition count 445
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 501 transition count 434
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 501 transition count 434
Applied a total of 88 rules in 19 ms. Remains 501 /545 variables (removed 44) and now considering 434/478 (removed 44) transitions.
// Phase 1: matrix 434 rows 501 cols
[2024-05-22 00:22:07] [INFO ] Computed 105 invariants in 9 ms
[2024-05-22 00:22:07] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-22 00:22:07] [INFO ] Invariant cache hit.
[2024-05-22 00:22:07] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-22 00:22:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:22:17] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:22:18] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 422 unsolved
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:22:19] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:20] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 5 ms to minimize.
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 69 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 4 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 21 solved, 412 unsolved
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 29 solved, 404 unsolved
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/935 variables, and 221 constraints, problems are : Problem set: 29 solved, 404 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 29 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 42/42 constraints. Problems are: Problem set: 29 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/42 constraints. Problems are: Problem set: 29 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/103 constraints. Problems are: Problem set: 29 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 2/105 constraints. Problems are: Problem set: 29 solved, 404 unsolved
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 116/221 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:43] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:22:43] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:22:43] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:22:43] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:22:43] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:22:43] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/241 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/261 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/281 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:54] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/301 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:22:59] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:22:59] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:59] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:22:59] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:22:59] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:23:00] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:00] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:00] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:23:00] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:23:00] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/321 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:23:01] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:01] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/341 constraints. Problems are: Problem set: 36 solved, 397 unsolved
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/935 variables, and 346 constraints, problems are : Problem set: 36 solved, 397 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/433 constraints, Known Traps: 241/241 constraints]
After SMT, in 60110ms problems are : Problem set: 36 solved, 397 unsolved
Search for dead transitions found 36 dead transitions in 60114ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/545 places, 398/478 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 498 transition count 398
Applied a total of 3 rules in 9 ms. Remains 498 /501 variables (removed 3) and now considering 398/398 (removed 0) transitions.
// Phase 1: matrix 398 rows 498 cols
[2024-05-22 00:23:08] [INFO ] Computed 111 invariants in 3 ms
[2024-05-22 00:23:08] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 00:23:08] [INFO ] Invariant cache hit.
[2024-05-22 00:23:08] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/545 places, 398/478 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61564 ms. Remains : 498/545 places, 398/478 transitions.
[2024-05-22 00:23:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:23:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:08] [INFO ] Input system was already deterministic with 398 transitions.
[2024-05-22 00:23:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:23:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:23:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13325732931740599606.gal : 2 ms
[2024-05-22 00:23:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5834450206046571057.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/CTLFireability13325732931740599606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5834450206046571057.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 00:23:38] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:23:38] [INFO ] Applying decomposition
[2024-05-22 00:23:38] [INFO ] Flatten gal took : 18 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/graph1089249428256702088.txt' '-o' '/tmp/graph1089249428256702088.bin' '-w' '/tmp/graph1089249428256702088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1089249428256702088.bin' '-l' '-1' '-v' '-w' '/tmp/graph1089249428256702088.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:23:38] [INFO ] Decomposing Gal with order
[2024-05-22 00:23:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:23:38] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 00:23:38] [INFO ] Flatten gal took : 33 ms
[2024-05-22 00:23:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 11 ms.
[2024-05-22 00:23:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16701879702553651181.gal : 6 ms
[2024-05-22 00:23:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2678543488210978595.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/CTLFireability16701879702553651181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2678543488210978595.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,1.95422e+26,1.1269,44592,4557,30,72270,440,1016,139362,48,994,0


Converting to forward existential form...Done !
original formula: (AF((i15.i0.u94.p280==1)) + AG(AF(EX(((((i4.u51.p157==0)||(i10.i1.u116.p371==0))||(i4.u152.p552==0))&&(i14.u92.p276==0))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!(EG(!((i15.i0.u94.p280==1)))))),TRUE),!(EX(((((i4.u51.p157==0)||(i10.i1.u116.p371==0))||(i...203
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t171, t179, t269, t277, t281, t379, t380, t382, t383, t391, i0.i0.u83.t174, i0.i0.u8...1336
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
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 516 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 516 transition count 449
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 506 transition count 439
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 506 transition count 439
Applied a total of 78 rules in 35 ms. Remains 506 /545 variables (removed 39) and now considering 439/478 (removed 39) transitions.
// Phase 1: matrix 439 rows 506 cols
[2024-05-22 00:24:08] [INFO ] Computed 105 invariants in 3 ms
[2024-05-22 00:24:09] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 00:24:09] [INFO ] Invariant cache hit.
[2024-05-22 00:24:09] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-05-22 00:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/506 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 2 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 20/125 constraints. Problems are: Problem set: 13 solved, 425 unsolved
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 20/145 constraints. Problems are: Problem set: 18 solved, 420 unsolved
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 2 ms to minimize.
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 20/165 constraints. Problems are: Problem set: 20 solved, 418 unsolved
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 20/185 constraints. Problems are: Problem set: 25 solved, 413 unsolved
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 20/205 constraints. Problems are: Problem set: 25 solved, 413 unsolved
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
SMT process timed out in 30145ms, After SMT, problems are : Problem set: 25 solved, 413 unsolved
Search for dead transitions found 25 dead transitions in 30151ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 506/545 places, 414/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 506 /506 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30903 ms. Remains : 506/545 places, 414/478 transitions.
[2024-05-22 00:24:39] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:24:39] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:39] [INFO ] Input system was already deterministic with 414 transitions.
[2024-05-22 00:24:39] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:24:39] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8947005772778793180.gal : 3 ms
[2024-05-22 00:24:39] [INFO ] Time to serialize properties into /tmp/CTLFireability684261111970410530.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/CTLFireability8947005772778793180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability684261111970410530.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 00:25:09] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:25:09] [INFO ] Applying decomposition
[2024-05-22 00:25:09] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15250155216119789191.txt' '-o' '/tmp/graph15250155216119789191.bin' '-w' '/tmp/graph15250155216119789191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15250155216119789191.bin' '-l' '-1' '-v' '-w' '/tmp/graph15250155216119789191.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:10] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:10] [INFO ] Removed a total of 154 redundant transitions.
[2024-05-22 00:25:10] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 00:25:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18292450760577043891.gal : 4 ms
[2024-05-22 00:25:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10240488634915826553.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/CTLFireability18292450760577043891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10240488634915826553.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.
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.02544e+26,0.77566,36716,5341,36,60734,551,956,156029,54,1252,0


Converting to forward existential form...Done !
original formula: (AX(AF(((i15.i1.i1.u122.p379==0)&&((i16.u150.p533==1)||(i6.u31.p93==1))))) + EX(EX(EX(AG((i16.u156.p558==0))))))
=> equivalent forward existential formula: [FwdG(EY((Init * !(EX(EX(EX(!(E(TRUE U !((i16.u156.p558==0)))))))))),!(((i15.i1.i1.u122.p379==0)&&((i16.u150.p53...190
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t183, t286, t394, t396, t398, t399, t407, i0.t195, i0.u73.t202, i0.u75.t198, i1.u...1266
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 520 transition count 453
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 520 transition count 453
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 512 transition count 445
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 512 transition count 445
Applied a total of 66 rules in 36 ms. Remains 512 /545 variables (removed 33) and now considering 445/478 (removed 33) transitions.
// Phase 1: matrix 445 rows 512 cols
[2024-05-22 00:25:40] [INFO ] Computed 105 invariants in 8 ms
[2024-05-22 00:25:40] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 00:25:40] [INFO ] Invariant cache hit.
[2024-05-22 00:25:41] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-05-22 00:25:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/512 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 00:25:48] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 20/125 constraints. Problems are: Problem set: 17 solved, 427 unsolved
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 20/145 constraints. Problems are: Problem set: 21 solved, 423 unsolved
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 80 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:25:56] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:25:56] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:25:56] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:25:57] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:25:57] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:25:57] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:25:57] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:25:57] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:25:57] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 20/165 constraints. Problems are: Problem set: 21 solved, 423 unsolved
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 11 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 20/185 constraints. Problems are: Problem set: 25 solved, 419 unsolved
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 20/205 constraints. Problems are: Problem set: 27 solved, 417 unsolved
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 117 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 27 solved, 417 unsolved
Search for dead transitions found 27 dead transitions in 30167ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 512/545 places, 418/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 512 /512 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31126 ms. Remains : 512/545 places, 418/478 transitions.
[2024-05-22 00:26:11] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:26:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:26:11] [INFO ] Input system was already deterministic with 418 transitions.
[2024-05-22 00:26:11] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:26:11] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability18072048894485372371.gal : 3 ms
[2024-05-22 00:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability18405602430488376119.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/CTLFireability18072048894485372371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18405602430488376119.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 00:26:41] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:26:41] [INFO ] Applying decomposition
[2024-05-22 00:26:41] [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/graph4732574607795480759.txt' '-o' '/tmp/graph4732574607795480759.bin' '-w' '/tmp/graph4732574607795480759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4732574607795480759.bin' '-l' '-1' '-v' '-w' '/tmp/graph4732574607795480759.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:26:41] [INFO ] Decomposing Gal with order
[2024-05-22 00:26:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:26:41] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-22 00:26:41] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:26:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability945728543748311911.gal : 5 ms
[2024-05-22 00:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11107128615853021947.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/CTLFireability945728543748311911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11107128615853021947.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,2.02081e+26,1.99522,58328,5466,40,98434,633,1092,247016,55,1823,0


Converting to forward existential form...Done !
original formula: (!(E(((i18.u160.p568==1) + A((i11.u92.p273!=1) U E((i10.u72.p213==1) U (i20.u173.p618==1)))) U EF((i16.i2.u118.p362==1)))) * (AF(AG(A(A((...510
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,((i18.u160.p568==1) + !((E(!(E((i10.u72.p213==1) U (i20.u173.p618==1))) U (!((i11.u92.p273!=1)...1526
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t180, t188, t280, t292, t399, t400, t402, t403, t411, i0.i0.u88.t175, i0.i0.u140.t73...1421
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 543 transition count 410
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 477 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 475 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 137 place count 475 transition count 297
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 378 place count 345 transition count 297
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 410 place count 313 transition count 265
Ensure Unique test removed 1 places
Iterating global reduction 3 with 33 rules applied. Total rules applied 443 place count 312 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 443 place count 312 transition count 263
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 447 place count 310 transition count 263
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 687 place count 188 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 688 place count 187 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 186 transition count 144
Applied a total of 689 rules in 61 ms. Remains 186 /545 variables (removed 359) and now considering 144/478 (removed 334) transitions.
// Phase 1: matrix 144 rows 186 cols
[2024-05-22 00:27:11] [INFO ] Computed 80 invariants in 1 ms
[2024-05-22 00:27:11] [INFO ] Implicit Places using invariants in 103 ms returned [53, 54, 55, 56, 57, 58, 59]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 104 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 179/545 places, 144/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 170 ms. Remains : 179/545 places, 144/478 transitions.
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:11] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2082179059892680424.gal : 1 ms
[2024-05-22 00:27:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2896797811768587368.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/CTLFireability2082179059892680424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2896797811768587368.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.
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,156812,0.113672,8888,2,3275,5,18092,6,0,860,14599,0


Converting to forward existential form...Done !
original formula: AF(E(!((((p265==1)&&(p461==1))&&(p611==1))) U ((((p191==1)&&(p415==1))&&(p611==1))||(((p182==1)&&(p391==1))&&(p566==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!((((p265==1)&&(p461==1))&&(p611==1))) U ((((p191==1)&&(p415==1))&&(p611==1))||(((p182==1)&&(p391...185
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t38, t39, t40, t42, t43, t68, t69, t70, t71, t72, t96, t102, t103, t104, t121, t124...275
(forward)formula 0,0,2.31862,80744,1,0,477,339884,279,279,6363,328057,568
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 514 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 514 transition count 447
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 504 transition count 437
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 504 transition count 437
Applied a total of 82 rules in 37 ms. Remains 504 /545 variables (removed 41) and now considering 437/478 (removed 41) transitions.
// Phase 1: matrix 437 rows 504 cols
[2024-05-22 00:27:14] [INFO ] Computed 105 invariants in 5 ms
[2024-05-22 00:27:14] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 00:27:14] [INFO ] Invariant cache hit.
[2024-05-22 00:27:14] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2024-05-22 00:27:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 425 unsolved
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/145 constraints. Problems are: Problem set: 17 solved, 419 unsolved
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/165 constraints. Problems are: Problem set: 21 solved, 415 unsolved
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 20/185 constraints. Problems are: Problem set: 21 solved, 415 unsolved
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 20/205 constraints. Problems are: Problem set: 21 solved, 415 unsolved
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 20/225 constraints. Problems are: Problem set: 21 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/941 variables, and 225 constraints, problems are : Problem set: 21 solved, 415 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 21 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 42/42 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/42 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 59/101 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 4/105 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 120/225 constraints. Problems are: Problem set: 21 solved, 415 unsolved
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/245 constraints. Problems are: Problem set: 25 solved, 411 unsolved
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/265 constraints. Problems are: Problem set: 29 solved, 407 unsolved
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 20/285 constraints. Problems are: Problem set: 29 solved, 407 unsolved
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 20/305 constraints. Problems are: Problem set: 29 solved, 407 unsolved
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 20/325 constraints. Problems are: Problem set: 29 solved, 407 unsolved
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 5 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 20/345 constraints. Problems are: Problem set: 29 solved, 407 unsolved
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/941 variables, and 347 constraints, problems are : Problem set: 29 solved, 407 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 0/436 constraints, Known Traps: 242/242 constraints]
After SMT, in 60121ms problems are : Problem set: 29 solved, 407 unsolved
Search for dead transitions found 29 dead transitions in 60126ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 504/545 places, 408/478 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60904 ms. Remains : 504/545 places, 408/478 transitions.
[2024-05-22 00:28:15] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:28:15] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:28:15] [INFO ] Input system was already deterministic with 408 transitions.
[2024-05-22 00:28:15] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:28:15] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7575574434786825679.gal : 9 ms
[2024-05-22 00:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6734680660325453414.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/CTLFireability7575574434786825679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6734680660325453414.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 00:28:45] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:28:45] [INFO ] Applying decomposition
[2024-05-22 00:28:45] [INFO ] Flatten gal took : 19 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/graph1947497313804274531.txt' '-o' '/tmp/graph1947497313804274531.bin' '-w' '/tmp/graph1947497313804274531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1947497313804274531.bin' '-l' '-1' '-v' '-w' '/tmp/graph1947497313804274531.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:28:45] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:45] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 00:28:45] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:28:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 00:28:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6716352724418337136.gal : 6 ms
[2024-05-22 00:28:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2793223436340483873.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/CTLFireability6716352724418337136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2793223436340483873.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,1.98808e+26,0.825412,27160,3315,58,41917,1204,1090,83368,64,2718,0


Converting to forward existential form...Done !
original formula: EF((!(E(!(E((i16.i2.u133.p439==1) U (i17.u176.p636==1))) U AG((i17.u153.p550==1)))) + EX(EX((i9.i1.u55.p163==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(!(E((i16.i2.u133.p439==1) U (i17.u176.p636==1))) U !(E(TRUE U !((i17.u153.p550==1))))))...228
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t174, t182, t186, t194, t272, t284, t389, t390, t392, t393, t401, i0.i0.u136.t73, i0...1342
(forward)formula 0,1,4.58244,157840,1,0,309085,1438,6825,569518,307,2813,735182
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 270 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 537 transition count 395
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 463 transition count 395
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 150 place count 463 transition count 289
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 382 place count 337 transition count 289
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 412 place count 307 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 443 place count 306 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 443 place count 306 transition count 257
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 693 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 695 place count 177 transition count 135
Applied a total of 695 rules in 24 ms. Remains 177 /545 variables (removed 368) and now considering 135/478 (removed 343) transitions.
// Phase 1: matrix 135 rows 177 cols
[2024-05-22 00:28:49] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 00:28:50] [INFO ] Implicit Places using invariants in 135 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 136 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/545 places, 135/478 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 171 ms. Remains : 156/545 places, 135/478 transitions.
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:28:50] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15158027572900335629.gal : 1 ms
[2024-05-22 00:28:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16916945213075108776.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/ReachabilityCardinality15158027572900335629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16916945213075108776.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 543 transition count 410
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 477 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 475 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 137 place count 475 transition count 297
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 378 place count 345 transition count 297
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 408 place count 315 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 439 place count 314 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 439 place count 314 transition count 265
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 443 place count 312 transition count 265
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 683 place count 190 transition count 147
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 684 place count 190 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 189 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 188 transition count 146
Applied a total of 686 rules in 39 ms. Remains 188 /545 variables (removed 357) and now considering 146/478 (removed 332) transitions.
// Phase 1: matrix 146 rows 188 cols
[2024-05-22 00:28:50] [INFO ] Computed 80 invariants in 2 ms
[2024-05-22 00:28:50] [INFO ] Implicit Places using invariants in 149 ms returned [0, 1, 2, 3, 11, 12, 37, 38, 39, 40, 47, 48, 49, 54, 55, 56, 57, 58, 59, 60]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 149 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 168/545 places, 146/478 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 192 ms. Remains : 168/545 places, 146/478 transitions.
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:28:50] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12352341136558158697.gal : 2 ms
[2024-05-22 00:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability780584707444669289.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/CTLFireability12352341136558158697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability780584707444669289.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.
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,61376,0.227822,10456,2,2766,5,21806,6,0,818,20468,0


Converting to forward existential form...Done !
original formula: EG(AG((((p295==0)||(((p63==0)&&((p110==0)||(p538==0)))&&((p469==0)||(p58==0))))||((p470==0)&&(((p75==0)||(p345==0))||(p611==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((p295==0)||(((p63==0)&&((p110==0)||(p538==0)))&&((p469==0)||(p58==0))))||((p470==0)&&(...204
Reverse transition relation is NOT exact ! Due to transitions t10, t38, t40, t42, t43, t44, t45, t46, t68, t69, t70, t71, t72, t99, t100, t102, t103, t104,...286
(forward)formula 0,0,1.34935,44004,1,0,223,159502,284,107,6097,91426,276
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 415 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 691 place count 180 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 692 place count 179 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 693 place count 178 transition count 136
Applied a total of 693 rules in 56 ms. Remains 178 /545 variables (removed 367) and now considering 136/478 (removed 342) transitions.
// Phase 1: matrix 136 rows 178 cols
[2024-05-22 00:28:51] [INFO ] Computed 79 invariants in 1 ms
[2024-05-22 00:28:51] [INFO ] Implicit Places using invariants in 144 ms returned [0, 1, 2, 3, 4, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 145 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 157/545 places, 136/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 205 ms. Remains : 157/545 places, 136/478 transitions.
[2024-05-22 00:28:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:51] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 00:28:51] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:28:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:28:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12596275896057360327.gal : 2 ms
[2024-05-22 00:28:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11146738532603551803.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/ReachabilityCardinality12596275896057360327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11146738532603551803.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 ...330
Loading property file /tmp/ReachabilityCardinality11146738532603551803.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 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 102
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :102 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 240
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1704 after 1728
RANDOM walk for 40000 steps (6915 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1728 after 3252
Invariant property BusinessProcesses-PT-17-CTLFireability-2023-15 does not hold.
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-15 FALSE 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 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,10878,0.104968,6892,2,2203,14,9648,6,0,764,5804,0
Total reachable state count : 10878

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-17-CTLFireability-2023-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-17-CTLFireability-2023-15,1,0.106171,6892,2,158,14,9648,7,0,772,5804,0
BEST_FIRST walk for 40003 steps (1673 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 520 steps, run visited all 1 properties in 5 ms. (steps per millisecond=104 )
Probabilistic random walk after 520 steps, saw 261 distinct states, run finished after 5 ms. (steps per millisecond=104 ) properties seen :1
[2024-05-22 00:28:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:28:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:28:52] [INFO ] Applying decomposition
[2024-05-22 00:28:52] [INFO ] Flatten gal took : 17 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/graph12089677483143222789.txt' '-o' '/tmp/graph12089677483143222789.bin' '-w' '/tmp/graph12089677483143222789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12089677483143222789.bin' '-l' '-1' '-v' '-w' '/tmp/graph12089677483143222789.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:28:52] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:52] [INFO ] Removed a total of 271 redundant transitions.
[2024-05-22 00:28:52] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 00:28:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3924749820754950650.gal : 6 ms
[2024-05-22 00:28:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8418751706579664635.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/CTLFireability3924749820754950650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8418751706579664635.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 6 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.67774e+26,2.88946,99412,7549,99,166794,1271,1074,641776,85,4019,0


Converting to forward existential form...Done !
original formula: (EX(EF((i19.u187.p601==1))) * ((EF((i6.u129.p377==0)) + EG((i18.u154.p530==1))) + AG(AF((AF((i11.u32.p85==1)) * (i4.u10.p23==1))))))
=> equivalent forward existential formula: ([(Init * !(EX(E(TRUE U (i19.u187.p601==1)))))] = FALSE * [FwdG(FwdU((Init * !((E(TRUE U (i6.u129.p377==0)) + EG...245
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t205, t209, t217, t225, t324, t459, t460, t462, t471, i0.u152.t93, i0.u153.t9...1553
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,232.716,2422624,1,0,2.6088e+06,1412,3786,1.8432e+07,232,4134,665564
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(AF(AG((((i10.u33.p86==0)||(i12.u123.p355==0))||(i19.u156.p611==0))))) * (EG(EF(((AF((i10.u120.p347==1)) * (i7.u200.p640==0)) * (((i7....449
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!(!(E(TRUE U !((((i10.u33.p86==0)||(i12.u123.p355==0))||(i19.u156.p611==0)))))))))))] = FALS...877
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
[2024-05-22 00:53:22] [INFO ] Applying decomposition
[2024-05-22 00:53:22] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:53:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:53:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:53:22] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-22 00:53:22] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 123 ms.
[2024-05-22 00:53:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12557942087094555241.gal : 8 ms
[2024-05-22 00:53:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6929441198142655090.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/CTLFireability12557942087094555241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6929441198142655090.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 5 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:59:36] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:59:36] [INFO ] Input system was already deterministic with 478 transitions.
[2024-05-22 00:59:36] [INFO ] Transformed 545 places.
[2024-05-22 00:59:36] [INFO ] Transformed 478 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:00:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5138661065635031690.gal : 5 ms
[2024-05-22 01:00:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7676238430662303854.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/CTLFireability5138661065635031690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7676238430662303854.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3250485 ms.

BK_STOP 1716340170023

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-17, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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