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-171620399700548.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716335663677

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:54:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:54:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:54:25] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-21 23:54:25] [INFO ] Transformed 593 places.
[2024-05-21 23:54:25] [INFO ] Transformed 536 transitions.
[2024-05-21 23:54:25] [INFO ] Found NUPN structural information;
[2024-05-21 23:54:25] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 84 place count 501 transition count 449
Iterating global reduction 1 with 79 rules applied. Total rules applied 163 place count 501 transition count 449
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 205 place count 459 transition count 407
Iterating global reduction 1 with 42 rules applied. Total rules applied 247 place count 459 transition count 407
Applied a total of 247 rules in 136 ms. Remains 459 /585 variables (removed 126) and now considering 407/528 (removed 121) transitions.
// Phase 1: matrix 407 rows 459 cols
[2024-05-21 23:54:25] [INFO ] Computed 90 invariants in 25 ms
[2024-05-21 23:54:25] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-21 23:54:25] [INFO ] Invariant cache hit.
[2024-05-21 23:54:26] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2024-05-21 23:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 20 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 84 places in 231 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:54:35] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 6 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/130 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 4 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/150 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 7 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/170 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/190 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 6 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 20/210 constraints. Problems are: Problem set: 22 solved, 384 unsolved
(s131 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/866 variables, and 210 constraints, problems are : Problem set: 22 solved, 384 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/459 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 22 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 36/36 constraints. Problems are: Problem set: 22 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/36 constraints. Problems are: Problem set: 22 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 52/88 constraints. Problems are: Problem set: 22 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 2/90 constraints. Problems are: Problem set: 22 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 120/210 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:01] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/230 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 6 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 5 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/250 constraints. Problems are: Problem set: 24 solved, 382 unsolved
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 4 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/270 constraints. Problems are: Problem set: 24 solved, 382 unsolved
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/290 constraints. Problems are: Problem set: 24 solved, 382 unsolved
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 6 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 20/310 constraints. Problems are: Problem set: 28 solved, 378 unsolved
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 4 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 20/330 constraints. Problems are: Problem set: 30 solved, 376 unsolved
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 20/350 constraints. Problems are: Problem set: 32 solved, 374 unsolved
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 4 ms to minimize.
SMT process timed out in 60319ms, After SMT, problems are : Problem set: 32 solved, 374 unsolved
Search for dead transitions found 32 dead transitions in 60339ms
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 : 459/585 places, 375/528 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 375
Applied a total of 1 rules in 27 ms. Remains 458 /459 variables (removed 1) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 458 cols
[2024-05-21 23:55:26] [INFO ] Computed 94 invariants in 11 ms
[2024-05-21 23:55:27] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 23:55:27] [INFO ] Invariant cache hit.
[2024-05-21 23:55:27] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 458/585 places, 375/528 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62143 ms. Remains : 458/585 places, 375/528 transitions.
Support contains 32 out of 458 places after structural reductions.
[2024-05-21 23:55:27] [INFO ] Flatten gal took : 60 ms
[2024-05-21 23:55:27] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:55:27] [INFO ] Input system was already deterministic with 375 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (283 resets) in 1261 ms. (31 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40004 steps (50 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (50 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (52 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (47 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (49 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (50 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (48 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 62 ms. (634 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (53 resets) in 226 ms. (176 steps per ms) remains 10/10 properties
[2024-05-21 23:55:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 172/193 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 147/340 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 38 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 14 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 8 (OVERLAPS) 104/444 variables, 39/116 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 4 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:55:33] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/833 variables, and 136 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/458 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 169/187 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 152/339 variables, 39/54 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 23/77 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 16/93 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 105/444 variables, 39/132 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 20/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:55:36] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 20/172 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 5 ms to minimize.
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 3 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-21 23:55:37] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:55:38] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 10/182 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 4/448 variables, 2/184 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 368/816 variables, 448/632 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/816 variables, 6/638 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 23:55:39] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:55:39] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:39] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 10106ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (complete) has 971 edges and 458 vertex of which 457 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 457 transition count 325
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 408 transition count 323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 406 transition count 323
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 103 place count 406 transition count 230
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 305 place count 297 transition count 230
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 311 place count 291 transition count 224
Iterating global reduction 3 with 6 rules applied. Total rules applied 317 place count 291 transition count 224
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 553 place count 169 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 554 place count 169 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 168 transition count 113
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 565 place count 168 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 566 place count 167 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 567 place count 166 transition count 112
Applied a total of 567 rules in 117 ms. Remains 166 /458 variables (removed 292) and now considering 112/375 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 166/458 places, 112/375 transitions.
RANDOM walk for 40000 steps (4347 resets) in 1651 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1200 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1221 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1073 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1208 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1097 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 126073 steps, run visited all 7 properties in 321 ms. (steps per millisecond=392 )
Probabilistic random walk after 126073 steps, saw 30862 distinct states, run finished after 325 ms. (steps per millisecond=387 ) properties seen :7
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 971 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (trivial) has 216 edges and 458 vertex of which 6 / 458 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 453 vertex of which 452 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 451 transition count 315
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 399 transition count 315
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 106 place count 399 transition count 218
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 317 place count 285 transition count 218
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 276 transition count 209
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 276 transition count 209
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 571 place count 154 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 573 place count 153 transition count 99
Applied a total of 573 rules in 77 ms. Remains 153 /458 variables (removed 305) and now considering 99/375 (removed 276) transitions.
// Phase 1: matrix 99 rows 153 cols
[2024-05-21 23:55:40] [INFO ] Computed 69 invariants in 2 ms
[2024-05-21 23:55:41] [INFO ] Implicit Places using invariants in 158 ms returned [3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 42, 43, 44, 45, 46]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 162 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/458 places, 99/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 135/458 places, 99/375 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-00 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 447 transition count 364
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 447 transition count 364
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 445 transition count 362
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 445 transition count 362
Applied a total of 26 rules in 25 ms. Remains 445 /458 variables (removed 13) and now considering 362/375 (removed 13) transitions.
// Phase 1: matrix 362 rows 445 cols
[2024-05-21 23:55:41] [INFO ] Computed 94 invariants in 3 ms
[2024-05-21 23:55:41] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 23:55:41] [INFO ] Invariant cache hit.
[2024-05-21 23:55:41] [INFO ] Implicit Places using invariants and state equation in 385 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 663 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/458 places, 362/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 443 /443 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 443/458 places, 362/375 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (trivial) has 216 edges and 458 vertex of which 6 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 453 vertex of which 452 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 451 transition count 315
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 399 transition count 315
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 106 place count 399 transition count 218
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 317 place count 285 transition count 218
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 276 transition count 209
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 276 transition count 209
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 570 place count 155 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 572 place count 154 transition count 99
Applied a total of 572 rules in 44 ms. Remains 154 /458 variables (removed 304) and now considering 99/375 (removed 276) transitions.
// Phase 1: matrix 99 rows 154 cols
[2024-05-21 23:55:42] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 23:55:42] [INFO ] Implicit Places using invariants in 94 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 42, 43, 44, 45, 46]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 107 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/458 places, 99/375 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 134/458 places, 99/375 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (trivial) has 215 edges and 458 vertex of which 6 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 453 vertex of which 452 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 451 transition count 316
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 400 transition count 316
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 400 transition count 218
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 317 place count 285 transition count 218
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 276 transition count 209
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 276 transition count 209
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 569 place count 155 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 571 place count 154 transition count 100
Applied a total of 571 rules in 33 ms. Remains 154 /458 variables (removed 304) and now considering 100/375 (removed 275) transitions.
// Phase 1: matrix 100 rows 154 cols
[2024-05-21 23:55:42] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 23:55:42] [INFO ] Implicit Places using invariants in 108 ms returned [1, 2, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 43, 44, 45, 46, 47]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 109 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/458 places, 100/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 136 /136 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 136/458 places, 100/375 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p0&&X(G((!p0||G(p1))))))||(!p0&&X(G((!p0||G(p1))))&&F((!p2||G(p0))))))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (complete) has 971 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 456 transition count 324
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 407 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 405 transition count 322
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 103 place count 405 transition count 222
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 320 place count 288 transition count 222
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 329 place count 279 transition count 213
Iterating global reduction 3 with 9 rules applied. Total rules applied 338 place count 279 transition count 213
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 572 place count 158 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 573 place count 158 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 575 place count 157 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 576 place count 156 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 577 place count 155 transition count 102
Applied a total of 577 rules in 45 ms. Remains 155 /458 variables (removed 303) and now considering 102/375 (removed 273) transitions.
// Phase 1: matrix 102 rows 155 cols
[2024-05-21 23:55:42] [INFO ] Computed 68 invariants in 1 ms
[2024-05-21 23:55:42] [INFO ] Implicit Places using invariants in 357 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/458 places, 102/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 154/458 places, 102/375 transitions.
Stuttering acceptance computed with spot in 220 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07
Product exploration explored 100000 steps with 12090 reset in 316 ms.
Product exploration explored 100000 steps with 12179 reset in 319 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 271 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4829 resets) in 451 ms. (88 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40001 steps (1506 resets) in 238 ms. (167 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1416 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1457 resets) in 219 ms. (181 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (1224 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1270 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
// Phase 1: matrix 102 rows 154 cols
[2024-05-21 23:55:44] [INFO ] Computed 67 invariants in 3 ms
[2024-05-21 23:55:44] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/73 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 32/105 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/109 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 102/211 variables, 109/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 45/256 variables, 45/205 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 21/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/256 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 226 constraints, problems are : Problem set: 1 solved, 3 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 154/154 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/71 variables, 19/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 32/103 variables, 17/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/107 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 102/209 variables, 107/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 5/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 47/256 variables, 47/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 22/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 3/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/256 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 229 constraints, problems are : Problem set: 1 solved, 3 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 154/154 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 150 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 333 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 5 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 102/102 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-21 23:55:45] [INFO ] Invariant cache hit.
[2024-05-21 23:55:46] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 23:55:46] [INFO ] Invariant cache hit.
[2024-05-21 23:55:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 23:55:46] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [26, 27, 38, 40, 47, 48, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 74, 76, 78, 80, 82, 84, 86, 88, 96, 98, 100, 102, 104, 136, 138, 140]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 325 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/154 places, 102/102 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 122 transition count 94
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 114 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 111 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 111 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 111 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 110 transition count 88
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 42 place count 100 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 99 transition count 79
Applied a total of 44 rules in 13 ms. Remains 99 /122 variables (removed 23) and now considering 79/102 (removed 23) transitions.
// Phase 1: matrix 79 rows 99 cols
[2024-05-21 23:55:46] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 23:55:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:55:46] [INFO ] Invariant cache hit.
[2024-05-21 23:55:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 23:55:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [2, 3, 4, 6, 7, 8, 10, 14, 15, 18, 19, 20, 21, 22, 23, 24, 37, 38]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 230 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/154 places, 79/102 transitions.
Graph (complete) has 247 edges and 81 vertex of which 72 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 3 ms. Remains 72 /81 variables (removed 9) and now considering 75/79 (removed 4) transitions.
// Phase 1: matrix 75 rows 72 cols
[2024-05-21 23:55:46] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 23:55:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 23:55:46] [INFO ] Invariant cache hit.
[2024-05-21 23:55:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 23:55:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 72/154 places, 75/102 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 709 ms. Remains : 72/154 places, 75/102 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 81 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter insensitive) to 5 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4802 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1522 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1501 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1234 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1266 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1499 resets) in 74 ms. (533 steps per ms) remains 3/6 properties
[2024-05-21 23:55:47] [INFO ] Invariant cache hit.
[2024-05-21 23:55:47] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 50/64 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 74/138 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/144 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/147 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/147 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 50/64 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 74/138 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 6/144 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/147 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/147 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 33 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 75/75 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 70 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 69 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 68 transition count 72
Applied a total of 6 rules in 14 ms. Remains 68 /72 variables (removed 4) and now considering 72/75 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 68/72 places, 72/75 transitions.
RANDOM walk for 40000 steps (5730 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1786 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 157 steps, run visited all 1 properties in 6 ms. (steps per millisecond=26 )
Probabilistic random walk after 157 steps, saw 91 distinct states, run finished after 6 ms. (steps per millisecond=26 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 387 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter insensitive) to 5 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 12145 reset in 126 ms.
Product exploration explored 100000 steps with 12075 reset in 157 ms.
Built C files in :
/tmp/ltsmin1240598294845873554
[2024-05-21 23:55:48] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-21 23:55:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:55:48] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-21 23:55:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:55:48] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-21 23:55:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:55:48] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1240598294845873554
Running compilation step : cd /tmp/ltsmin1240598294845873554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 324 ms.
Running link step : cd /tmp/ltsmin1240598294845873554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1240598294845873554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased666073968750312027.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 6752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U (p2||G(p1))))))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 448 transition count 365
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 448 transition count 365
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 446 transition count 363
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 446 transition count 363
Applied a total of 24 rules in 22 ms. Remains 446 /458 variables (removed 12) and now considering 363/375 (removed 12) transitions.
// Phase 1: matrix 363 rows 446 cols
[2024-05-21 23:55:49] [INFO ] Computed 94 invariants in 3 ms
[2024-05-21 23:55:49] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 23:55:49] [INFO ] Invariant cache hit.
[2024-05-21 23:55:49] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 591 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/458 places, 363/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 444 /444 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 444/458 places, 363/375 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 714 reset in 211 ms.
Product exploration explored 100000 steps with 718 reset in 232 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 943 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 163 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (284 resets) in 221 ms. (180 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (50 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (46 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (48 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (50 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (47 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
// Phase 1: matrix 363 rows 444 cols
[2024-05-21 23:55:51] [INFO ] Computed 92 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:55:51] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 113/434 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 356/790 variables, 434/529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:55:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf6 is UNSAT
At refinement iteration 11 (OVERLAPS) 11/801 variables, 6/537 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/801 variables, 0/537 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/807 variables, 4/541 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/807 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/807 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/807 variables, and 541 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 3/55 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 2 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:53] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 17/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/434 variables, 40/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/114 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 356/790 variables, 434/549 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/790 variables, 4/553 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/790 variables, 8/561 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/790 variables, 0/561 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 11/801 variables, 6/567 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:55:54] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/801 variables, 2/569 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:55] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/801 variables, 3/572 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/801 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 6/807 variables, 4/576 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/807 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/807 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 807/807 variables, and 576 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2858 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 36/36 constraints]
After SMT, in 4564ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 611 ms.
Support contains 3 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 363/363 transitions.
Graph (trivial) has 201 edges and 444 vertex of which 6 / 444 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 936 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 438 transition count 310
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 393 transition count 310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 92 place count 393 transition count 216
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 296 place count 283 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 282 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 282 transition count 215
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 540 place count 157 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 542 place count 156 transition count 102
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 544 place count 156 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 546 place count 154 transition count 100
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 551 place count 154 transition count 100
Applied a total of 551 rules in 40 ms. Remains 154 /444 variables (removed 290) and now considering 100/363 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 154/444 places, 100/363 transitions.
RANDOM walk for 345 steps (12 resets) in 7 ms. (43 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 323 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 444/444 places, 363/363 transitions.
Applied a total of 0 rules in 6 ms. Remains 444 /444 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2024-05-21 23:55:57] [INFO ] Invariant cache hit.
[2024-05-21 23:55:57] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 23:55:57] [INFO ] Invariant cache hit.
[2024-05-21 23:55:57] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 23:55:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:56:07] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
Problem TDEAD306 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 361 unsolved
[2024-05-21 23:56:09] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 1 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:56:10] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/152 constraints. Problems are: Problem set: 1 solved, 361 unsolved
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 110 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:56:14] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:56:15] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:56:16] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:56:17] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 20/172 constraints. Problems are: Problem set: 1 solved, 361 unsolved
[2024-05-21 23:56:18] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:56:18] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:56:20] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:56:20] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:56:21] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:56:21] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:56:21] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:56:21] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:56:21] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:56:22] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 20/192 constraints. Problems are: Problem set: 1 solved, 361 unsolved
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:56:23] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:56:25] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:56:26] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 30109ms, After SMT, problems are : Problem set: 1 solved, 361 unsolved
Search for dead transitions found 1 dead transitions in 30113ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 444/444 places, 362/363 transitions.
Applied a total of 0 rules in 6 ms. Remains 444 /444 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30574 ms. Remains : 444/444 places, 362/363 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 941 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 160 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (285 resets) in 243 ms. (163 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (50 resets) in 134 ms. (296 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (50 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
// Phase 1: matrix 362 rows 444 cols
[2024-05-21 23:56:28] [INFO ] Computed 93 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/434 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 355/789 variables, 434/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/800 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 11/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/806 variables, 4/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/806 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/806 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 548 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1756 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 113/434 variables, 41/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 355/789 variables, 434/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 7/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/800 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/800 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/806 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/806 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/806 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 584 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 44/44 constraints]
After SMT, in 5547ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 562 ms.
Support contains 4 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 362/362 transitions.
Graph (trivial) has 200 edges and 444 vertex of which 6 / 444 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 934 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 438 transition count 309
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 393 transition count 309
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 393 transition count 216
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 284 transition count 216
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 10 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 540 place count 156 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 542 place count 155 transition count 102
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 544 place count 155 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 546 place count 153 transition count 100
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 551 place count 153 transition count 100
Applied a total of 551 rules in 32 ms. Remains 153 /444 variables (removed 291) and now considering 100/362 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 153/444 places, 100/362 transitions.
RANDOM walk for 40000 steps (1661 resets) in 226 ms. (176 steps per ms) remains 1/3 properties
BEST_FIRST walk for 601 steps (6 resets) in 5 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 317 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 709 reset in 243 ms.
Product exploration explored 100000 steps with 716 reset in 245 ms.
Built C files in :
/tmp/ltsmin2678545270842151634
[2024-05-21 23:56:36] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2678545270842151634
Running compilation step : cd /tmp/ltsmin2678545270842151634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 877 ms.
Running link step : cd /tmp/ltsmin2678545270842151634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2678545270842151634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17811295999452077219.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 444/444 places, 362/362 transitions.
Applied a total of 0 rules in 7 ms. Remains 444 /444 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-21 23:56:51] [INFO ] Invariant cache hit.
[2024-05-21 23:56:51] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 23:56:51] [INFO ] Invariant cache hit.
[2024-05-21 23:56:51] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-21 23:56:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:56:58] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:56:59] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:00] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:57:01] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 4 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 4 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:57:16] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 31 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:57:20] [INFO ] Deduced a trap composed of 74 places in 127 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/444 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/806 variables, and 181 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 88/181 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:57:25] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:57:26] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 16/221 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:39] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:57:39] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:57:39] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:57:39] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:57:40] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:57:43] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:43] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 0 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:57:50] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:57:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/806 variables, and 281 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 0/361 constraints, Known Traps: 188/188 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 444/444 places, 362/362 transitions.
Built C files in :
/tmp/ltsmin13096532104500972161
[2024-05-21 23:57:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13096532104500972161
Running compilation step : cd /tmp/ltsmin13096532104500972161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 532 ms.
Running link step : cd /tmp/ltsmin13096532104500972161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13096532104500972161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2559575669931036914.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:58:06] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:58:06] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:58:06] [INFO ] Time to serialize gal into /tmp/LTL6070978005901785075.gal : 5 ms
[2024-05-21 23:58:06] [INFO ] Time to serialize properties into /tmp/LTL14569401267040909797.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6070978005901785075.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10486104579172245716.hoa' '-atoms' '/tmp/LTL14569401267040909797.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14569401267040909797.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10486104579172245716.hoa
Detected timeout of ITS tools.
[2024-05-21 23:58:22] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:58:22] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:58:22] [INFO ] Time to serialize gal into /tmp/LTL15088719680921823956.gal : 4 ms
[2024-05-21 23:58:22] [INFO ] Time to serialize properties into /tmp/LTL5598068022767688366.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15088719680921823956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5598068022767688366.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("((p173==0)||(p538==0))"))||(("(p132!=1)")U(("((p413!=1)&&(p132!=1))")||(G("(p132!=1)")))))))
Formula 0 simplified : F(X!"((p173==0)||(p538==0))" & (!"(p132!=1)" M !"((p413!=1)&&(p132!=1))"))
Detected timeout of ITS tools.
[2024-05-21 23:58:37] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:58:37] [INFO ] Applying decomposition
[2024-05-21 23:58:37] [INFO ] Flatten gal took : 28 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/graph7980034737235258441.txt' '-o' '/tmp/graph7980034737235258441.bin' '-w' '/tmp/graph7980034737235258441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7980034737235258441.bin' '-l' '-1' '-v' '-w' '/tmp/graph7980034737235258441.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:58:37] [INFO ] Decomposing Gal with order
[2024-05-21 23:58:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:58:37] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-21 23:58:37] [INFO ] Flatten gal took : 96 ms
[2024-05-21 23:58:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 20 ms.
[2024-05-21 23:58:37] [INFO ] Time to serialize gal into /tmp/LTL2841346753446263766.gal : 10 ms
[2024-05-21 23:58:37] [INFO ] Time to serialize properties into /tmp/LTL10936261587060665956.ltl : 13 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2841346753446263766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10936261587060665956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i19.i3.u54.p173==0)||(i19.i3.u143.p538==0))"))||(("(i2.u42.p132!=1)")U(("((i10.i2.u119.p413!=1)&&(i2.u42.p132!=1))")||(G("(...178
Formula 0 simplified : F(X!"((i19.i3.u54.p173==0)||(i19.i3.u143.p538==0))" & (!"(i2.u42.p132!=1)" M !"((i10.i2.u119.p413!=1)&&(i2.u42.p132!=1))"))
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 183465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 448 transition count 365
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 448 transition count 365
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 446 transition count 363
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 446 transition count 363
Applied a total of 24 rules in 34 ms. Remains 446 /458 variables (removed 12) and now considering 363/375 (removed 12) transitions.
// Phase 1: matrix 363 rows 446 cols
[2024-05-21 23:58:52] [INFO ] Computed 94 invariants in 5 ms
[2024-05-21 23:58:53] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-21 23:58:53] [INFO ] Invariant cache hit.
[2024-05-21 23:58:53] [INFO ] Implicit Places using invariants and state equation in 521 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 846 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/458 places, 363/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 444 /444 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 887 ms. Remains : 444/458 places, 363/375 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-10
Product exploration explored 100000 steps with 715 reset in 245 ms.
Product exploration explored 100000 steps with 718 reset in 264 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 943 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (286 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (47 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22653 steps, run visited all 1 properties in 79 ms. (steps per millisecond=286 )
Probabilistic random walk after 22653 steps, saw 9754 distinct states, run finished after 79 ms. (steps per millisecond=286 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-10 finished in 2047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (trivial) has 214 edges and 458 vertex of which 6 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 453 vertex of which 452 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 451 transition count 317
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 401 transition count 317
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 102 place count 401 transition count 219
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 315 place count 286 transition count 219
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 325 place count 276 transition count 209
Iterating global reduction 2 with 10 rules applied. Total rules applied 335 place count 276 transition count 209
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 567 place count 156 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 569 place count 155 transition count 101
Applied a total of 569 rules in 23 ms. Remains 155 /458 variables (removed 303) and now considering 101/375 (removed 274) transitions.
// Phase 1: matrix 101 rows 155 cols
[2024-05-21 23:58:54] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 23:58:54] [INFO ] Implicit Places using invariants in 81 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 42, 43, 44, 48]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 97 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/458 places, 101/375 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 137/458 places, 101/375 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-11 finished in 156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 448 transition count 365
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 448 transition count 365
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 446 transition count 363
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 446 transition count 363
Applied a total of 24 rules in 17 ms. Remains 446 /458 variables (removed 12) and now considering 363/375 (removed 12) transitions.
// Phase 1: matrix 363 rows 446 cols
[2024-05-21 23:58:54] [INFO ] Computed 94 invariants in 2 ms
[2024-05-21 23:58:55] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:58:55] [INFO ] Invariant cache hit.
[2024-05-21 23:58:55] [INFO ] Implicit Places using invariants and state equation in 334 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 459 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/458 places, 363/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 444 /444 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 444/458 places, 363/375 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (trivial) has 214 edges and 458 vertex of which 6 / 458 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 453 vertex of which 452 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 451 transition count 316
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 400 transition count 316
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 104 place count 400 transition count 219
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 315 place count 286 transition count 219
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 323 place count 278 transition count 211
Iterating global reduction 2 with 8 rules applied. Total rules applied 331 place count 278 transition count 211
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 563 place count 158 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 565 place count 157 transition count 103
Applied a total of 565 rules in 18 ms. Remains 157 /458 variables (removed 301) and now considering 103/375 (removed 272) transitions.
// Phase 1: matrix 103 rows 157 cols
[2024-05-21 23:58:55] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 23:58:55] [INFO ] Implicit Places using invariants in 83 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 41, 42, 43, 44, 45]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 97 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/458 places, 103/375 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 138/458 places, 103/375 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U (p2||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-08
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 458/458 places, 375/375 transitions.
Graph (trivial) has 212 edges and 458 vertex of which 6 / 458 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 453 vertex of which 452 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 451 transition count 316
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 400 transition count 316
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 104 place count 400 transition count 221
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 310 place count 289 transition count 221
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 319 place count 280 transition count 212
Iterating global reduction 2 with 9 rules applied. Total rules applied 328 place count 280 transition count 212
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 560 place count 160 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 562 place count 159 transition count 104
Applied a total of 562 rules in 19 ms. Remains 159 /458 variables (removed 299) and now considering 104/375 (removed 271) transitions.
// Phase 1: matrix 104 rows 159 cols
[2024-05-21 23:58:55] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 23:58:56] [INFO ] Implicit Places using invariants in 96 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 23, 24, 25, 45, 46, 47, 48, 49]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 110 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 141/458 places, 104/375 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 131 ms. Remains : 141/458 places, 104/375 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 21666 reset in 236 ms.
Product exploration explored 100000 steps with 21790 reset in 382 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 188 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (9916 resets) in 903 ms. (44 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40002 steps (3065 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3085 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3068 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3059 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (2888 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
// Phase 1: matrix 104 rows 141 cols
[2024-05-21 23:58:57] [INFO ] Computed 52 invariants in 1 ms
[2024-05-21 23:58:57] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/105 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/136 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/138 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 103/241 variables, 138/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf6 is UNSAT
At refinement iteration 12 (OVERLAPS) 3/244 variables, 3/198 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/244 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 198 constraints, problems are : Problem set: 1 solved, 4 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 141/141 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/105 variables, 30/33 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 31/136 variables, 17/50 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/138 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 103/241 variables, 138/190 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 5/195 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 4/199 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/244 variables, 3/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/244 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 202 constraints, problems are : Problem set: 1 solved, 4 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 141/141 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=31 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 252 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 23:58:58] [INFO ] Invariant cache hit.
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 23:58:58] [INFO ] Invariant cache hit.
[2024-05-21 23:58:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [1, 3, 7, 10, 13, 14, 15, 28, 30, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 89, 90, 123, 125, 127]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 266 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/141 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 98
Applied a total of 8 rules in 13 ms. Remains 99 /103 variables (removed 4) and now considering 98/104 (removed 6) transitions.
// Phase 1: matrix 98 rows 99 cols
[2024-05-21 23:58:58] [INFO ] Computed 16 invariants in 0 ms
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:58:58] [INFO ] Invariant cache hit.
[2024-05-21 23:58:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/141 places, 98/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 99/141 places, 98/104 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 252 edges and 99 vertex of which 85 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 119 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (9925 resets) in 154 ms. (258 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (3087 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3067 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3064 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2911 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
[2024-05-21 23:58:59] [INFO ] Invariant cache hit.
[2024-05-21 23:58:59] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 83/103 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 13/116 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 75/191 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/192 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/194 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/196 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/196 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/196 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/197 variables, and 118 constraints, problems are : Problem set: 0 solved, 4 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 99/99 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 83/103 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 13/116 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 75/191 variables, 66/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/191 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/192 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/194 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/196 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/196 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/196 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/197 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 99/99 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 520 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21855 reset in 140 ms.
Product exploration explored 100000 steps with 21713 reset in 138 ms.
Built C files in :
/tmp/ltsmin18409773318711316185
[2024-05-21 23:59:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18409773318711316185
Running compilation step : cd /tmp/ltsmin18409773318711316185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin18409773318711316185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18409773318711316185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8703983397741250403.hoa' '--buchi-type=spotba'
LTSmin run took 2249 ms.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 8365 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 23:59:04] [INFO ] Flatten gal took : 13 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 279086 ms.

BK_STOP 1716335944150

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-13"
export BK_EXAMINATION="LTLFireability"
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-13, examination is LTLFireability"
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-171620399700548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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