Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 189K May 5 16:51 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-19-00
FORMULA_NAME BusinessProcesses-PT-19-01
FORMULA_NAME BusinessProcesses-PT-19-02
FORMULA_NAME BusinessProcesses-PT-19-03
FORMULA_NAME BusinessProcesses-PT-19-04
FORMULA_NAME BusinessProcesses-PT-19-05
FORMULA_NAME BusinessProcesses-PT-19-06
FORMULA_NAME BusinessProcesses-PT-19-07
FORMULA_NAME BusinessProcesses-PT-19-08
FORMULA_NAME BusinessProcesses-PT-19-09
FORMULA_NAME BusinessProcesses-PT-19-10
FORMULA_NAME BusinessProcesses-PT-19-11
FORMULA_NAME BusinessProcesses-PT-19-12
FORMULA_NAME BusinessProcesses-PT-19-13
FORMULA_NAME BusinessProcesses-PT-19-14
FORMULA_NAME BusinessProcesses-PT-19-15

=== Now, execution of the tool begins

BK_START 1620548564345

Running Version 0
[2021-05-09 08:22:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:22:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:22:47] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2021-05-09 08:22:47] [INFO ] Transformed 772 places.
[2021-05-09 08:22:47] [INFO ] Transformed 685 transitions.
[2021-05-09 08:22:47] [INFO ] Found NUPN structural information;
[2021-05-09 08:22:47] [INFO ] Parsed PT model containing 772 places and 685 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 08:22:47] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 102 places :
Symmetric choice reduction at 1 with 102 rule applications. Total rules 110 place count 647 transition count 568
Iterating global reduction 1 with 102 rules applied. Total rules applied 212 place count 647 transition count 568
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 263 place count 596 transition count 517
Iterating global reduction 1 with 51 rules applied. Total rules applied 314 place count 596 transition count 517
Applied a total of 314 rules in 282 ms. Remains 596 /757 variables (removed 161) and now considering 517/670 (removed 153) transitions.
// Phase 1: matrix 517 rows 596 cols
[2021-05-09 08:22:47] [INFO ] Computed 117 place invariants in 63 ms
[2021-05-09 08:22:48] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 517 rows 596 cols
[2021-05-09 08:22:48] [INFO ] Computed 117 place invariants in 23 ms
[2021-05-09 08:22:49] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
// Phase 1: matrix 517 rows 596 cols
[2021-05-09 08:22:49] [INFO ] Computed 117 place invariants in 8 ms
[2021-05-09 08:22:49] [INFO ] Dead Transitions using invariants and state equation in 420 ms returned []
Finished structural reductions, in 1 iterations. Remains : 596/757 places, 517/670 transitions.
[2021-05-09 08:22:49] [INFO ] Flatten gal took : 124 ms
[2021-05-09 08:22:49] [INFO ] Flatten gal took : 53 ms
[2021-05-09 08:22:50] [INFO ] Input system was already deterministic with 517 transitions.
Incomplete random walk after 100000 steps, including 554 resets, run finished after 371 ms. (steps per millisecond=269 ) properties (out of 28) seen :13
Running SMT prover for 15 properties.
// Phase 1: matrix 517 rows 596 cols
[2021-05-09 08:22:50] [INFO ] Computed 117 place invariants in 14 ms
[2021-05-09 08:22:50] [INFO ] [Real]Absence check using 70 positive place invariants in 29 ms returned sat
[2021-05-09 08:22:50] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2021-05-09 08:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:50] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-09 08:22:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:51] [INFO ] [Nat]Absence check using 70 positive place invariants in 50 ms returned sat
[2021-05-09 08:22:51] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:51] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2021-05-09 08:22:51] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 6 ms to minimize.
[2021-05-09 08:22:51] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:22:52] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:22:52] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:22:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 645 ms
[2021-05-09 08:22:52] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 54 ms.
[2021-05-09 08:22:54] [INFO ] Added : 225 causal constraints over 45 iterations in 1933 ms. Result :sat
[2021-05-09 08:22:54] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-09 08:22:54] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:54] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 2 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:22:55] [INFO ] Deduced a trap composed of 104 places in 356 ms of which 1 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 109 places in 231 ms of which 1 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 4 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 12 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:23:05] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 111 places in 88 ms of which 8 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:06] [INFO ] Deduced a trap composed of 107 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:10] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 106 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:11] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-09 08:23:14] [INFO ] [Real]Absence check using 70 positive place invariants in 54 ms returned sat
[2021-05-09 08:23:14] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:14] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 109 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 108 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 54 places in 31 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 9598 ms
[2021-05-09 08:23:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:24] [INFO ] [Nat]Absence check using 70 positive place invariants in 34 ms returned sat
[2021-05-09 08:23:24] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 13 ms returned sat
[2021-05-09 08:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:24] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 12 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 13 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 13 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 13 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 51 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 54 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 4780 ms
[2021-05-09 08:23:29] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 28 ms.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 885 ms
[2021-05-09 08:23:32] [INFO ] Added : 343 causal constraints over 69 iterations in 2701 ms. Result :sat
[2021-05-09 08:23:32] [INFO ] [Real]Absence check using 70 positive place invariants in 18 ms returned sat
[2021-05-09 08:23:32] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:32] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 118 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 111 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 10337 ms
[2021-05-09 08:23:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:42] [INFO ] [Nat]Absence check using 70 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:42] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 08:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:42] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4755 ms
[2021-05-09 08:23:47] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 24 ms.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 996 ms
[2021-05-09 08:23:50] [INFO ] Added : 273 causal constraints over 56 iterations in 2694 ms. Result :sat
[2021-05-09 08:23:50] [INFO ] [Real]Absence check using 70 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:50] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:50] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 36 places in 17 ms of which 1 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1095 ms
[2021-05-09 08:23:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:51] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2021-05-09 08:23:51] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 8 ms returned sat
[2021-05-09 08:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:51] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1035 ms
[2021-05-09 08:23:53] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 26 ms.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 103 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:23:56] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:23:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1206 ms
[2021-05-09 08:23:56] [INFO ] Added : 355 causal constraints over 71 iterations in 3175 ms. Result :sat
[2021-05-09 08:23:56] [INFO ] [Real]Absence check using 70 positive place invariants in 22 ms returned sat
[2021-05-09 08:23:56] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 33 ms returned sat
[2021-05-09 08:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:56] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-09 08:23:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:56] [INFO ] [Nat]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-09 08:23:56] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 13 ms returned sat
[2021-05-09 08:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:56] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-09 08:23:56] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:23:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:23:57] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:23:57] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:23:57] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2021-05-09 08:23:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 537 ms
[2021-05-09 08:23:57] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 24 ms.
[2021-05-09 08:23:58] [INFO ] Added : 228 causal constraints over 46 iterations in 1207 ms. Result :sat
[2021-05-09 08:23:58] [INFO ] [Real]Absence check using 70 positive place invariants in 18 ms returned sat
[2021-05-09 08:23:58] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:58] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 08:23:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:58] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2021-05-09 08:23:58] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 21 ms returned sat
[2021-05-09 08:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:59] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:23:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 807 ms
[2021-05-09 08:23:59] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 23 ms.
[2021-05-09 08:24:01] [INFO ] Added : 370 causal constraints over 75 iterations in 2045 ms. Result :sat
[2021-05-09 08:24:01] [INFO ] [Real]Absence check using 70 positive place invariants in 23 ms returned sat
[2021-05-09 08:24:01] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 13 ms returned sat
[2021-05-09 08:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:02] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 53 places in 29 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2262 ms
[2021-05-09 08:24:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:04] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2021-05-09 08:24:04] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 8 ms returned sat
[2021-05-09 08:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:04] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2522 ms
[2021-05-09 08:24:07] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 27 ms.
[2021-05-09 08:24:09] [INFO ] Added : 369 causal constraints over 74 iterations in 2038 ms. Result :sat
[2021-05-09 08:24:09] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2021-05-09 08:24:09] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:09] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-09 08:24:09] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:24:09] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:24:09] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:24:09] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:24:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 327 ms
[2021-05-09 08:24:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:09] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2021-05-09 08:24:09] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 8 ms returned sat
[2021-05-09 08:24:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:10] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-09 08:24:10] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:24:10] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:24:10] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:24:10] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:24:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 349 ms
[2021-05-09 08:24:10] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 22 ms.
[2021-05-09 08:24:11] [INFO ] Added : 243 causal constraints over 50 iterations in 1159 ms. Result :sat
[2021-05-09 08:24:11] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2021-05-09 08:24:11] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 9 ms returned sat
[2021-05-09 08:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:11] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 08:24:11] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:24:11] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 473 ms
[2021-05-09 08:24:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:12] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2021-05-09 08:24:12] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:12] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:24:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 474 ms
[2021-05-09 08:24:13] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 27 ms.
[2021-05-09 08:24:14] [INFO ] Added : 338 causal constraints over 68 iterations in 1699 ms. Result :sat
[2021-05-09 08:24:14] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2021-05-09 08:24:14] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 3 ms returned unsat
[2021-05-09 08:24:14] [INFO ] [Real]Absence check using 70 positive place invariants in 19 ms returned sat
[2021-05-09 08:24:14] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 9 ms returned sat
[2021-05-09 08:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:14] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 383 ms
[2021-05-09 08:24:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:15] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2021-05-09 08:24:15] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 8 ms returned sat
[2021-05-09 08:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:15] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:24:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 349 ms
[2021-05-09 08:24:15] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 20 ms.
[2021-05-09 08:24:17] [INFO ] Added : 220 causal constraints over 44 iterations in 1037 ms. Result :sat
[2021-05-09 08:24:17] [INFO ] [Real]Absence check using 70 positive place invariants in 28 ms returned sat
[2021-05-09 08:24:17] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:17] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-09 08:24:17] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:24:17] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:24:17] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:17] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:24:18] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:24:19] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:24:19] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:24:19] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 12 ms to minimize.
[2021-05-09 08:24:19] [INFO ] Deduced a trap composed of 101 places in 219 ms of which 1 ms to minimize.
[2021-05-09 08:24:19] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:24:20] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:24:21] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4394 ms
[2021-05-09 08:24:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:21] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2021-05-09 08:24:21] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:22] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:24:22] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:24:23] [INFO ] Deduced a trap composed of 116 places in 191 ms of which 0 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:24:24] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:24:25] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:24:26] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:24:27] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:24:28] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:24:29] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:24:30] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:24:31] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:24:32] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:24:32] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 10028 ms
[2021-05-09 08:24:32] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 08:24:33] [INFO ] Added : 285 causal constraints over 57 iterations in 1553 ms. Result :sat
[2021-05-09 08:24:33] [INFO ] [Real]Absence check using 70 positive place invariants in 17 ms returned sat
[2021-05-09 08:24:33] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2021-05-09 08:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:33] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:24:34] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:24:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2069 ms
[2021-05-09 08:24:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:36] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2021-05-09 08:24:36] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 9 ms returned sat
[2021-05-09 08:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:36] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-09 08:24:36] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:24:36] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:24:36] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:24:36] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:24:36] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:24:36] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:24:37] [INFO ] Deduced a trap composed of 39 places in 22 ms of which 1 ms to minimize.
[2021-05-09 08:24:38] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:24:38] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:24:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2020 ms
[2021-05-09 08:24:38] [INFO ] Computed and/alt/rep : 510/1024/510 causal constraints (skipped 6 transitions) in 19 ms.
[2021-05-09 08:24:39] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:24:39] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Deduced a trap composed of 118 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:24:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1100 ms
[2021-05-09 08:24:40] [INFO ] Added : 335 causal constraints over 67 iterations in 2662 ms. Result :sat
[2021-05-09 08:24:40] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2021-05-09 08:24:40] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 9 ms returned sat
[2021-05-09 08:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:41] [INFO ] [Real]Absence check using state equation in 146 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2021-05-09 08:24:41] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-19-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1&&X(G(p2)))||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 586 transition count 507
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 586 transition count 507
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 581 transition count 502
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 578 transition count 499
Applied a total of 36 rules in 126 ms. Remains 578 /596 variables (removed 18) and now considering 499/517 (removed 18) transitions.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:24:41] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-09 08:24:41] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:24:41] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:24:42] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:24:42] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-09 08:24:42] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 578/596 places, 499/517 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s283 1) (EQ s56 0)), p1:(EQ s126 1), p2:(EQ s126 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.43 ms
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 578 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 578/578 places, 499/499 transitions.
Graph (trivial) has 266 edges and 578 vertex of which 6 / 578 are part of one of the 1 SCC in 12 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 573 transition count 493
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 119 Pre rules applied. Total rules applied 63 place count 573 transition count 754
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 182 place count 573 transition count 754
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 204 place count 551 transition count 677
Deduced a syphon composed of 159 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 226 place count 551 transition count 677
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 321 places in 1 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 388 place count 551 transition count 677
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 429 place count 510 transition count 636
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 470 place count 510 transition count 636
Deduced a syphon composed of 280 places in 1 ms
Applied a total of 470 rules in 185 ms. Remains 510 /578 variables (removed 68) and now considering 636/499 (removed -137) transitions.
[2021-05-09 08:24:45] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 636 rows 510 cols
[2021-05-09 08:24:45] [INFO ] Computed 117 place invariants in 9 ms
[2021-05-09 08:24:45] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 510/578 places, 636/499 transitions.
Product exploration explored 100000 steps with 50000 reset in 1645 ms.
Product exploration explored 100000 steps with 50000 reset in 1383 ms.
[2021-05-09 08:24:48] [INFO ] Flatten gal took : 36 ms
[2021-05-09 08:24:48] [INFO ] Flatten gal took : 31 ms
[2021-05-09 08:24:48] [INFO ] Time to serialize gal into /tmp/LTL875512979618916266.gal : 34 ms
[2021-05-09 08:24:48] [INFO ] Time to serialize properties into /tmp/LTL7552245922346777615.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL875512979618916266.gal, -t, CGAL, -LTL, /tmp/LTL7552245922346777615.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL875512979618916266.gal -t CGAL -LTL /tmp/LTL7552245922346777615.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p329==1)||(p58==0))")||(("(p142==1)")&&(X(G("(p142==0)"))))))))
Formula 0 simplified : !XF("((p329==1)||(p58==0))" | ("(p142==1)" & XG"(p142==0)"))
Detected timeout of ITS tools.
[2021-05-09 08:25:03] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:25:03] [INFO ] Applying decomposition
[2021-05-09 08:25:03] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7606500233482654494.txt, -o, /tmp/graph7606500233482654494.bin, -w, /tmp/graph7606500233482654494.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7606500233482654494.bin, -l, -1, -v, -w, /tmp/graph7606500233482654494.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:25:04] [INFO ] Decomposing Gal with order
[2021-05-09 08:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:25:04] [INFO ] Removed a total of 287 redundant transitions.
[2021-05-09 08:25:04] [INFO ] Flatten gal took : 96 ms
[2021-05-09 08:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 26 ms.
[2021-05-09 08:25:04] [INFO ] Time to serialize gal into /tmp/LTL17658178656774071387.gal : 16 ms
[2021-05-09 08:25:04] [INFO ] Time to serialize properties into /tmp/LTL17225602233177385834.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17658178656774071387.gal, -t, CGAL, -LTL, /tmp/LTL17225602233177385834.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17658178656774071387.gal -t CGAL -LTL /tmp/LTL17225602233177385834.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i17.u109.p329==1)||(i9.i0.u23.p58==0))")||(("(i6.i1.u49.p142==1)")&&(X(G("(i6.i1.u49.p142==0)"))))))))
Formula 0 simplified : !XF("((i17.u109.p329==1)||(i9.i0.u23.p58==0))" | ("(i6.i1.u49.p142==1)" & XG"(i6.i1.u49.p142==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin609278669924802316
[2021-05-09 08:25:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin609278669924802316
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin609278669924802316]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin609278669924802316] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin609278669924802316] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-19-00 finished in 39500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&((F(p1)&&F(p2))||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 282 edges and 596 vertex of which 6 / 596 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 590 transition count 440
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 520 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 145 place count 518 transition count 438
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 145 place count 518 transition count 315
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 271 rules applied. Total rules applied 416 place count 370 transition count 315
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 426 place count 360 transition count 305
Iterating global reduction 3 with 10 rules applied. Total rules applied 436 place count 360 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 437 place count 359 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 438 place count 359 transition count 304
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 313 rules applied. Total rules applied 751 place count 200 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 753 place count 199 transition count 153
Applied a total of 753 rules in 157 ms. Remains 199 /596 variables (removed 397) and now considering 153/517 (removed 364) transitions.
// Phase 1: matrix 153 rows 199 cols
[2021-05-09 08:25:20] [INFO ] Computed 87 place invariants in 1 ms
[2021-05-09 08:25:21] [INFO ] Implicit Places using invariants in 393 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 56, 57, 58, 59]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 396 ms to find 26 implicit places.
[2021-05-09 08:25:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 153 rows 173 cols
[2021-05-09 08:25:21] [INFO ] Computed 61 place invariants in 25 ms
[2021-05-09 08:25:21] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Starting structural reductions, iteration 1 : 173/596 places, 153/517 transitions.
Applied a total of 0 rules in 8 ms. Remains 173 /173 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2021-05-09 08:25:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 153 rows 173 cols
[2021-05-09 08:25:21] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 08:25:21] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 2 iterations. Remains : 173/596 places, 153/517 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s33 1), p2:(OR (NEQ s168 1) (NEQ s171 1)), p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-01 finished in 1184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 283 edges and 596 vertex of which 6 / 596 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 590 transition count 438
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 438
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 145 place count 518 transition count 316
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 414 place count 371 transition count 316
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 423 place count 362 transition count 307
Iterating global reduction 2 with 9 rules applied. Total rules applied 432 place count 362 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 361 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 361 transition count 306
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 753 place count 199 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 755 place count 198 transition count 152
Applied a total of 755 rules in 77 ms. Remains 198 /596 variables (removed 398) and now considering 152/517 (removed 365) transitions.
// Phase 1: matrix 152 rows 198 cols
[2021-05-09 08:25:21] [INFO ] Computed 87 place invariants in 1 ms
[2021-05-09 08:25:22] [INFO ] Implicit Places using invariants in 235 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 236 ms to find 28 implicit places.
[2021-05-09 08:25:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 152 rows 170 cols
[2021-05-09 08:25:22] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:25:22] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 170/596 places, 152/517 transitions.
Applied a total of 0 rules in 20 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2021-05-09 08:25:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 152 rows 170 cols
[2021-05-09 08:25:22] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-09 08:25:22] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/596 places, 152/517 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s120 1), p1:(OR (NEQ s21 1) (NEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21509 reset in 271 ms.
Product exploration explored 100000 steps with 21451 reset in 243 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21516 reset in 186 ms.
Product exploration explored 100000 steps with 21639 reset in 318 ms.
[2021-05-09 08:25:23] [INFO ] Flatten gal took : 11 ms
[2021-05-09 08:25:23] [INFO ] Flatten gal took : 10 ms
[2021-05-09 08:25:23] [INFO ] Time to serialize gal into /tmp/LTL13713566599224995666.gal : 2 ms
[2021-05-09 08:25:23] [INFO ] Time to serialize properties into /tmp/LTL1063209393252956442.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13713566599224995666.gal, -t, CGAL, -LTL, /tmp/LTL1063209393252956442.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13713566599224995666.gal -t CGAL -LTL /tmp/LTL1063209393252956442.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p605==1)"))||(G("((p201!=1)||(p204!=1))"))))
Formula 0 simplified : !(F"(p605==1)" | G"((p201!=1)||(p204!=1))")
Reverse transition relation is NOT exact ! Due to transitions t60, t334.t335.t1.t336, t57.t58.t6, t40.t42.t43.t7, t37.t38.t8, t34.t35.t9, t31.t32.t10, t3.t280, t276.t278.t279.t2.t280, t270.t271.t4.t280, t267.t268.t5.t280, t66.t203.t204.t360.t512.t363.t364.t77, t54.t156.t157.t326.t494.t329.t330.t77, t53.t151.t322.t373.t491.t323.t324.t77, t52.t148.t318.t489.t319.t320.t77, t52.t145.t318.t488.t319.t320.t77, t51.t142.t314.t372.t486.t315.t316.t77, t50.t139.t310.t376.t484.t311.t312.t77, t49.t162.t163.t306.t371.t482.t307.t308.t77, t127.t430.t265.t280.t77, t121.t425.t265.t280.t77, t118.t420.t265.t280.t77, t79.t205.t207.t210.t211.t212.t213.t217.t221.t225.t229.t233.t237.t241.t246.t251.t255.t259.t263.t281.t285.t289.t293.t297.t305.t309.t313.t317.t321.t325.t331.t337.t343.t347.t352.t356.t338.t298.t304.t80.t83.t86.t89.t92.t95.t98.t101.t104.t107.t110.t113.t116.t119.t122.t125.t128.t131.t134.t137.t140.t143.t146.t149.t152.t155.t158.t161.t164.t167.t170.t173.t176.t179.t183.t186.t190.t193.t196.t200.t201.t194.t191.t184.t177.t174.t171.t168.t165.t159.t150.t147.t144.t141.t138.t135.t132.t129.t126.t123.t120.t117.t114.t111.t108.t105.t102.t99.t96.t93.t90.t87.t84.t81.t300.t301.t299, t79.t205.t207.t210.t211.t212.t213.t217.t221.t225.t229.t233.t237.t241.t246.t251.t255.t259.t263.t281.t285.t289.t293.t297.t305.t309.t313.t317.t321.t325.t331.t337.t343.t347.t352.t356.t338.t298.t304.t80.t83.t86.t89.t92.t95.t98.t101.t104.t107.t110.t113.t116.t119.t122.t125.t128.t131.t134.t137.t140.t143.t146.t149.t152.t155.t158.t161.t164.t167.t170.t173.t176.t179.t183.t186.t190.t193.t196.t200.t201.t194.t191.t184.t177.t174.t171.t168.t165.t159.t150.t147.t144.t141.t138.t135.t132.t129.t126.t123.t120.t117.t114.t111.t108.t105.t102.t99.t96.t93.t90.t87.t84.t81.t300.t301.t302.t303, t479.t77.t300.t301.t299, t479.t77.t300.t301.t302.t303, t480.t77.t300.t301.t299, t480.t77.t300.t301.t302.t303, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/88/28/152
Computing Next relation with stutter on 109584 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
478 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.7991,197328,1,0,465,679180,295,380,6611,633303,742
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-19-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-19-02 finished in 7202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X((p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 509
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 509
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 584 transition count 505
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 581 transition count 502
Applied a total of 30 rules in 100 ms. Remains 581 /596 variables (removed 15) and now considering 502/517 (removed 15) transitions.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:25:29] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:25:29] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:25:29] [INFO ] Computed 117 place invariants in 7 ms
[2021-05-09 08:25:30] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:25:30] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:25:30] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/596 places, 502/517 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-19-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s254 0), p1:(NEQ s337 0), p2:(NEQ s472 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-03 finished in 1482 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G((p1&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 509
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 509
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 583 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 580 transition count 501
Applied a total of 32 rules in 83 ms. Remains 580 /596 variables (removed 16) and now considering 501/517 (removed 16) transitions.
// Phase 1: matrix 501 rows 580 cols
[2021-05-09 08:25:30] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:25:30] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2021-05-09 08:25:30] [INFO ] Computed 117 place invariants in 3 ms
[2021-05-09 08:25:31] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2021-05-09 08:25:31] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:25:31] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 580/596 places, 501/517 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s320 1), p1:(OR (EQ s75 0) (EQ s314 0) (EQ s545 0)), p2:(NEQ s501 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 590 reset in 254 ms.
Product exploration explored 100000 steps with 589 reset in 250 ms.
Graph (complete) has 1297 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 64 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Product exploration explored 100000 steps with 589 reset in 237 ms.
Product exploration explored 100000 steps with 587 reset in 269 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 580/580 places, 501/501 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 580 transition count 501
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 118 Pre rules applied. Total rules applied 64 place count 580 transition count 758
Deduced a syphon composed of 182 places in 2 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 182 place count 580 transition count 758
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 204 place count 558 transition count 681
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 226 place count 558 transition count 681
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 325 places in 0 ms
Iterating global reduction 1 with 165 rules applied. Total rules applied 391 place count 558 transition count 681
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 434 place count 515 transition count 638
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 477 place count 515 transition count 638
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 284 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 479 place count 515 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 480 place count 515 transition count 641
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 482 place count 513 transition count 637
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 484 place count 513 transition count 637
Deduced a syphon composed of 282 places in 0 ms
Applied a total of 484 rules in 132 ms. Remains 513 /580 variables (removed 67) and now considering 637/501 (removed -136) transitions.
[2021-05-09 08:25:33] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 637 rows 513 cols
[2021-05-09 08:25:33] [INFO ] Computed 117 place invariants in 18 ms
[2021-05-09 08:25:33] [INFO ] Dead Transitions using invariants and state equation in 421 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/580 places, 637/501 transitions.
Product exploration explored 100000 steps with 14073 reset in 738 ms.
Product exploration explored 100000 steps with 14105 reset in 669 ms.
[2021-05-09 08:25:35] [INFO ] Flatten gal took : 50 ms
[2021-05-09 08:25:35] [INFO ] Flatten gal took : 32 ms
[2021-05-09 08:25:35] [INFO ] Time to serialize gal into /tmp/LTL13516181789177605702.gal : 5 ms
[2021-05-09 08:25:35] [INFO ] Time to serialize properties into /tmp/LTL17148279042031320634.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13516181789177605702.gal, -t, CGAL, -LTL, /tmp/LTL17148279042031320634.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13516181789177605702.gal -t CGAL -LTL /tmp/LTL17148279042031320634.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p369==1)"))||(G(("(((p80==0)||(p362==0))||(p737==0))")&&(X(G("(p641!=1)")))))))
Formula 0 simplified : !(F"(p369==1)" | G("(((p80==0)||(p362==0))||(p737==0))" & XG"(p641!=1)"))
Detected timeout of ITS tools.
[2021-05-09 08:25:50] [INFO ] Flatten gal took : 15 ms
[2021-05-09 08:25:50] [INFO ] Applying decomposition
[2021-05-09 08:25:50] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18423292680897310858.txt, -o, /tmp/graph18423292680897310858.bin, -w, /tmp/graph18423292680897310858.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18423292680897310858.bin, -l, -1, -v, -w, /tmp/graph18423292680897310858.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:25:50] [INFO ] Decomposing Gal with order
[2021-05-09 08:25:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:25:50] [INFO ] Removed a total of 289 redundant transitions.
[2021-05-09 08:25:50] [INFO ] Flatten gal took : 62 ms
[2021-05-09 08:25:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 19 ms.
[2021-05-09 08:25:50] [INFO ] Time to serialize gal into /tmp/LTL7247820885654327707.gal : 14 ms
[2021-05-09 08:25:50] [INFO ] Time to serialize properties into /tmp/LTL13328590129617117671.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7247820885654327707.gal, -t, CGAL, -LTL, /tmp/LTL13328590129617117671.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7247820885654327707.gal -t CGAL -LTL /tmp/LTL13328590129617117671.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i19.i2.u120.p369==1)"))||(G(("(((i9.i1.u31.p80==0)||(i19.i1.u119.p362==0))||(i21.i1.u160.p737==0))")&&(X(G("(i21.i1.u160.p641!=1)")))))))
Formula 0 simplified : !(F"(i19.i2.u120.p369==1)" | G("(((i9.i1.u31.p80==0)||(i19.i1.u119.p362==0))||(i21.i1.u160.p737==0))" & XG"(i21.i1.u160.p641!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t297, t309, t317, t325, t356, t403, t406, t480, t484, t486, t488, t491, t494, t503, t512, i0.u85.t240, i0.u87.t236, i0.u155.t90, i1.u89.t232, i1.u91.t228, i2.i0.u83.t244, i2.i0.u84.t243, i2.i1.u152.t99, i2.i1.u153.t96, i2.i1.u154.t93, i2.i1.u156.t87, i3.i0.u77.t258, i3.i0.u79.t254, i3.i1.u75.t262, i4.u54.t288, i4.u56.t284, i5.u50.t296, i5.u52.t292, i6.t313, i6.u41.t316, i6.u45.t308, i7.t321, i7.u35.t330, i7.u37.t324, i7.u135.t150, i8.i0.u20.t359, i8.i1.u26.t346, i8.i2.u125.t184, i8.i2.u126.t180, i9.i0.u28.t342, i9.i1.u31.t336, i10.i0.u43.t312, i10.i1.u139.t138, i10.i1.u140.t135, i11.t5, i11.t2, i11.i0.t3, i11.i0.t4, i11.i0.t265, i11.i0.u58.t280, i11.i0.u143.t126, i11.i1.u145.t120, i11.i2.u146.t117, i12.i0.u158.t84, i12.i0.u159.t81, i12.i1.u99.t209, i12.i2.u101.t206, i13.t213, i13.u93.t224, i13.u97.t216, i14.i0.u81.t249, i14.i0.u82.t248, i14.i1.u148.t111, i14.i1.u149.t108, i14.i1.u150.t105, i14.i1.u151.t102, i15.i0.u144.t123, i15.i0.u147.t114, i15.i1.u141.t132, i15.i1.u142.t129, i16.u39.t320, i16.u136.t147, i16.u137.t144, i16.u138.t141, i17.i0.u95.t220, i17.i1.u127.t177, i17.i1.u128.t174, i17.i1.u129.t171, i18.u22.t355, i18.u24.t350, i18.u25.t349, i18.u124.t187, i19.i0.u18.t364, i19.i1.u119.t201, i19.i1.u122.t194, i19.i1.u123.t191, i19.i2.t198, i19.i2.u121.t199, i20.i0.u133.t159, i20.i1.u130.t168, i20.i1.u131.t165, i21.i0.t304, i21.i1.t6, i21.i1.u160.t48, i21.i1.u160.t77, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/358/104/498
Computing Next relation with stutter on 109584 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
712 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.21368,317356,1,0,705651,605,8459,776650,306,2091,1640035
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-19-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-19-04 finished in 28610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(G(p0))||(p1 U ((p1&&G(!p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 509
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 509
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 584 transition count 505
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 581 transition count 502
Applied a total of 30 rules in 152 ms. Remains 581 /596 variables (removed 15) and now considering 502/517 (removed 15) transitions.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:25:59] [INFO ] Computed 117 place invariants in 10 ms
[2021-05-09 08:25:59] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:25:59] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:26:00] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:26:00] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:26:00] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/596 places, 502/517 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 0}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p2 p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 1}, { cond=(AND p2 p1), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 3}], [{ cond=true, acceptance={} source=9 dest: 8}], [{ cond=true, acceptance={} source=10 dest: 9}]], initial=10, aps=[p0:(NEQ s334 1), p1:(NEQ s38 1), p2:(EQ s128 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2076 steps with 10 reset in 8 ms.
FORMULA BusinessProcesses-PT-19-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-05 finished in 1625 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 284 edges and 596 vertex of which 6 / 596 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 590 transition count 438
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 438
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 145 place count 518 transition count 315
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 415 place count 371 transition count 315
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 425 place count 361 transition count 305
Iterating global reduction 2 with 10 rules applied. Total rules applied 435 place count 361 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 436 place count 360 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 437 place count 360 transition count 304
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 317 rules applied. Total rules applied 754 place count 199 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 756 place count 198 transition count 151
Applied a total of 756 rules in 86 ms. Remains 198 /596 variables (removed 398) and now considering 151/517 (removed 366) transitions.
// Phase 1: matrix 151 rows 198 cols
[2021-05-09 08:26:00] [INFO ] Computed 88 place invariants in 4 ms
[2021-05-09 08:26:01] [INFO ] Implicit Places using invariants in 173 ms returned [1, 4, 5, 6, 7, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 174 ms to find 28 implicit places.
[2021-05-09 08:26:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 151 rows 170 cols
[2021-05-09 08:26:01] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 08:26:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 170/596 places, 151/517 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2021-05-09 08:26:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 151 rows 170 cols
[2021-05-09 08:26:01] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 08:26:01] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/596 places, 151/517 transitions.
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s36 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-06 finished in 490 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 284 edges and 596 vertex of which 6 / 596 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 590 transition count 438
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 438
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 145 place count 518 transition count 314
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 418 place count 369 transition count 314
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 428 place count 359 transition count 304
Iterating global reduction 2 with 10 rules applied. Total rules applied 438 place count 359 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 439 place count 358 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 358 transition count 303
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 317 rules applied. Total rules applied 757 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 759 place count 196 transition count 150
Applied a total of 759 rules in 38 ms. Remains 196 /596 variables (removed 400) and now considering 150/517 (removed 367) transitions.
// Phase 1: matrix 150 rows 196 cols
[2021-05-09 08:26:01] [INFO ] Computed 87 place invariants in 1 ms
[2021-05-09 08:26:01] [INFO ] Implicit Places using invariants in 121 ms returned [1, 2, 3, 4, 5, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 121 ms to find 28 implicit places.
[2021-05-09 08:26:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 168 cols
[2021-05-09 08:26:01] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:26:01] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 168/596 places, 150/517 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2021-05-09 08:26:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 168 cols
[2021-05-09 08:26:01] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:26:01] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 168/596 places, 150/517 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s39 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-07 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 287 edges and 596 vertex of which 6 / 596 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.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 591 transition count 438
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 518 transition count 438
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 147 place count 518 transition count 313
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 422 place count 368 transition count 313
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 432 place count 358 transition count 303
Iterating global reduction 2 with 10 rules applied. Total rules applied 442 place count 358 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 443 place count 357 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 444 place count 357 transition count 302
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 763 place count 195 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 765 place count 194 transition count 148
Applied a total of 765 rules in 33 ms. Remains 194 /596 variables (removed 402) and now considering 148/517 (removed 369) transitions.
// Phase 1: matrix 148 rows 194 cols
[2021-05-09 08:26:01] [INFO ] Computed 87 place invariants in 1 ms
[2021-05-09 08:26:01] [INFO ] Implicit Places using invariants in 217 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 217 ms to find 28 implicit places.
[2021-05-09 08:26:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 148 rows 166 cols
[2021-05-09 08:26:01] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:26:02] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Starting structural reductions, iteration 1 : 166/596 places, 148/517 transitions.
Applied a total of 0 rules in 3 ms. Remains 166 /166 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2021-05-09 08:26:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 148 rows 166 cols
[2021-05-09 08:26:02] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:26:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 166/596 places, 148/517 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20094 reset in 222 ms.
Product exploration explored 100000 steps with 20044 reset in 289 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20069 reset in 192 ms.
Product exploration explored 100000 steps with 19953 reset in 243 ms.
[2021-05-09 08:26:03] [INFO ] Flatten gal took : 7 ms
[2021-05-09 08:26:03] [INFO ] Flatten gal took : 6 ms
[2021-05-09 08:26:03] [INFO ] Time to serialize gal into /tmp/LTL6541133072555344476.gal : 1 ms
[2021-05-09 08:26:03] [INFO ] Time to serialize properties into /tmp/LTL15608222413531185752.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6541133072555344476.gal, -t, CGAL, -LTL, /tmp/LTL15608222413531185752.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6541133072555344476.gal -t CGAL -LTL /tmp/LTL15608222413531185752.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p0!=1)"))))
Formula 0 simplified : !FG"(p0!=1)"
Reverse transition relation is NOT exact ! Due to transitions t334.t335.t1.t336, t276.t278.t279.t2.t280, t273.t274.t3.t280, t270.t271.t4.t280, t267.t268.t5.t280, t57.t58.t6, t40.t42.t43.t7, t37.t38.t8, t34.t35.t9, t31.t32.t10, t54.t156.t157.t326.t494.t329.t330.t77, t53.t151.t322.t373.t491.t323.t324.t77, t52.t148.t318.t489.t319.t320.t77, t52.t145.t318.t488.t319.t320.t77, t51.t142.t314.t372.t486.t315.t316.t77, t50.t139.t310.t376.t484.t311.t312.t77, t127.t430.t265.t280.t77, t121.t425.t265.t280.t77, t118.t420.t265.t280.t77, t479.t77.t300.t301.t299, t479.t77.t300.t301.t302.t303, t480.t77.t300.t301.t299, t480.t77.t300.t301.t302.t303, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/89/23/148
Computing Next relation with stutter on 109584 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1169 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.722,377224,1,0,557,1.40264e+06,289,595,6530,2.00144e+06,1148
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-19-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-19-10 finished in 14962 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 285 edges and 596 vertex of which 6 / 596 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 590 transition count 438
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 438
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 145 place count 518 transition count 314
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 417 place count 370 transition count 314
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 427 place count 360 transition count 304
Iterating global reduction 2 with 10 rules applied. Total rules applied 437 place count 360 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 438 place count 359 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 359 transition count 303
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 317 rules applied. Total rules applied 756 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 758 place count 197 transition count 150
Applied a total of 758 rules in 33 ms. Remains 197 /596 variables (removed 399) and now considering 150/517 (removed 367) transitions.
// Phase 1: matrix 150 rows 197 cols
[2021-05-09 08:26:16] [INFO ] Computed 88 place invariants in 3 ms
[2021-05-09 08:26:16] [INFO ] Implicit Places using invariants in 165 ms returned [1, 2, 6, 7, 8, 16, 17, 18, 19, 20, 21, 24, 25, 26, 27, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 145]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 179 ms to find 29 implicit places.
[2021-05-09 08:26:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 168 cols
[2021-05-09 08:26:16] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:26:16] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 168/596 places, 150/517 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2021-05-09 08:26:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 168 cols
[2021-05-09 08:26:16] [INFO ] Computed 59 place invariants in 7 ms
[2021-05-09 08:26:17] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 168/596 places, 150/517 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-12 finished in 482 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 587 transition count 508
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 587 transition count 508
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 583 transition count 504
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 581 transition count 502
Applied a total of 30 rules in 129 ms. Remains 581 /596 variables (removed 15) and now considering 502/517 (removed 15) transitions.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:26:17] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:26:17] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:26:17] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:26:18] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:26:18] [INFO ] Computed 117 place invariants in 10 ms
[2021-05-09 08:26:18] [INFO ] Dead Transitions using invariants and state equation in 275 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/596 places, 502/517 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(NEQ s534 1), p1:(EQ s370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-13 finished in 1454 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 586 transition count 507
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 586 transition count 507
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 581 transition count 502
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 578 transition count 499
Applied a total of 36 rules in 103 ms. Remains 578 /596 variables (removed 18) and now considering 499/517 (removed 18) transitions.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:26:18] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:26:18] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:26:18] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:26:19] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:26:19] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:26:19] [INFO ] Dead Transitions using invariants and state equation in 246 ms returned []
Finished structural reductions, in 1 iterations. Remains : 578/596 places, 499/517 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s187 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Product exploration explored 100000 steps with 50000 reset in 542 ms.
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 578 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 578/578 places, 499/499 transitions.
Graph (trivial) has 269 edges and 578 vertex of which 6 / 578 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.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 573 transition count 493
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 117 Pre rules applied. Total rules applied 64 place count 573 transition count 753
Deduced a syphon composed of 180 places in 3 ms
Iterating global reduction 1 with 117 rules applied. Total rules applied 181 place count 573 transition count 753
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 203 place count 551 transition count 676
Deduced a syphon composed of 158 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 225 place count 551 transition count 676
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 324 places in 1 ms
Iterating global reduction 1 with 166 rules applied. Total rules applied 391 place count 551 transition count 676
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 434 place count 508 transition count 633
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 477 place count 508 transition count 633
Deduced a syphon composed of 281 places in 0 ms
Applied a total of 477 rules in 91 ms. Remains 508 /578 variables (removed 70) and now considering 633/499 (removed -134) transitions.
[2021-05-09 08:26:22] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 633 rows 508 cols
[2021-05-09 08:26:22] [INFO ] Computed 117 place invariants in 9 ms
[2021-05-09 08:26:22] [INFO ] Dead Transitions using invariants and state equation in 360 ms returned []
Finished structural reductions, in 1 iterations. Remains : 508/578 places, 633/499 transitions.
Product exploration explored 100000 steps with 50000 reset in 1599 ms.
Product exploration explored 100000 steps with 50000 reset in 1473 ms.
[2021-05-09 08:26:25] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:26:25] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:26:25] [INFO ] Time to serialize gal into /tmp/LTL4130909067503054954.gal : 2 ms
[2021-05-09 08:26:25] [INFO ] Time to serialize properties into /tmp/LTL1207203592663836369.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4130909067503054954.gal, -t, CGAL, -LTL, /tmp/LTL1207203592663836369.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4130909067503054954.gal -t CGAL -LTL /tmp/LTL1207203592663836369.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p214!=1)"))))
Formula 0 simplified : !XF"(p214!=1)"
Detected timeout of ITS tools.
[2021-05-09 08:26:40] [INFO ] Flatten gal took : 15 ms
[2021-05-09 08:26:40] [INFO ] Applying decomposition
[2021-05-09 08:26:40] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4937680806711953708.txt, -o, /tmp/graph4937680806711953708.bin, -w, /tmp/graph4937680806711953708.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4937680806711953708.bin, -l, -1, -v, -w, /tmp/graph4937680806711953708.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:26:40] [INFO ] Decomposing Gal with order
[2021-05-09 08:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:26:40] [INFO ] Removed a total of 290 redundant transitions.
[2021-05-09 08:26:40] [INFO ] Flatten gal took : 61 ms
[2021-05-09 08:26:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 23 ms.
[2021-05-09 08:26:41] [INFO ] Time to serialize gal into /tmp/LTL5837517904008789754.gal : 7 ms
[2021-05-09 08:26:41] [INFO ] Time to serialize properties into /tmp/LTL14859913027176973442.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5837517904008789754.gal, -t, CGAL, -LTL, /tmp/LTL14859913027176973442.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5837517904008789754.gal -t CGAL -LTL /tmp/LTL14859913027176973442.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i17.i0.u72.p214!=1)"))))
Formula 0 simplified : !XF"(i17.i0.u72.p214!=1)"
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t297, t317, t356, t403, t406, t479, t480, t484, t486, t488, t489, t491, t494, t503, t511, i0.t213, i0.i0.u92.t224, i0.i0.u94.t220, i0.i1.u96.t216, i1.i0.u54.t288, i1.i0.u56.t284, i1.i1.u50.t296, i2.t325, i2.t321, i2.u35.t330, i2.u37.t324, i2.u135.t150, i3.i0.u19.t359, i3.i0.u21.t355, i3.i1.u124.t187, i3.i1.u125.t184, i3.i1.u126.t180, i3.i1.u127.t177, i4.i0.u17.t364, i4.i1.u120.t201, i4.i1.u121.t197, i5.i0.t342, i5.i0.u25.t346, i6.i0.u31.t336, i6.i1.u128.t174, i6.i1.u129.t171, i6.i1.u130.t168, i7.i0.t309, i7.i0.t313, i7.i0.u41.t316, i7.i0.u43.t312, i7.i1.u39.t320, i7.i2.u137.t144, i7.i2.u138.t141, i7.i2.u139.t138, i8.i0.t304, i8.i1.t6, i8.i1.u159.t77, i9.i0.u82.t244, i9.i0.u83.t243, i9.i1.u152.t99, i9.i1.u153.t96, i10.i0.u84.t240, i10.i1.u157.t84, i10.i1.u158.t81, i10.i2.u154.t93, i10.i2.u155.t90, i10.i2.u156.t87, i11.i0.u100.t206, i11.i1.u98.t209, i12.u86.t236, i12.u88.t232, i12.u90.t228, i13.i0.u76.t258, i13.i0.u78.t254, i13.i1.u74.t262, i13.i2.u147.t114, i13.i2.u148.t111, i13.i2.u149.t108, i14.i0.u52.t292, i14.i1.u142.t129, i14.i1.u144.t123, i14.i2.u140.t135, i14.i2.u141.t132, i15.i0.u45.t308, i15.i1.u131.t165, i15.i1.u133.t159, i15.i1.u136.t147, i16.i0.u23.t350, i16.i0.u24.t349, i16.i1.u122.t194, i16.i1.u123.t191, i17.t3, i17.t2, i17.i0.t4, i17.i0.t5, i17.i0.u58.t265, i17.i0.u58.t280, i17.i0.u146.t117, i17.i1.u143.t126, i17.i2.u145.t120, i18.i0.u80.t249, i18.i0.u81.t248, i18.i1.u150.t105, i18.i1.u151.t102, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/356/104/496
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11668239029039289908
[2021-05-09 08:26:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11668239029039289908
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11668239029039289908]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11668239029039289908] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11668239029039289908] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-19-14 finished in 38619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 285 edges and 596 vertex of which 6 / 596 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 590 transition count 438
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 438
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 145 place count 518 transition count 313
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 420 place count 368 transition count 313
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 429 place count 359 transition count 304
Iterating global reduction 2 with 9 rules applied. Total rules applied 438 place count 359 transition count 304
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 317 rules applied. Total rules applied 755 place count 198 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 757 place count 197 transition count 151
Applied a total of 757 rules in 90 ms. Remains 197 /596 variables (removed 399) and now considering 151/517 (removed 366) transitions.
// Phase 1: matrix 151 rows 197 cols
[2021-05-09 08:26:57] [INFO ] Computed 87 place invariants in 1 ms
[2021-05-09 08:26:57] [INFO ] Implicit Places using invariants in 185 ms returned [1, 2, 3, 4, 5, 16, 17, 18, 19, 20, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 186 ms to find 27 implicit places.
[2021-05-09 08:26:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 151 rows 170 cols
[2021-05-09 08:26:57] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 08:26:57] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Starting structural reductions, iteration 1 : 170/596 places, 151/517 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2021-05-09 08:26:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 151 rows 170 cols
[2021-05-09 08:26:57] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-09 08:26:57] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/596 places, 151/517 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25729 steps with 5510 reset in 70 ms.
FORMULA BusinessProcesses-PT-19-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-15 finished in 752 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16475634597185911490
[2021-05-09 08:26:57] [INFO ] Computing symmetric may disable matrix : 517 transitions.
[2021-05-09 08:26:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:26:57] [INFO ] Computing symmetric may enable matrix : 517 transitions.
[2021-05-09 08:26:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:26:57] [INFO ] Applying decomposition
[2021-05-09 08:26:57] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:26:58] [INFO ] Computing Do-Not-Accords matrix : 517 transitions.
[2021-05-09 08:26:58] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:26:58] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16475634597185911490
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16475634597185911490]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9539460846290185731.txt, -o, /tmp/graph9539460846290185731.bin, -w, /tmp/graph9539460846290185731.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9539460846290185731.bin, -l, -1, -v, -w, /tmp/graph9539460846290185731.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:26:58] [INFO ] Decomposing Gal with order
[2021-05-09 08:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:26:58] [INFO ] Removed a total of 298 redundant transitions.
[2021-05-09 08:26:58] [INFO ] Flatten gal took : 58 ms
[2021-05-09 08:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 8 ms.
[2021-05-09 08:26:58] [INFO ] Time to serialize gal into /tmp/LTLFireability4352842316205188102.gal : 6 ms
[2021-05-09 08:26:58] [INFO ] Time to serialize properties into /tmp/LTLFireability8041168606762481405.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability4352842316205188102.gal, -t, CGAL, -LTL, /tmp/LTLFireability8041168606762481405.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability4352842316205188102.gal -t CGAL -LTL /tmp/LTLFireability8041168606762481405.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(F(("((i10.i0.u106.p329==1)||(i15.i0.u22.p58==0))")||(("(i6.i1.u47.p142==1)")&&(X(G("(i6.i1.u47.p142==0)"))))))))
Formula 0 simplified : !XF("((i10.i0.u106.p329==1)||(i15.i0.u22.p58==0))" | ("(i6.i1.u47.p142==1)" & XG"(i6.i1.u47.p142==0)"))
Compilation finished in 2920 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16475634597185911490]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((((LTLAPp1==true)&&X([]((LTLAPp2==true))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16475634597185911490]
LTSmin run took 1664 ms.
FORMULA BusinessProcesses-PT-19-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16475634597185911490]
LTSmin run took 2801 ms.
FORMULA BusinessProcesses-PT-19-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620548825789

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-19"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-19, 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 r026-tajo-162038143900469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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