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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 159K 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-16-00
FORMULA_NAME BusinessProcesses-PT-16-01
FORMULA_NAME BusinessProcesses-PT-16-02
FORMULA_NAME BusinessProcesses-PT-16-03
FORMULA_NAME BusinessProcesses-PT-16-04
FORMULA_NAME BusinessProcesses-PT-16-05
FORMULA_NAME BusinessProcesses-PT-16-06
FORMULA_NAME BusinessProcesses-PT-16-07
FORMULA_NAME BusinessProcesses-PT-16-08
FORMULA_NAME BusinessProcesses-PT-16-09
FORMULA_NAME BusinessProcesses-PT-16-10
FORMULA_NAME BusinessProcesses-PT-16-11
FORMULA_NAME BusinessProcesses-PT-16-12
FORMULA_NAME BusinessProcesses-PT-16-13
FORMULA_NAME BusinessProcesses-PT-16-14
FORMULA_NAME BusinessProcesses-PT-16-15

=== Now, execution of the tool begins

BK_START 1620547461919

Running Version 0
[2021-05-09 08:04:23] [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:04:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:04:23] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-09 08:04:23] [INFO ] Transformed 638 places.
[2021-05-09 08:04:23] [INFO ] Transformed 578 transitions.
[2021-05-09 08:04:23] [INFO ] Found NUPN structural information;
[2021-05-09 08:04:23] [INFO ] Parsed PT model containing 638 places and 578 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 08:04:23] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 98 place count 532 transition count 477
Iterating global reduction 1 with 93 rules applied. Total rules applied 191 place count 532 transition count 477
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 239 place count 484 transition count 429
Iterating global reduction 1 with 48 rules applied. Total rules applied 287 place count 484 transition count 429
Applied a total of 287 rules in 103 ms. Remains 484 /630 variables (removed 146) and now considering 429/570 (removed 141) transitions.
// Phase 1: matrix 429 rows 484 cols
[2021-05-09 08:04:23] [INFO ] Computed 95 place invariants in 30 ms
[2021-05-09 08:04:24] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 429 rows 484 cols
[2021-05-09 08:04:24] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-09 08:04:24] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
// Phase 1: matrix 429 rows 484 cols
[2021-05-09 08:04:24] [INFO ] Computed 95 place invariants in 16 ms
[2021-05-09 08:04:24] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 484/630 places, 429/570 transitions.
[2021-05-09 08:04:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 08:04:25] [INFO ] Flatten gal took : 62 ms
FORMULA BusinessProcesses-PT-16-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:04:25] [INFO ] Flatten gal took : 28 ms
[2021-05-09 08:04:25] [INFO ] Input system was already deterministic with 429 transitions.
Incomplete random walk after 100000 steps, including 668 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 30) seen :16
Running SMT prover for 14 properties.
// Phase 1: matrix 429 rows 484 cols
[2021-05-09 08:04:25] [INFO ] Computed 95 place invariants in 9 ms
[2021-05-09 08:04:25] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-09 08:04:25] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:25] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 5 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 614 ms
[2021-05-09 08:04:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 14 ms returned sat
[2021-05-09 08:04:26] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 6 ms returned sat
[2021-05-09 08:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:26] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:04:26] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:04:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2021-05-09 08:04:27] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:04:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2021-05-09 08:04:27] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2021-05-09 08:04:27] [INFO ] Deduced a trap composed of 38 places in 23 ms of which 0 ms to minimize.
[2021-05-09 08:04:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 466 ms
[2021-05-09 08:04:27] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 22 ms.
[2021-05-09 08:04:28] [INFO ] Added : 291 causal constraints over 59 iterations in 1646 ms. Result :sat
[2021-05-09 08:04:28] [INFO ] [Real]Absence check using 57 positive place invariants in 31 ms returned sat
[2021-05-09 08:04:28] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:29] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-09 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2021-05-09 08:04:29] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 08:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:29] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2021-05-09 08:04:29] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:04:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 579 ms
[2021-05-09 08:04:30] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 26 ms.
[2021-05-09 08:04:31] [INFO ] Added : 213 causal constraints over 43 iterations in 1000 ms. Result :sat
[2021-05-09 08:04:31] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2021-05-09 08:04:31] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 08:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:31] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-09 08:04:31] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:04:31] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:04:31] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:04:31] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:04:31] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:04:32] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 8 ms to minimize.
[2021-05-09 08:04:33] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:04:33] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:04:33] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:04:33] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:04:33] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:04:33] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:04:34] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:04:35] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:04:35] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:04:35] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3881 ms
[2021-05-09 08:04:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-09 08:04:35] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:35] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-09 08:04:35] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:04:35] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:04:35] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:04:35] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 5 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:04:36] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 2 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:04:37] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:04:38] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:04:39] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:04:40] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:04:40] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4778 ms
[2021-05-09 08:04:40] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 42 ms.
[2021-05-09 08:04:41] [INFO ] Added : 257 causal constraints over 52 iterations in 1654 ms. Result :sat
[2021-05-09 08:04:41] [INFO ] [Real]Absence check using 57 positive place invariants in 14 ms returned sat
[2021-05-09 08:04:41] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 08:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:42] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-09 08:04:42] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:04:42] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:04:42] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:04:42] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:04:42] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:04:42] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:04:43] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 1 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:04:44] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:04:45] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:04:45] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3086 ms
[2021-05-09 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2021-05-09 08:04:45] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:45] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 08:04:45] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:04:45] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:04:45] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:04:45] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:04:45] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:04:46] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:04:47] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2427 ms
[2021-05-09 08:04:47] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 37 ms.
[2021-05-09 08:04:48] [INFO ] Added : 210 causal constraints over 42 iterations in 917 ms. Result :sat
[2021-05-09 08:04:48] [INFO ] [Real]Absence check using 57 positive place invariants in 13 ms returned sat
[2021-05-09 08:04:48] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 6 ms returned sat
[2021-05-09 08:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:48] [INFO ] [Real]Absence check using state equation in 108 ms returned unsat
[2021-05-09 08:04:49] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-09 08:04:49] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 08:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:49] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:04:49] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 905 ms
[2021-05-09 08:04:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2021-05-09 08:04:50] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:50] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:04:50] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2021-05-09 08:04:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:04:51] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:04:51] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:04:51] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:04:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 852 ms
[2021-05-09 08:04:51] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 33 ms.
[2021-05-09 08:04:52] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:04:52] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:04:53] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:04:53] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:04:53] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:04:53] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:04:53] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:04:53] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:04:54] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:04:54] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:04:54] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:04:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2026 ms
[2021-05-09 08:04:54] [INFO ] Added : 314 causal constraints over 64 iterations in 3554 ms. Result :sat
[2021-05-09 08:04:54] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-09 08:04:54] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:04:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:55] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:04:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:04:56] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:04:56] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:04:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1063 ms
[2021-05-09 08:04:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2021-05-09 08:04:56] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 08:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:56] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 08:04:56] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:04:56] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:04:56] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:04:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1000 ms
[2021-05-09 08:04:57] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 36 ms.
[2021-05-09 08:04:59] [INFO ] Added : 285 causal constraints over 57 iterations in 1578 ms. Result :sat
[2021-05-09 08:04:59] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-09 08:04:59] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:59] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 08:04:59] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:04:59] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:04:59] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:04:59] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:04:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 382 ms
[2021-05-09 08:04:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:59] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-09 08:04:59] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:59] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-09 08:05:00] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:05:00] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:05:00] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:05:00] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2021-05-09 08:05:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2021-05-09 08:05:00] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 33 ms.
[2021-05-09 08:05:01] [INFO ] Added : 231 causal constraints over 47 iterations in 1430 ms. Result :sat
[2021-05-09 08:05:01] [INFO ] [Real]Absence check using 57 positive place invariants in 15 ms returned sat
[2021-05-09 08:05:01] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 08:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:01] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:05:02] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:05:03] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:05:04] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:05:05] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:05:05] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:05:05] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:05:05] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3405 ms
[2021-05-09 08:05:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:05:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-09 08:05:05] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 08:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:05] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 08:05:05] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:05:05] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:05:06] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:05:07] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:05:07] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:05:07] [INFO ] Deduced a trap composed of 38 places in 22 ms of which 1 ms to minimize.
[2021-05-09 08:05:07] [INFO ] Deduced a trap composed of 36 places in 21 ms of which 1 ms to minimize.
[2021-05-09 08:05:07] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1634 ms
[2021-05-09 08:05:07] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 21 ms.
[2021-05-09 08:05:09] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:05:09] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:05:09] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:05:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 586 ms
[2021-05-09 08:05:09] [INFO ] Added : 317 causal constraints over 64 iterations in 2283 ms. Result :sat
[2021-05-09 08:05:09] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2021-05-09 08:05:09] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:09] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:05:09] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:05:09] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 712 ms
[2021-05-09 08:05:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:05:10] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-09 08:05:10] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 08:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:10] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:05:10] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:05:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 759 ms
[2021-05-09 08:05:11] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 23 ms.
[2021-05-09 08:05:13] [INFO ] Added : 287 causal constraints over 58 iterations in 1898 ms. Result :sat
[2021-05-09 08:05:13] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2021-05-09 08:05:13] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:13] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-09 08:05:13] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:05:13] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:05:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2021-05-09 08:05:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:05:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2021-05-09 08:05:13] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 08:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:14] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-09 08:05:14] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:05:14] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:05:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2021-05-09 08:05:14] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 24 ms.
[2021-05-09 08:05:15] [INFO ] Added : 214 causal constraints over 43 iterations in 1104 ms. Result :sat
[2021-05-09 08:05:15] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2021-05-09 08:05:15] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:15] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:05:15] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:05:15] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:05:16] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 103 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:05:17] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:05:18] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3574 ms
[2021-05-09 08:05:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:05:19] [INFO ] [Nat]Absence check using 57 positive place invariants in 13 ms returned sat
[2021-05-09 08:05:19] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 08:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:19] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:05:19] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:20] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1353 ms
[2021-05-09 08:05:20] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 18 ms.
[2021-05-09 08:05:22] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:05:22] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:05:22] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:05:22] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:05:22] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:05:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 731 ms
[2021-05-09 08:05:23] [INFO ] Added : 312 causal constraints over 64 iterations in 2229 ms. Result :sat
[2021-05-09 08:05:23] [INFO ] [Real]Absence check using 57 positive place invariants in 12 ms returned sat
[2021-05-09 08:05:23] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 6 ms returned sat
[2021-05-09 08:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:23] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-09 08:05:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:05:23] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2021-05-09 08:05:23] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:23] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:05:23] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:05:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:05:23] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:05:24] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:05:25] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2191 ms
[2021-05-09 08:05:25] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 17 ms.
[2021-05-09 08:05:26] [INFO ] Added : 241 causal constraints over 49 iterations in 1010 ms. Result :sat
[2021-05-09 08:05:26] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2021-05-09 08:05:26] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-09 08:05:27] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:05:27] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2021-05-09 08:05:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:05:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-09 08:05:27] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 08:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:27] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 08:05:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:05:27] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2021-05-09 08:05:27] [INFO ] Computed and/alt/rep : 422/926/422 causal constraints (skipped 6 transitions) in 23 ms.
[2021-05-09 08:05:28] [INFO ] Added : 268 causal constraints over 54 iterations in 1245 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-09 08:05:28] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-16-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 227 edges and 484 vertex of which 6 / 484 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 478 transition count 369
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 425 transition count 369
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 107 place count 425 transition count 269
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 323 place count 309 transition count 269
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 331 place count 301 transition count 261
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 340 place count 300 transition count 261
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 598 place count 169 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 168 transition count 138
Applied a total of 600 rules in 125 ms. Remains 168 /484 variables (removed 316) and now considering 138/429 (removed 291) transitions.
// Phase 1: matrix 138 rows 168 cols
[2021-05-09 08:05:28] [INFO ] Computed 74 place invariants in 1 ms
[2021-05-09 08:05:29] [INFO ] Implicit Places using invariants in 209 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 211 ms to find 21 implicit places.
[2021-05-09 08:05:29] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 138 rows 147 cols
[2021-05-09 08:05:29] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:05:29] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 147/484 places, 138/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:05:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 138 rows 147 cols
[2021-05-09 08:05:29] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:05:29] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 147/484 places, 138/429 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s83 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-00 finished in 837 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 474 transition count 419
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 474 transition count 419
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 471 transition count 416
Applied a total of 26 rules in 42 ms. Remains 471 /484 variables (removed 13) and now considering 416/429 (removed 13) transitions.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:05:29] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 08:05:29] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:05:29] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 08:05:30] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:05:30] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 08:05:30] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 471/484 places, 416/429 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-02 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s135 0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 666 reset in 224 ms.
Product exploration explored 100000 steps with 670 reset in 245 ms.
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 666 reset in 185 ms.
Product exploration explored 100000 steps with 677 reset in 240 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 215 edges and 471 vertex of which 6 / 471 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 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 466 transition count 410
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 95 Pre rules applied. Total rules applied 47 place count 466 transition count 623
Deduced a syphon composed of 141 places in 10 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 142 place count 466 transition count 623
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 155 place count 453 transition count 577
Deduced a syphon composed of 128 places in 2 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 168 place count 453 transition count 577
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 263 places in 1 ms
Iterating global reduction 1 with 135 rules applied. Total rules applied 303 place count 453 transition count 577
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 337 place count 419 transition count 543
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 371 place count 419 transition count 543
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 371 rules in 175 ms. Remains 419 /471 variables (removed 52) and now considering 543/416 (removed -127) transitions.
[2021-05-09 08:05:32] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 543 rows 419 cols
[2021-05-09 08:05:32] [INFO ] Computed 95 place invariants in 8 ms
[2021-05-09 08:05:32] [INFO ] Dead Transitions using invariants and state equation in 460 ms returned []
Finished structural reductions, in 1 iterations. Remains : 419/471 places, 543/416 transitions.
Product exploration explored 100000 steps with 14450 reset in 717 ms.
Product exploration explored 100000 steps with 14381 reset in 521 ms.
[2021-05-09 08:05:33] [INFO ] Flatten gal took : 33 ms
[2021-05-09 08:05:33] [INFO ] Flatten gal took : 42 ms
[2021-05-09 08:05:34] [INFO ] Time to serialize gal into /tmp/LTL1858369515472372507.gal : 11 ms
[2021-05-09 08:05:34] [INFO ] Time to serialize properties into /tmp/LTL16257817646032516146.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/LTL1858369515472372507.gal, -t, CGAL, -LTL, /tmp/LTL16257817646032516146.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/LTL1858369515472372507.gal -t CGAL -LTL /tmp/LTL16257817646032516146.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p162==0)")))))
Formula 0 simplified : !XXG"(p162==0)"
Detected timeout of ITS tools.
[2021-05-09 08:05:49] [INFO ] Flatten gal took : 43 ms
[2021-05-09 08:05:49] [INFO ] Applying decomposition
[2021-05-09 08:05:49] [INFO ] Flatten gal took : 31 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/graph6390316873258950213.txt, -o, /tmp/graph6390316873258950213.bin, -w, /tmp/graph6390316873258950213.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/graph6390316873258950213.bin, -l, -1, -v, -w, /tmp/graph6390316873258950213.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:05:50] [INFO ] Decomposing Gal with order
[2021-05-09 08:05:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:05:50] [INFO ] Removed a total of 282 redundant transitions.
[2021-05-09 08:05:50] [INFO ] Flatten gal took : 118 ms
[2021-05-09 08:05:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 18 ms.
[2021-05-09 08:05:50] [INFO ] Time to serialize gal into /tmp/LTL3740650838124132162.gal : 13 ms
[2021-05-09 08:05:50] [INFO ] Time to serialize properties into /tmp/LTL1914446932823047811.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/LTL3740650838124132162.gal, -t, CGAL, -LTL, /tmp/LTL1914446932823047811.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/LTL3740650838124132162.gal -t CGAL -LTL /tmp/LTL1914446932823047811.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i2.u49.p162==0)")))))
Formula 0 simplified : !XXG"(i2.u49.p162==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9098194281369131385
[2021-05-09 08:06:05] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9098194281369131385
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/ltsmin9098194281369131385]
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/ltsmin9098194281369131385] 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/ltsmin9098194281369131385] 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-16-02 finished in 36758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 226 edges and 484 vertex of which 6 / 484 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 478 transition count 371
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 427 transition count 371
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 103 place count 427 transition count 270
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 322 place count 309 transition count 270
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 330 place count 301 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 300 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 339 place count 300 transition count 261
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 341 place count 299 transition count 261
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 597 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 599 place count 168 transition count 139
Applied a total of 599 rules in 135 ms. Remains 168 /484 variables (removed 316) and now considering 139/429 (removed 290) transitions.
// Phase 1: matrix 139 rows 168 cols
[2021-05-09 08:06:06] [INFO ] Computed 73 place invariants in 1 ms
[2021-05-09 08:06:06] [INFO ] Implicit Places using invariants in 252 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 253 ms to find 20 implicit places.
[2021-05-09 08:06:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 148 cols
[2021-05-09 08:06:06] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:06:07] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Starting structural reductions, iteration 1 : 148/484 places, 139/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:06:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 148 cols
[2021-05-09 08:06:07] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:06:07] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/484 places, 139/429 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s120 1), p1:(NEQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 21727 reset in 295 ms.
Product exploration explored 100000 steps with 21854 reset in 211 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 21727 reset in 188 ms.
Product exploration explored 100000 steps with 21871 reset in 195 ms.
[2021-05-09 08:06:08] [INFO ] Flatten gal took : 9 ms
[2021-05-09 08:06:08] [INFO ] Flatten gal took : 9 ms
[2021-05-09 08:06:08] [INFO ] Time to serialize gal into /tmp/LTL6907291529863689435.gal : 2 ms
[2021-05-09 08:06:08] [INFO ] Time to serialize properties into /tmp/LTL10710961214464722554.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/LTL6907291529863689435.gal, -t, CGAL, -LTL, /tmp/LTL10710961214464722554.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/LTL6907291529863689435.gal -t CGAL -LTL /tmp/LTL10710961214464722554.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p589!=1)"))&&(F(G("(p568!=1)"))))))
Formula 0 simplified : !G(F"(p589!=1)" & FG"(p568!=1)")
Reverse transition relation is NOT exact ! Due to transitions t18, t30, t242.t243.t1.t244, t210.t212.t213.t2.t214, t207.t208.t3.t214, t204.t205.t4.t214, t201.t202.t5.t214, t46.t47.t6, t32.t34.t35.t7, t25.t26.t9, t22.t23.t10, t57.t164.t165.t291.t419.t292.t293.t71, t51.t161.t162.t272.t406.t273.t274.t71, t98.t333.t199.t214.t71, t91.t323.t199.t214.t71, t93.t94.t328.t199.t214.t71, t73.t174.t176.t179.t180.t181.t185.t189.t193.t197.t215.t219.t223.t227.t231.t235.t239.t245.t249.t253.t261.t267.t271.t275.t281.t285.t290.t262.t254.t260.t74.t77.t80.t83.t86.t89.t92.t96.t99.t102.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t158.t155.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t100.t97.t90.t87.t84.t81.t78.t75.t256.t257.t255, t73.t174.t176.t179.t180.t181.t185.t189.t193.t197.t215.t219.t223.t227.t231.t235.t239.t245.t249.t253.t261.t267.t271.t275.t281.t285.t290.t262.t254.t260.t74.t77.t80.t83.t86.t89.t92.t96.t99.t102.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t158.t155.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t100.t97.t90.t87.t84.t81.t78.t75.t256.t257.t258.t259, t396.t71.t256.t257.t255, t396.t71.t256.t257.t258.t259, t397.t71.t256.t257.t255, t397.t71.t256.t257.t258.t259, t398.t71.t256.t257.t255, t398.t71.t256.t257.t258.t259, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/79/24/139
Computing Next relation with stutter on 1215 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
752 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.55521,189624,1,0,239,678872,284,161,6017,385963,395
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-16-03 finished in 10456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&(p1||X((p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 475 transition count 420
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 475 transition count 420
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 473 transition count 418
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 473 transition count 418
Applied a total of 22 rules in 20 ms. Remains 473 /484 variables (removed 11) and now considering 418/429 (removed 11) transitions.
// Phase 1: matrix 418 rows 473 cols
[2021-05-09 08:06:16] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:06:17] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 418 rows 473 cols
[2021-05-09 08:06:17] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 08:06:17] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 418 rows 473 cols
[2021-05-09 08:06:17] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:06:17] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/484 places, 418/429 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p3), true]
Running random walk in product with property : BusinessProcesses-PT-16-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s363 1), p0:(NEQ s2 0), p3:(AND (EQ s417 1) (EQ s363 1)), p2:(EQ s417 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-04 finished in 1076 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&(p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 475 transition count 420
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 475 transition count 420
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 472 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 472 transition count 417
Applied a total of 24 rules in 25 ms. Remains 472 /484 variables (removed 12) and now considering 417/429 (removed 12) transitions.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:17] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:06:18] [INFO ] Implicit Places using invariants in 474 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:18] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:06:18] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:18] [INFO ] Computed 95 place invariants in 9 ms
[2021-05-09 08:06:19] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/484 places, 417/429 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-16-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s339 1), p2:(AND (EQ s118 1) (EQ s350 1) (EQ s437 1)), p0:(NEQ s459 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-06 finished in 1437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0&&X(p1)))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 474 transition count 419
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 474 transition count 419
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 471 transition count 416
Applied a total of 26 rules in 41 ms. Remains 471 /484 variables (removed 13) and now considering 416/429 (removed 13) transitions.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:06:19] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:06:19] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:06:19] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 08:06:20] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:06:20] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 08:06:20] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 471/484 places, 416/429 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s263 1), p2:(EQ s435 1), p1:(NEQ s378 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-07 finished in 1266 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 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 226 edges and 484 vertex of which 6 / 484 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 478 transition count 369
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 425 transition count 369
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 107 place count 425 transition count 271
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 320 place count 310 transition count 271
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 329 place count 301 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 339 place count 300 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 339 place count 300 transition count 261
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 341 place count 299 transition count 261
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 596 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 598 place count 169 transition count 139
Applied a total of 598 rules in 76 ms. Remains 169 /484 variables (removed 315) and now considering 139/429 (removed 290) transitions.
// Phase 1: matrix 139 rows 169 cols
[2021-05-09 08:06:20] [INFO ] Computed 74 place invariants in 2 ms
[2021-05-09 08:06:20] [INFO ] Implicit Places using invariants in 164 ms returned [1, 4, 5, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 165 ms to find 20 implicit places.
[2021-05-09 08:06:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 149 cols
[2021-05-09 08:06:20] [INFO ] Computed 54 place invariants in 3 ms
[2021-05-09 08:06:21] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Starting structural reductions, iteration 1 : 149/484 places, 139/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 149 /149 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:06:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 149 cols
[2021-05-09 08:06:21] [INFO ] Computed 54 place invariants in 5 ms
[2021-05-09 08:06:21] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/484 places, 139/429 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-10 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:(OR (EQ s2 0) (EQ s39 0) (EQ s104 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17861 reset in 195 ms.
Product exploration explored 100000 steps with 17961 reset in 182 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17919 reset in 194 ms.
Product exploration explored 100000 steps with 17868 reset in 250 ms.
[2021-05-09 08:06:22] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:06:22] [INFO ] Flatten gal took : 10 ms
[2021-05-09 08:06:22] [INFO ] Time to serialize gal into /tmp/LTL2606624056568560377.gal : 1 ms
[2021-05-09 08:06:22] [INFO ] Time to serialize properties into /tmp/LTL7248976763058776648.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/LTL2606624056568560377.gal, -t, CGAL, -LTL, /tmp/LTL7248976763058776648.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/LTL2606624056568560377.gal -t CGAL -LTL /tmp/LTL7248976763058776648.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p35==0)||(p297==0))||(p476==0))"))))
Formula 0 simplified : !GF"(((p35==0)||(p297==0))||(p476==0))"
Reverse transition relation is NOT exact ! Due to transitions t242.t243.t1.t244, t210.t212.t213.t2.t214, t207.t208.t3.t214, t204.t205.t4.t214, t201.t202.t5.t214, t46.t47.t6, t32.t34.t35.t7, t28.t29.t8.t30, t25.t26.t9, t22.t23.t10, t57.t164.t165.t291.t419.t292.t293.t71, t51.t161.t162.t272.t406.t273.t274.t71, t98.t333.t199.t214.t71, t91.t323.t199.t214.t71, t93.t94.t328.t199.t214.t71, t73.t174.t176.t179.t180.t181.t185.t189.t193.t197.t215.t219.t223.t227.t231.t235.t239.t245.t249.t253.t261.t267.t271.t275.t281.t285.t290.t262.t254.t260.t74.t77.t80.t83.t86.t89.t92.t96.t99.t102.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t158.t155.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t100.t97.t90.t87.t84.t81.t78.t75.t256.t257.t255, t73.t174.t176.t179.t180.t181.t185.t189.t193.t197.t215.t219.t223.t227.t231.t235.t239.t245.t249.t253.t261.t267.t271.t275.t281.t285.t290.t262.t254.t260.t74.t77.t80.t83.t86.t89.t92.t96.t99.t102.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t158.t155.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t100.t97.t90.t87.t84.t81.t78.t75.t256.t257.t258.t259, t396.t71.t256.t257.t255, t396.t71.t256.t257.t258.t259, t397.t71.t256.t257.t255, t397.t71.t256.t257.t258.t259, t398.t71.t256.t257.t255, t398.t71.t256.t257.t258.t259, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/80/23/139
Computing Next relation with stutter on 1215 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
682 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,6.88464,183544,1,0,175,619608,271,92,6083,321144,265
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-16-10 finished in 8821 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((((p1&&F(p2))||G(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 484 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 475 transition count 420
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 475 transition count 420
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 472 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 472 transition count 417
Applied a total of 24 rules in 30 ms. Remains 472 /484 variables (removed 12) and now considering 417/429 (removed 12) transitions.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:29] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:06:29] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:29] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:06:30] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:30] [INFO ] Computed 95 place invariants in 8 ms
[2021-05-09 08:06:30] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/484 places, 417/429 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s69 1) (EQ s322 1) (EQ s377 1)), p1:(NEQ s386 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-12 finished in 1064 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0))) U (F(p2)&&(p2||G(p3))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 475 transition count 420
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 475 transition count 420
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 472 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 472 transition count 417
Applied a total of 24 rules in 35 ms. Remains 472 /484 variables (removed 12) and now considering 417/429 (removed 12) transitions.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:30] [INFO ] Computed 95 place invariants in 5 ms
[2021-05-09 08:06:30] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:30] [INFO ] Computed 95 place invariants in 8 ms
[2021-05-09 08:06:31] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:06:31] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:06:31] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/484 places, 417/429 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-16-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s386 0), p3:(NEQ s195 1), p1:(AND (NEQ s386 1) (NEQ s38 1)), p0:(NEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Graph (complete) has 1084 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, p3, p1, p0]
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 475 ms.
Product exploration explored 100000 steps with 50000 reset in 413 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0))]
Support contains 3 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 472/472 places, 417/417 transitions.
Graph (trivial) has 213 edges and 472 vertex of which 6 / 472 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 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 467 transition count 411
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 97 Pre rules applied. Total rules applied 45 place count 467 transition count 626
Deduced a syphon composed of 141 places in 2 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 142 place count 467 transition count 626
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 157 place count 452 transition count 574
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 172 place count 452 transition count 574
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 259 places in 9 ms
Iterating global reduction 1 with 133 rules applied. Total rules applied 305 place count 452 transition count 574
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 336 place count 421 transition count 543
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 367 place count 421 transition count 543
Deduced a syphon composed of 228 places in 0 ms
Applied a total of 367 rules in 125 ms. Remains 421 /472 variables (removed 51) and now considering 543/417 (removed -126) transitions.
[2021-05-09 08:06:34] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 543 rows 421 cols
[2021-05-09 08:06:34] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:06:34] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Finished structural reductions, in 1 iterations. Remains : 421/472 places, 543/417 transitions.
Product exploration explored 100000 steps with 50000 reset in 1852 ms.
Product exploration explored 100000 steps with 50000 reset in 1354 ms.
[2021-05-09 08:06:37] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:06:37] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:06:37] [INFO ] Time to serialize gal into /tmp/LTL17585368072774758790.gal : 2 ms
[2021-05-09 08:06:37] [INFO ] Time to serialize properties into /tmp/LTL18285764920563845091.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/LTL17585368072774758790.gal, -t, CGAL, -LTL, /tmp/LTL18285764920563845091.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/LTL17585368072774758790.gal -t CGAL -LTL /tmp/LTL18285764920563845091.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(p45!=1)")U((G("(p45!=1)"))||("((p473!=1)&&(p45!=1))")))U((F("(p473==0)"))&&(("(p473==0)")||(G("(p230!=1)")))))))
Formula 0 simplified : !X(("(p45!=1)" U ("((p473!=1)&&(p45!=1))" | G"(p45!=1)")) U (F"(p473==0)" & ("(p473==0)" | G"(p230!=1)")))
Detected timeout of ITS tools.
[2021-05-09 08:06:53] [INFO ] Flatten gal took : 25 ms
[2021-05-09 08:06:53] [INFO ] Applying decomposition
[2021-05-09 08:06:53] [INFO ] Flatten gal took : 47 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/graph4433301758522286611.txt, -o, /tmp/graph4433301758522286611.bin, -w, /tmp/graph4433301758522286611.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/graph4433301758522286611.bin, -l, -1, -v, -w, /tmp/graph4433301758522286611.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:06:53] [INFO ] Decomposing Gal with order
[2021-05-09 08:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:06:53] [INFO ] Removed a total of 279 redundant transitions.
[2021-05-09 08:06:53] [INFO ] Flatten gal took : 37 ms
[2021-05-09 08:06:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 12 ms.
[2021-05-09 08:06:53] [INFO ] Time to serialize gal into /tmp/LTL3032680419003212657.gal : 6 ms
[2021-05-09 08:06:53] [INFO ] Time to serialize properties into /tmp/LTL17552903786253300595.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/LTL3032680419003212657.gal, -t, CGAL, -LTL, /tmp/LTL17552903786253300595.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/LTL3032680419003212657.gal -t CGAL -LTL /tmp/LTL17552903786253300595.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(i4.i0.u15.p45!=1)")U((G("(i4.i0.u15.p45!=1)"))||("((i3.i0.u130.p473!=1)&&(i4.i0.u15.p45!=1))")))U((F("(i3.i0.u130.p473==0)"))&&(("(i3.i0.u130.p473==0)")||(G("(i9.i0.u73.p230!=1)")))))))
Formula 0 simplified : !X(("(i4.i0.u15.p45!=1)" U ("((i3.i0.u130.p473!=1)&&(i4.i0.u15.p45!=1))" | G"(i4.i0.u15.p45!=1)")) U (F"(i3.i0.u130.p473==0)" & ("(i3.i0.u130.p473==0)" | G"(i9.i0.u73.p230!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t181, t253, t275, t285, t290, t397, t406, t407, t414, t419, t421, i0.i0.u75.t184, i0.i0.u126.t78, i0.i0.u127.t75, i0.i1.u77.t178, i0.i2.u79.t175, i1.u47.t226, i1.u49.t222, i2.u41.t238, i2.u43.t234, i2.u45.t230, i3.i0.t281, i3.i0.u12.t296, i3.i0.u13.t295, i3.i0.u18.t284, i3.i0.u97.t167, i3.i0.u130.t59, i3.i0.u130.t60, i3.i1.u95.t172, i3.i1.u96.t170, i4.i0.u14.t293, i4.i1.u101.t155, i4.i1.u102.t152, i5.u20.t279, i5.u21.t278, i5.u22.t274, i5.u100.t158, i6.i0.u33.t252, i6.i1.t266, i7.u112.t122, i7.u113.t119, i7.u114.t116, i7.u115.t113, i8.u37.t244, i9.i0.t185, i9.i0.u71.t192, i9.i0.u73.t188, i9.i1.u107.t137, i9.i1.u108.t134, i9.i2.u105.t143, i9.i2.u106.t140, i10.i0.u24.t270, i10.i1.u124.t84, i10.i1.u125.t81, i11.u35.t248, i11.u116.t110, i11.u117.t107, i12.u109.t131, i12.u110.t128, i12.u111.t125, i13.u16.t288, i13.u17.t287, i14.i0.u51.t218, i14.i0.u69.t196, i14.i1.u103.t149, i14.i1.u104.t146, i15.i0.u123.t87, i15.i1.u118.t103, i15.i1.u119.t100, i16.t3, i16.t2, i16.i0.t4, i16.i0.t5, i16.i0.u53.t199, i16.i0.u53.t214, i16.i0.u122.t90, i16.i1.u120.t97, i16.i3.u121.t93, i17.i0.t260, i17.i1.t6, i17.i1.u128.t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/293/85/414
Computing Next relation with stutter on 1215 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1010 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,10.1616,289232,1,0,593006,711,6480,944433,309,1872,1432694
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-16-13 finished in 34991 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U G(p1)) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 226 edges and 484 vertex of which 6 / 484 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 478 transition count 371
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 427 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 426 transition count 370
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 105 place count 426 transition count 269
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 324 place count 308 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 332 place count 300 transition count 261
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 341 place count 299 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 341 place count 299 transition count 260
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 343 place count 298 transition count 260
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 593 place count 171 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 170 transition count 141
Applied a total of 595 rules in 37 ms. Remains 170 /484 variables (removed 314) and now considering 141/429 (removed 288) transitions.
// Phase 1: matrix 141 rows 170 cols
[2021-05-09 08:07:05] [INFO ] Computed 73 place invariants in 1 ms
[2021-05-09 08:07:05] [INFO ] Implicit Places using invariants in 149 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 25, 50, 51, 52, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 150 ms to find 19 implicit places.
[2021-05-09 08:07:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 141 rows 151 cols
[2021-05-09 08:07:05] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 08:07:05] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 151/484 places, 141/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:07:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 141 rows 151 cols
[2021-05-09 08:07:05] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 08:07:05] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 151/484 places, 141/429 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), true, (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-16-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s102 0) (EQ s17 1)), p1:(EQ s17 0), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 37003 reset in 442 ms.
Stack based approach found an accepted trace after 68555 steps with 25386 reset with depth 7 and stack size 7 in 318 ms.
FORMULA BusinessProcesses-PT-16-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-14 finished in 1312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 227 edges and 484 vertex of which 6 / 484 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 478 transition count 370
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 426 transition count 370
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 105 place count 426 transition count 270
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 322 place count 309 transition count 270
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 330 place count 301 transition count 262
Iterating global reduction 2 with 8 rules applied. Total rules applied 338 place count 301 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 301 transition count 261
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 340 place count 300 transition count 261
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 594 place count 172 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 171 transition count 139
Applied a total of 596 rules in 40 ms. Remains 171 /484 variables (removed 313) and now considering 139/429 (removed 290) transitions.
// Phase 1: matrix 139 rows 171 cols
[2021-05-09 08:07:06] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-09 08:07:07] [INFO ] Implicit Places using invariants in 159 ms returned [1, 2, 3, 4, 5, 8, 9, 16, 17, 19, 21, 23, 24, 25, 26, 27, 28, 51, 52, 53, 54, 55, 128]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 160 ms to find 23 implicit places.
[2021-05-09 08:07:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 148 cols
[2021-05-09 08:07:07] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:07:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Starting structural reductions, iteration 1 : 148/484 places, 139/429 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:07:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 148 cols
[2021-05-09 08:07:07] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:07:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/484 places, 139/429 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s2 1), p1:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 21887 reset in 207 ms.
Product exploration explored 100000 steps with 21940 reset in 183 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 21893 reset in 180 ms.
Product exploration explored 100000 steps with 21838 reset in 183 ms.
[2021-05-09 08:07:08] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:07:08] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:07:08] [INFO ] Time to serialize gal into /tmp/LTL12678111353308763646.gal : 3 ms
[2021-05-09 08:07:08] [INFO ] Time to serialize properties into /tmp/LTL14573230978582643816.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/LTL12678111353308763646.gal, -t, CGAL, -LTL, /tmp/LTL14573230978582643816.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/LTL12678111353308763646.gal -t CGAL -LTL /tmp/LTL14573230978582643816.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p68!=1)"))&&(F(G("(p540!=1)"))))))
Formula 0 simplified : !G(F"(p68!=1)" & FG"(p540!=1)")
Reverse transition relation is NOT exact ! Due to transitions t242.t243.t1.t244, t210.t212.t213.t2.t214, t207.t208.t3.t214, t204.t205.t4.t214, t201.t202.t5.t214, t46.t47.t6, t32.t34.t35.t7, t28.t29.t8.t30, t25.t26.t9, t22.t23.t10, t57.t164.t165.t291.t419.t292.t293.t71, t51.t161.t162.t272.t406.t273.t274.t71, t98.t333.t199.t214.t71, t91.t323.t199.t214.t71, t93.t94.t328.t199.t214.t71, t73.t174.t176.t179.t180.t181.t185.t189.t193.t197.t215.t219.t223.t227.t231.t235.t239.t245.t249.t253.t261.t267.t271.t275.t281.t285.t290.t262.t254.t260.t74.t77.t80.t83.t86.t89.t92.t96.t99.t102.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t158.t155.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t100.t97.t90.t87.t84.t81.t78.t75.t256.t257.t255, t73.t174.t176.t179.t180.t181.t185.t189.t193.t197.t215.t219.t223.t227.t231.t235.t239.t245.t249.t253.t261.t267.t271.t275.t281.t285.t290.t262.t254.t260.t74.t77.t80.t83.t86.t89.t92.t96.t99.t102.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t158.t155.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t100.t97.t90.t87.t84.t81.t78.t75.t256.t257.t258.t259, t396.t71.t256.t257.t255, t396.t71.t256.t257.t258.t259, t397.t71.t256.t257.t255, t397.t71.t256.t257.t258.t259, t398.t71.t256.t257.t255, t398.t71.t256.t257.t258.t259, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/80/23/139
Computing Next relation with stutter on 1215 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
395 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.02082,115448,1,0,233,335699,284,148,5981,284440,400
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-16-15 finished in 5962 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18086827551093078457
[2021-05-09 08:07:12] [INFO ] Computing symmetric may disable matrix : 429 transitions.
[2021-05-09 08:07:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:07:12] [INFO ] Computing symmetric may enable matrix : 429 transitions.
[2021-05-09 08:07:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:07:12] [INFO ] Applying decomposition
[2021-05-09 08:07:12] [INFO ] Flatten gal took : 50 ms
[2021-05-09 08:07:12] [INFO ] Computing Do-Not-Accords matrix : 429 transitions.
[2021-05-09 08:07:12] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:07:12] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18086827551093078457
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/ltsmin18086827551093078457]
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/graph3726844435735826515.txt, -o, /tmp/graph3726844435735826515.bin, -w, /tmp/graph3726844435735826515.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/graph3726844435735826515.bin, -l, -1, -v, -w, /tmp/graph3726844435735826515.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:07:12] [INFO ] Decomposing Gal with order
[2021-05-09 08:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:07:12] [INFO ] Removed a total of 278 redundant transitions.
[2021-05-09 08:07:12] [INFO ] Flatten gal took : 34 ms
[2021-05-09 08:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2021-05-09 08:07:12] [INFO ] Time to serialize gal into /tmp/LTLFireability3319779227596563255.gal : 4 ms
[2021-05-09 08:07:12] [INFO ] Time to serialize properties into /tmp/LTLFireability17213499790892259402.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/LTLFireability3319779227596563255.gal, -t, CGAL, -LTL, /tmp/LTLFireability17213499790892259402.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/LTLFireability3319779227596563255.gal -t CGAL -LTL /tmp/LTLFireability17213499790892259402.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i10.u51.p162==0)")))))
Formula 0 simplified : !XXG"(i10.u51.p162==0)"
Compilation finished in 2195 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18086827551093078457]
Link finished in 65 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(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin18086827551093078457]
WARNING : LTSmin timed out (>300 s) on command 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(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin18086827551093078457]
Retrying LTSmin with larger timeout 2400 s
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(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin18086827551093078457]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.686: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.697: LTL layer: formula: X(X([]((LTLAPp0==true))))
pins2lts-mc-linux64( 4/ 8), 0.697: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.700: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.716: "X(X([]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.735: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.736: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.736: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.736: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.749: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.755: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.770: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.346: DFS-FIFO for weak LTL, using special progress label 431
pins2lts-mc-linux64( 0/ 8), 1.346: There are 432 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.346: State length is 485, there are 434 groups
pins2lts-mc-linux64( 0/ 8), 1.346: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.346: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.346: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.346: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 2.809: ~1 levels ~960 states ~6080 transitions
pins2lts-mc-linux64( 2/ 8), 2.868: ~1 levels ~1920 states ~10632 transitions
pins2lts-mc-linux64( 6/ 8), 2.909: ~1 levels ~3840 states ~27008 transitions
pins2lts-mc-linux64( 6/ 8), 2.990: ~1 levels ~7680 states ~56504 transitions
pins2lts-mc-linux64( 7/ 8), 3.150: ~1 levels ~15360 states ~118480 transitions
pins2lts-mc-linux64( 7/ 8), 3.495: ~1 levels ~30720 states ~239088 transitions
pins2lts-mc-linux64( 1/ 8), 4.267: ~1 levels ~61440 states ~596624 transitions
pins2lts-mc-linux64( 2/ 8), 5.744: ~1 levels ~122880 states ~1117312 transitions
pins2lts-mc-linux64( 3/ 8), 8.780: ~1 levels ~245760 states ~2664016 transitions
pins2lts-mc-linux64( 0/ 8), 14.371: ~1 levels ~491520 states ~4770024 transitions
pins2lts-mc-linux64( 0/ 8), 26.354: ~1 levels ~983040 states ~10121760 transitions
pins2lts-mc-linux64( 0/ 8), 50.725: ~1 levels ~1966080 states ~20514280 transitions
pins2lts-mc-linux64( 7/ 8), 105.246: ~1 levels ~3932160 states ~45994552 transitions
pins2lts-mc-linux64( 7/ 8), 210.267: ~1 levels ~7864320 states ~95132224 transitions
pins2lts-mc-linux64( 5/ 8), 462.558: ~1 levels ~15728640 states ~199916712 transitions
pins2lts-mc-linux64( 7/ 8), 524.979: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 525.067:
pins2lts-mc-linux64( 0/ 8), 525.067: mean standard work distribution: 7.5% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 525.067:
pins2lts-mc-linux64( 0/ 8), 525.067: Explored 16113612 states 218594576 transitions, fanout: 13.566
pins2lts-mc-linux64( 0/ 8), 525.067: Total exploration time 523.680 sec (523.590 sec minimum, 523.638 sec on average)
pins2lts-mc-linux64( 0/ 8), 525.067: States per second: 30770, Transitions per second: 417420
pins2lts-mc-linux64( 0/ 8), 525.067:
pins2lts-mc-linux64( 0/ 8), 525.067: Progress states detected: 31478350
pins2lts-mc-linux64( 0/ 8), 525.067: Redundant explorations: -48.8106
pins2lts-mc-linux64( 0/ 8), 525.067:
pins2lts-mc-linux64( 0/ 8), 525.067: Queue width: 8B, total height: 25756950, memory: 196.51MB
pins2lts-mc-linux64( 0/ 8), 525.067: Tree memory: 496.2MB, 16.5 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 525.067: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 525.067: Stored 431 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 525.067: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 525.067: Est. total memory use: 692.7MB (~1220.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin18086827551093078457]
255
java.lang.RuntimeException: Unexpected exception when executing 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(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin18086827551093078457]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t294, t374, t416, t430, t545, t547, t555, t563, t569, t570, i0.i0.u77.t297, i0.i0.u81.t284, i0.i1.u79.t287, i0.i2.u129.t157, i0.i2.u130.t153, i1.t298, i1.u52.t339, i1.u71.t309, i1.u75.t301, i2.u42.t359, i2.u44.t355, i2.u46.t351, i3.u34.t373, i3.u36.t369, i4.u24.t409, i4.u26.t403, i5.t424, i5.u13.t443, i5.u14.t440, i5.u17.t428, i5.u18.t427, i5.u135.t131, i5.u135.t133, i6.u96.t280, i6.u97.t277, i6.u98.t273, i7.u104.t249, i7.u105.t245, i8.i0.t410, i8.i0.u22.t413, i8.i1.u19.t423, i8.i2.t415, i8.i2.u23.t411, i9.t391, i10.u48.t347, i10.u50.t343, i11.t3, i11.t2, i11.i0.t4, i11.i0.t5, i11.i0.t316, i11.i0.u54.t335, i11.i0.u125.t173, i11.i1.u122.t181, i11.i2.t178, i11.i2.u124.t179, i12.u126.t169, i12.u127.t165, i12.u128.t161, i13.i0.u38.t365, i13.i1.u118.t193, i13.i1.u121.t185, i13.i2.t190, i13.i2.u119.t191, i14.i1.u28.t397, i14.i2.u115.t205, i14.i2.u116.t201, i14.i2.u117.t197, i15.u110.t225, i15.u111.t221, i15.u112.t217, i15.u113.t213, i15.u114.t209, i16.i0.u73.t305, i16.i1.u106.t241, i16.i1.u107.t237, i16.i1.u108.t233, i16.i1.u109.t229, i17.i0.u15.t437, i17.i1.u101.t261, i17.i1.u102.t257, i17.i1.u103.t253, i18.t141, i18.t54, i18.t23, i18.t6, i18.u131.t19, i18.u131.t45, i18.u131.t129, i18.u131.t147, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/298/93/427
Computing Next relation with stutter on 1215 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
71310 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,713.166,6576372,1,0,1.03255e+07,1092,3568,1.73995e+07,185,3684,1572778
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-16-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1620548807842

--------------------
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-16"
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-16, 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-162038143900445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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