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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-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 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 146K 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-12-00
FORMULA_NAME BusinessProcesses-PT-12-01
FORMULA_NAME BusinessProcesses-PT-12-02
FORMULA_NAME BusinessProcesses-PT-12-03
FORMULA_NAME BusinessProcesses-PT-12-04
FORMULA_NAME BusinessProcesses-PT-12-05
FORMULA_NAME BusinessProcesses-PT-12-06
FORMULA_NAME BusinessProcesses-PT-12-07
FORMULA_NAME BusinessProcesses-PT-12-08
FORMULA_NAME BusinessProcesses-PT-12-09
FORMULA_NAME BusinessProcesses-PT-12-10
FORMULA_NAME BusinessProcesses-PT-12-11
FORMULA_NAME BusinessProcesses-PT-12-12
FORMULA_NAME BusinessProcesses-PT-12-13
FORMULA_NAME BusinessProcesses-PT-12-14
FORMULA_NAME BusinessProcesses-PT-12-15

=== Now, execution of the tool begins

BK_START 1620545458252

Running Version 0
[2021-05-09 07:30:59] [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 07:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:31:00] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-09 07:31:00] [INFO ] Transformed 586 places.
[2021-05-09 07:31:00] [INFO ] Transformed 525 transitions.
[2021-05-09 07:31:00] [INFO ] Found NUPN structural information;
[2021-05-09 07:31:00] [INFO ] Parsed PT model containing 586 places and 525 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 79 place count 503 transition count 445
Iterating global reduction 1 with 76 rules applied. Total rules applied 155 place count 503 transition count 445
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 194 place count 464 transition count 406
Iterating global reduction 1 with 39 rules applied. Total rules applied 233 place count 464 transition count 406
Applied a total of 233 rules in 99 ms. Remains 464 /582 variables (removed 118) and now considering 406/521 (removed 115) transitions.
// Phase 1: matrix 406 rows 464 cols
[2021-05-09 07:31:00] [INFO ] Computed 95 place invariants in 31 ms
[2021-05-09 07:31:00] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 406 rows 464 cols
[2021-05-09 07:31:00] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-09 07:31:01] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
// Phase 1: matrix 406 rows 464 cols
[2021-05-09 07:31:01] [INFO ] Computed 95 place invariants in 21 ms
[2021-05-09 07:31:01] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 1 iterations. Remains : 464/582 places, 406/521 transitions.
[2021-05-09 07:31:01] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 07:31:01] [INFO ] Flatten gal took : 67 ms
FORMULA BusinessProcesses-PT-12-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:31:01] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:31:01] [INFO ] Input system was already deterministic with 406 transitions.
Incomplete random walk after 100000 steps, including 726 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 27) seen :12
Running SMT prover for 15 properties.
// Phase 1: matrix 406 rows 464 cols
[2021-05-09 07:31:01] [INFO ] Computed 95 place invariants in 10 ms
[2021-05-09 07:31:02] [INFO ] [Real]Absence check using 52 positive place invariants in 34 ms returned sat
[2021-05-09 07:31:02] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 18 ms returned sat
[2021-05-09 07:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:02] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-09 07:31:02] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 9 ms to minimize.
[2021-05-09 07:31:02] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2021-05-09 07:31:02] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:31:02] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:31:03] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:04] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 43 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 6 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Deduced a trap composed of 48 places in 24 ms of which 1 ms to minimize.
[2021-05-09 07:31:05] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3644 ms
[2021-05-09 07:31:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-09 07:31:06] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:31:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:06] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-09 07:31:06] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:31:06] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:31:06] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:31:06] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:31:06] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:31:06] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:31:07] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:31:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:31:09] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 3702 ms
[2021-05-09 07:31:09] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:31:11] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:31:11] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:31:12] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:31:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2021-05-09 07:31:12] [INFO ] Added : 287 causal constraints over 58 iterations in 2200 ms. Result :sat
[2021-05-09 07:31:12] [INFO ] [Real]Absence check using 52 positive place invariants in 26 ms returned sat
[2021-05-09 07:31:12] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 28 ms returned sat
[2021-05-09 07:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:12] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-09 07:31:12] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:31:12] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:31:12] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:31:13] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:14] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:31:15] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:31:16] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:31:17] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:31:17] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 4576 ms
[2021-05-09 07:31:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:17] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:31:17] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 07:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:17] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-09 07:31:17] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:31:17] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:31:17] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:31:17] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:31:18] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:31:19] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:31:20] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:31:21] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:31:21] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3695 ms
[2021-05-09 07:31:21] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:31:22] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:31:23] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:31:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2021-05-09 07:31:23] [INFO ] Added : 293 causal constraints over 59 iterations in 2159 ms. Result :sat
[2021-05-09 07:31:23] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2021-05-09 07:31:23] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 18 ms returned sat
[2021-05-09 07:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:23] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-09 07:31:23] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:31:23] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:31:23] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:31:24] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:31:25] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2947 ms
[2021-05-09 07:31:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:26] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2021-05-09 07:31:26] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 17 ms returned sat
[2021-05-09 07:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:26] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:31:26] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:31:27] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:31:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:31:29] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 3 ms to minimize.
[2021-05-09 07:31:29] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:31:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2021-05-09 07:31:29] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:31:29] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:31:29] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2589 ms
[2021-05-09 07:31:29] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-09 07:31:30] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2021-05-09 07:31:30] [INFO ] Added : 271 causal constraints over 55 iterations in 1569 ms. Result :sat
[2021-05-09 07:31:30] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2021-05-09 07:31:30] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 07:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:31] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:31:31] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:31:32] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1575 ms
[2021-05-09 07:31:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:32] [INFO ] [Nat]Absence check using 52 positive place invariants in 32 ms returned sat
[2021-05-09 07:31:32] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:32] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-09 07:31:32] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:31:33] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:31:34] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:31:34] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:31:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1220 ms
[2021-05-09 07:31:34] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-09 07:31:35] [INFO ] Added : 282 causal constraints over 57 iterations in 1394 ms. Result :sat
[2021-05-09 07:31:35] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:31:35] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:35] [INFO ] [Real]Absence check using state equation in 133 ms returned unsat
[2021-05-09 07:31:35] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2021-05-09 07:31:35] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 7 ms returned sat
[2021-05-09 07:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:35] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 3 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2021-05-09 07:31:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-09 07:31:36] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:36] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:31:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 355 ms
[2021-05-09 07:31:36] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-09 07:31:38] [INFO ] Added : 246 causal constraints over 50 iterations in 1476 ms. Result :sat
[2021-05-09 07:31:38] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2021-05-09 07:31:38] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 07:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:38] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-09 07:31:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:38] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2021-05-09 07:31:38] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:38] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:31:38] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 5 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Deduced a trap composed of 30 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:31:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1067 ms
[2021-05-09 07:31:39] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-09 07:31:41] [INFO ] Added : 273 causal constraints over 55 iterations in 1605 ms. Result :sat
[2021-05-09 07:31:41] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned sat
[2021-05-09 07:31:41] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 9 ms returned sat
[2021-05-09 07:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:41] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 07:31:41] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:31:41] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:31:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:31:42] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Deduced a trap composed of 27 places in 16 ms of which 0 ms to minimize.
[2021-05-09 07:31:43] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2081 ms
[2021-05-09 07:31:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:43] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2021-05-09 07:31:43] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:43] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:31:44] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:31:45] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1409 ms
[2021-05-09 07:31:45] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 29 ms.
[2021-05-09 07:31:47] [INFO ] Added : 259 causal constraints over 53 iterations in 1597 ms. Result :sat
[2021-05-09 07:31:47] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:31:47] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 07:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:47] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-09 07:31:47] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:31:47] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:31:47] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:31:47] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:31:47] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:31:47] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:31:48] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2158 ms
[2021-05-09 07:31:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:49] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-09 07:31:49] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:49] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:31:49] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:31:50] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:31:51] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2207 ms
[2021-05-09 07:31:51] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-09 07:31:53] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:31:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2021-05-09 07:31:53] [INFO ] Added : 278 causal constraints over 56 iterations in 1831 ms. Result :sat
[2021-05-09 07:31:53] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:31:53] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:54] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:31:54] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:31:54] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:31:54] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:31:54] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:31:54] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:31:54] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:31:55] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:31:56] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2754 ms
[2021-05-09 07:31:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:31:56] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-09 07:31:56] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:31:57] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:31:57] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:31:58] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:31:59] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2428 ms
[2021-05-09 07:31:59] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:32:01] [INFO ] Added : 277 causal constraints over 56 iterations in 1578 ms. Result :sat
[2021-05-09 07:32:01] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned sat
[2021-05-09 07:32:01] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 7 ms returned sat
[2021-05-09 07:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:01] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-09 07:32:01] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:32:01] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:32:01] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:32:01] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:32:01] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:32:02] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:32:03] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:32:04] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:32:04] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:32:04] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:32:04] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2934 ms
[2021-05-09 07:32:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:32:04] [INFO ] [Nat]Absence check using 52 positive place invariants in 25 ms returned sat
[2021-05-09 07:32:04] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 07:32:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:04] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-09 07:32:04] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:32:04] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:32:04] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:32:05] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:32:06] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:32:06] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:32:06] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:32:06] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:32:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1816 ms
[2021-05-09 07:32:06] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-09 07:32:07] [INFO ] Added : 282 causal constraints over 57 iterations in 1537 ms. Result :sat
[2021-05-09 07:32:07] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:32:07] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:08] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 546 ms
[2021-05-09 07:32:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:32:08] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:32:08] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:08] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-09 07:32:08] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:32:09] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:32:09] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:32:09] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:32:09] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:32:09] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:32:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 534 ms
[2021-05-09 07:32:09] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-09 07:32:11] [INFO ] Added : 281 causal constraints over 57 iterations in 1634 ms. Result :sat
[2021-05-09 07:32:11] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:32:11] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:11] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:32:11] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 936 ms
[2021-05-09 07:32:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:32:12] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:32:12] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:12] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:32:12] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:32:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1003 ms
[2021-05-09 07:32:13] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-09 07:32:14] [INFO ] Added : 242 causal constraints over 49 iterations in 1260 ms. Result :sat
[2021-05-09 07:32:14] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:32:14] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:15] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 07:32:15] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:32:15] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:32:15] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:32:15] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:32:15] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:32:15] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:32:16] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:32:16] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:32:16] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:32:16] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:32:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1309 ms
[2021-05-09 07:32:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:32:16] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:32:16] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-09 07:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:16] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:32:16] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:32:16] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:32:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1105 ms
[2021-05-09 07:32:17] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-09 07:32:19] [INFO ] Added : 288 causal constraints over 58 iterations in 1438 ms. Result :sat
[2021-05-09 07:32:19] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-09 07:32:19] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 26 ms returned sat
[2021-05-09 07:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:19] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:32:19] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:32:19] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:32:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:32:19] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:32:19] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 903 ms
[2021-05-09 07:32:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:32:20] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2021-05-09 07:32:20] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 07:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:32:20] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:32:20] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 13 ms to minimize.
[2021-05-09 07:32:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 883 ms
[2021-05-09 07:32:21] [INFO ] Computed and/alt/rep : 400/844/400 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-09 07:32:22] [INFO ] Added : 251 causal constraints over 51 iterations in 1027 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1) U (G((p0 U p1))||((p0 U p1)&&X((!p1 U (p2||G(!p1)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 457 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 457 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 456 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 456 transition count 398
Applied a total of 16 rules in 50 ms. Remains 456 /464 variables (removed 8) and now considering 398/406 (removed 8) transitions.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:22] [INFO ] Computed 95 place invariants in 14 ms
[2021-05-09 07:32:22] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:22] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:32:23] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:23] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-09 07:32:23] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/464 places, 398/406 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p1), true, (NOT p1), false, (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s377 1), p0:(AND (EQ s176 1) (EQ s337 1) (EQ s405 1)), p2:(AND (NEQ s346 1) (NEQ s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-00 finished in 1379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U G((F(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 457 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 457 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 456 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 456 transition count 398
Applied a total of 16 rules in 39 ms. Remains 456 /464 variables (removed 8) and now considering 398/406 (removed 8) transitions.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:24] [INFO ] Computed 95 place invariants in 9 ms
[2021-05-09 07:32:24] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:24] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:32:24] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:24] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:32:25] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/464 places, 398/406 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(NEQ s268 1), p2:(EQ s340 0), p1:(AND (EQ s172 0) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1571 reset in 448 ms.
Product exploration explored 100000 steps with 1634 reset in 361 ms.
Graph (complete) has 1036 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1630 reset in 270 ms.
Product exploration explored 100000 steps with 1577 reset in 373 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 456 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 456/456 places, 398/398 transitions.
Graph (trivial) has 203 edges and 456 vertex of which 6 / 456 are part of one of the 1 SCC in 13 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 451 transition count 392
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 46 place count 451 transition count 591
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 139 place count 451 transition count 591
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 154 place count 436 transition count 536
Deduced a syphon composed of 123 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 169 place count 436 transition count 536
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 246 places in 1 ms
Iterating global reduction 1 with 123 rules applied. Total rules applied 292 place count 436 transition count 536
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 323 place count 405 transition count 505
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 354 place count 405 transition count 505
Deduced a syphon composed of 215 places in 1 ms
Applied a total of 354 rules in 141 ms. Remains 405 /456 variables (removed 51) and now considering 505/398 (removed -107) transitions.
[2021-05-09 07:32:28] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 505 rows 405 cols
[2021-05-09 07:32:28] [INFO ] Computed 95 place invariants in 9 ms
[2021-05-09 07:32:28] [INFO ] Dead Transitions using invariants and state equation in 239 ms returned []
Finished structural reductions, in 1 iterations. Remains : 405/456 places, 505/398 transitions.
Product exploration explored 100000 steps with 16904 reset in 996 ms.
Product exploration explored 100000 steps with 16890 reset in 668 ms.
[2021-05-09 07:32:30] [INFO ] Flatten gal took : 37 ms
[2021-05-09 07:32:30] [INFO ] Flatten gal took : 30 ms
[2021-05-09 07:32:30] [INFO ] Time to serialize gal into /tmp/LTL8713811938371962282.gal : 12 ms
[2021-05-09 07:32:30] [INFO ] Time to serialize properties into /tmp/LTL6117505503455661027.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/LTL8713811938371962282.gal, -t, CGAL, -LTL, /tmp/LTL6117505503455661027.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/LTL8713811938371962282.gal -t CGAL -LTL /tmp/LTL6117505503455661027.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p302!=1)"))U(G((F("((p193==0)&&(p222==1))"))U("(p391==0)"))))))
Formula 0 simplified : !X(G"(p302!=1)" U G(F"((p193==0)&&(p222==1))" U "(p391==0)"))
Detected timeout of ITS tools.
[2021-05-09 07:32:45] [INFO ] Flatten gal took : 44 ms
[2021-05-09 07:32:45] [INFO ] Applying decomposition
[2021-05-09 07:32:45] [INFO ] Flatten gal took : 32 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/graph9468175032187237869.txt, -o, /tmp/graph9468175032187237869.bin, -w, /tmp/graph9468175032187237869.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/graph9468175032187237869.bin, -l, -1, -v, -w, /tmp/graph9468175032187237869.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:32:45] [INFO ] Decomposing Gal with order
[2021-05-09 07:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:32:45] [INFO ] Removed a total of 252 redundant transitions.
[2021-05-09 07:32:45] [INFO ] Flatten gal took : 82 ms
[2021-05-09 07:32:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2021-05-09 07:32:45] [INFO ] Time to serialize gal into /tmp/LTL16539882549217132562.gal : 12 ms
[2021-05-09 07:32:45] [INFO ] Time to serialize properties into /tmp/LTL16908936883459188382.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/LTL16539882549217132562.gal, -t, CGAL, -LTL, /tmp/LTL16908936883459188382.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/LTL16539882549217132562.gal -t CGAL -LTL /tmp/LTL16908936883459188382.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("(i17.i1.u101.p302!=1)"))U(G((F("((i9.i0.u65.p193==0)&&(i0.i0.u74.p222==1))"))U("(i11.u119.p391==0)"))))))
Formula 0 simplified : !X(G"(i17.i1.u101.p302!=1)" U G(F"((i9.i0.u65.p193==0)&&(i0.i0.u74.p222==1))" U "(i11.u119.p391==0)"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t164, t173, t177, t263, t271, t394, t396, t398, t399, i0.t168, i0.i0.u74.t170, i0.i0.u74.t171, i0.i0.u74.t172, i0.i1.u70.t180, i0.i2.u121.t75, i0.i2.u122.t72, i1.t185, i1.i0.u54.t208, i1.i0.u68.t184, i1.i1.u66.t188, i2.u43.t228, i2.u52.t212, i3.u20.t258, i4.i0.u11.t277, i4.i0.u12.t276, i4.i1.u117.t89, i4.i1.u118.t85, i5.i0.t270, i5.i1.t10, i5.i1.u124.t65, i6.u13.t274, i6.u18.t262, i7.i0.u47.t220, i8.i0.u58.t200, i9.i0.u64.t192, i9.i1.u115.t95, i9.i1.u116.t92, i10.i0.u76.t167, i10.i0.u80.t159, i10.i1.u78.t162, i10.i2.u123.t69, i11.u72.t176, i11.u119.t82, i11.u120.t78, i12.u111.t107, i12.u112.t104, i12.u113.t101, i12.u114.t98, i13.u45.t224, i13.u107.t119, i13.u108.t116, i14.i0.u39.t236, i14.i0.u41.t232, i14.i1.u104.t128, i14.i1.u105.t125, i14.i1.u106.t122, i14.i2.u103.t131, i15.i0.u99.t141, i15.i1.u97.t148, i15.i1.u98.t145, i15.i2.u94.t156, i16.i0.u56.t204, i16.i1.u109.t113, i16.i1.u110.t110, i17.t1, i17.t0, i17.i0.t2, i17.i0.t3, i17.i0.t239, i17.i0.u22.t254, i17.i0.u102.t134, i17.i1.t138, i17.i1.u101.t139, i17.i2.u95.t154, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/282/78/396
Computing Next relation with stutter on 1232 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1331 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,13.3661,263072,1,0,479974,945,7185,1.07353e+06,326,3021,815270
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-12-01 finished in 36734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 455 transition count 397
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 454 transition count 396
Applied a total of 20 rules in 41 ms. Remains 454 /464 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:00] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 07:33:00] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:00] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:33:01] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:01] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:01] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/464 places, 396/406 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s431 1), p0:(EQ s33 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-12-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-03 finished in 1252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 455 transition count 397
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 454 transition count 396
Applied a total of 20 rules in 42 ms. Remains 454 /464 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:02] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:33:02] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:02] [INFO ] Computed 95 place invariants in 10 ms
[2021-05-09 07:33:02] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:02] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-09 07:33:03] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/464 places, 396/406 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-04 finished in 1192 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Graph (trivial) has 212 edges and 464 vertex of which 6 / 464 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 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 458 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 407 transition count 348
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 103 place count 407 transition count 253
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 310 place count 295 transition count 253
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 317 place count 288 transition count 246
Iterating global reduction 2 with 7 rules applied. Total rules applied 324 place count 288 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 324 place count 288 transition count 245
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 326 place count 287 transition count 245
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 564 place count 166 transition count 128
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 566 place count 165 transition count 132
Applied a total of 566 rules in 85 ms. Remains 165 /464 variables (removed 299) and now considering 132/406 (removed 274) transitions.
// Phase 1: matrix 132 rows 165 cols
[2021-05-09 07:33:03] [INFO ] Computed 74 place invariants in 2 ms
[2021-05-09 07:33:03] [INFO ] Implicit Places using invariants in 182 ms returned [1, 2, 5, 6, 29, 30, 31, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 55, 126]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 183 ms to find 20 implicit places.
[2021-05-09 07:33:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 132 rows 145 cols
[2021-05-09 07:33:03] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 07:33:03] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Starting structural reductions, iteration 1 : 145/464 places, 132/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2021-05-09 07:33:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 132 rows 145 cols
[2021-05-09 07:33:03] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 07:33:03] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/464 places, 132/406 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s126 0) (EQ s129 0)), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21546 reset in 249 ms.
Product exploration explored 100000 steps with 21662 reset in 237 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21671 reset in 258 ms.
Product exploration explored 100000 steps with 21641 reset in 258 ms.
[2021-05-09 07:33:04] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:33:04] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:33:04] [INFO ] Time to serialize gal into /tmp/LTL12263873423982294129.gal : 2 ms
[2021-05-09 07:33:04] [INFO ] Time to serialize properties into /tmp/LTL14702241180349452966.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/LTL12263873423982294129.gal, -t, CGAL, -LTL, /tmp/LTL14702241180349452966.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/LTL12263873423982294129.gal -t CGAL -LTL /tmp/LTL14702241180349452966.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p135==1)")U("((p559==0)||(p562==0))")))))
Formula 0 simplified : !FG("(p135==1)" U "((p559==0)||(p562==0))")
Reverse transition relation is NOT exact ! Due to transitions t7, t250.t252.t253.t0.t254, t247.t248.t1.t254, t244.t245.t2.t254, t241.t242.t3.t254, t196.t198.t199.t5.t200, t45.t47.t48.t6.t49, t38.t39.t8.t40, t35.t36.t9, t22.t24.t25.t10, t54.t151.t152.t272.t288.t398.t273.t274.t65, t155.t349.t239.t254.t65, t135.t339.t239.t254.t65, t137.t138.t344.t239.t254.t65, t402.t161.t295.t162.t65, t67.t158.t160.t163.t164.t168.t173.t177.t181.t185.t189.t193.t201.t205.t209.t213.t221.t225.t229.t233.t237.t255.t259.t263.t271.t264.t270.t214.t216.t68.t71.t74.t77.t81.t84.t88.t91.t94.t97.t100.t103.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t140.t144.t147.t150.t153.t156.t154.t148.t145.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t104.t101.t98.t95.t92.t89.t82.t75.t72.t69.t266.t267.t265, t67.t158.t160.t163.t164.t168.t173.t177.t181.t185.t189.t193.t201.t205.t209.t213.t221.t225.t229.t233.t237.t255.t259.t263.t271.t264.t270.t214.t216.t68.t71.t74.t77.t81.t84.t88.t91.t94.t97.t100.t103.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t140.t144.t147.t150.t153.t156.t154.t148.t145.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t104.t101.t98.t95.t92.t89.t82.t75.t72.t69.t266.t267.t268.t269, t394.t65.t266.t267.t265, t394.t65.t266.t267.t268.t269, t395.t65.t266.t267.t265, t395.t65.t266.t267.t268.t269, t396.t65.t266.t267.t265, t396.t65.t266.t267.t268.t269, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/73/23/132
Computing Next relation with stutter on 1232 deadlock states
6 unique states visited
0 strongly connected components in search stack
9 transitions explored
4 items max in DFS search stack
129 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,1.33827,63928,1,0,317,179313,262,276,5874,201203,610
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-12-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-12-05 finished in 3367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||(F((X(p2)||p1)) U p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 457 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 457 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 456 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 456 transition count 398
Applied a total of 16 rules in 52 ms. Remains 456 /464 variables (removed 8) and now considering 398/406 (removed 8) transitions.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:33:06] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:06] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:33:06] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:33:07] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:33:07] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:07] [INFO ] Dead Transitions using invariants and state equation in 283 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/464 places, 398/406 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-07 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s379 1), p0:(EQ s363 1), p1:(OR (EQ s123 1) (EQ s398 0)), p2:(EQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-07 finished in 1065 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 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 455 transition count 397
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 454 transition count 396
Applied a total of 20 rules in 33 ms. Remains 454 /464 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:07] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 07:33:07] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:07] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 07:33:08] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:08] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 07:33:08] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/464 places, 396/406 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-08 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:(NEQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 728 reset in 201 ms.
Product exploration explored 100000 steps with 728 reset in 219 ms.
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 722 reset in 206 ms.
Product exploration explored 100000 steps with 733 reset in 211 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 454 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 454/454 places, 396/396 transitions.
Graph (trivial) has 204 edges and 454 vertex of which 6 / 454 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 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 449 transition count 390
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 94 Pre rules applied. Total rules applied 46 place count 449 transition count 609
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 140 place count 449 transition count 609
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 156 place count 433 transition count 550
Deduced a syphon composed of 123 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 172 place count 433 transition count 550
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 247 places in 0 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 296 place count 433 transition count 550
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 326 place count 403 transition count 520
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 356 place count 403 transition count 520
Deduced a syphon composed of 217 places in 0 ms
Applied a total of 356 rules in 82 ms. Remains 403 /454 variables (removed 51) and now considering 520/396 (removed -124) transitions.
[2021-05-09 07:33:09] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 520 rows 403 cols
[2021-05-09 07:33:09] [INFO ] Computed 95 place invariants in 10 ms
[2021-05-09 07:33:10] [INFO ] Dead Transitions using invariants and state equation in 310 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/454 places, 520/396 transitions.
Product exploration explored 100000 steps with 14385 reset in 642 ms.
Product exploration explored 100000 steps with 14390 reset in 548 ms.
[2021-05-09 07:33:11] [INFO ] Flatten gal took : 35 ms
[2021-05-09 07:33:11] [INFO ] Flatten gal took : 28 ms
[2021-05-09 07:33:11] [INFO ] Time to serialize gal into /tmp/LTL12657546178234160239.gal : 4 ms
[2021-05-09 07:33:11] [INFO ] Time to serialize properties into /tmp/LTL6123737605181829281.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/LTL12657546178234160239.gal, -t, CGAL, -LTL, /tmp/LTL6123737605181829281.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/LTL12657546178234160239.gal -t CGAL -LTL /tmp/LTL6123737605181829281.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p110!=1)")))))
Formula 0 simplified : !XXG"(p110!=1)"
Detected timeout of ITS tools.
[2021-05-09 07:33:26] [INFO ] Flatten gal took : 17 ms
[2021-05-09 07:33:26] [INFO ] Applying decomposition
[2021-05-09 07:33:26] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13487188390259397600.txt, -o, /tmp/graph13487188390259397600.bin, -w, /tmp/graph13487188390259397600.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/graph13487188390259397600.bin, -l, -1, -v, -w, /tmp/graph13487188390259397600.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:33:26] [INFO ] Decomposing Gal with order
[2021-05-09 07:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:33:26] [INFO ] Removed a total of 252 redundant transitions.
[2021-05-09 07:33:26] [INFO ] Flatten gal took : 62 ms
[2021-05-09 07:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-09 07:33:26] [INFO ] Time to serialize gal into /tmp/LTL2560588650074316360.gal : 5 ms
[2021-05-09 07:33:26] [INFO ] Time to serialize properties into /tmp/LTL8516728448435696740.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/LTL2560588650074316360.gal, -t, CGAL, -LTL, /tmp/LTL8516728448435696740.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/LTL2560588650074316360.gal -t CGAL -LTL /tmp/LTL8516728448435696740.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i9.i2.u35.p110!=1)")))))
Formula 0 simplified : !XXG"(i9.i2.u35.p110!=1)"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t168, t173, t263, t271, t395, t396, t398, t399, i0.i0.t270, i0.i1.t10, i0.i1.u123.t65, i1.i0.u121.t69, i1.i1.u80.t159, i1.i2.t164, i1.i2.u72.t176, i1.i2.u76.t167, i1.i3.u78.t162, i2.t177, i2.u68.t184, i2.u70.t180, i3.i0.u56.t204, i3.i0.u58.t200, i3.i2.u111.t101, i3.i2.u112.t98, i4.u52.t212, i4.u54.t208, i5.i0.u43.t228, i5.i0.u45.t224, i5.i1.u103.t122, i5.i1.u104.t119, i5.i1.u105.t116, i6.u21.t258, i7.u14.t274, i7.u19.t262, i8.i0.u12.t277, i8.i0.u13.t276, i8.i1.u115.t89, i8.i1.u116.t85, i8.i1.u117.t82, i8.i1.u118.t78, i9.t2, i9.t0, i9.i0.u93.t154, i9.i1.t1, i9.i1.t3, i9.i1.u23.t239, i9.i1.u23.t254, i9.i1.u98.t137, i9.i2.u99.t134, i10.i0.u47.t220, i11.t185, i11.u66.t188, i12.i0.u74.t172, i12.i1.u119.t75, i12.i1.u120.t72, i13.u64.t192, i13.u113.t95, i13.u114.t92, i14.i0.u39.t236, i14.i0.u41.t232, i14.i1.u100.t131, i14.i1.u101.t128, i14.i1.u102.t125, i15.u92.t156, i15.u95.t148, i15.u96.t145, i15.u97.t141, i16.u106.t113, i16.u107.t110, i16.u108.t107, i16.u110.t104, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/284/75/395
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
486 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.92983,159756,1,0,263236,1811,7271,725807,314,5215,561580
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-12-08 finished in 24994 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 456 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 455 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 455 transition count 397
Applied a total of 18 rules in 50 ms. Remains 455 /464 variables (removed 9) and now considering 397/406 (removed 9) transitions.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:32] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:32] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:32] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:33] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:33] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:33] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/464 places, 397/406 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s199 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-09 finished in 958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 456 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 455 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 455 transition count 397
Applied a total of 18 rules in 22 ms. Remains 455 /464 variables (removed 9) and now considering 397/406 (removed 9) transitions.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:33] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:33] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:33] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:34] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:34] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 07:33:34] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/464 places, 397/406 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s230 1) (EQ s335 0)), p1:(AND (EQ s40 1) (EQ s257 1) (EQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-10 finished in 1062 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 456 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 455 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 455 transition count 397
Applied a total of 18 rules in 32 ms. Remains 455 /464 variables (removed 9) and now considering 397/406 (removed 9) transitions.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:34] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:34] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:34] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 07:33:35] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:33:35] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 07:33:35] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/464 places, 397/406 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s335 1) (EQ s180 1)), p1:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-11 finished in 971 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 455 transition count 397
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 454 transition count 396
Applied a total of 20 rules in 33 ms. Remains 454 /464 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:35] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:33:35] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:35] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:33:36] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:36] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:33:36] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/464 places, 396/406 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-12 finished in 1185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||G(((p2||X(p0))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 455 transition count 397
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 454 transition count 396
Applied a total of 20 rules in 20 ms. Remains 454 /464 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:36] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:33:36] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:36] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:33:37] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:33:37] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:33:37] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/464 places, 396/406 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), true, (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-12-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s104 1) (EQ s288 1) (EQ s415 1)), p2:(EQ s12 1), p0:(EQ s399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-13 finished in 1186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 464/464 places, 406/406 transitions.
Graph (trivial) has 214 edges and 464 vertex of which 6 / 464 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 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 458 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 407 transition count 348
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 103 place count 407 transition count 250
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 317 place count 291 transition count 250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 324 place count 284 transition count 243
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 284 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 331 place count 284 transition count 242
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 333 place count 283 transition count 242
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 568 place count 164 transition count 126
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 570 place count 163 transition count 130
Applied a total of 570 rules in 34 ms. Remains 163 /464 variables (removed 301) and now considering 130/406 (removed 276) transitions.
// Phase 1: matrix 130 rows 163 cols
[2021-05-09 07:33:37] [INFO ] Computed 74 place invariants in 3 ms
[2021-05-09 07:33:38] [INFO ] Implicit Places using invariants in 114 ms returned [1, 4, 7, 8, 31, 32, 33, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 55, 117]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 115 ms to find 20 implicit places.
[2021-05-09 07:33:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 130 rows 143 cols
[2021-05-09 07:33:38] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 07:33:38] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 143/464 places, 130/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2021-05-09 07:33:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 143 cols
[2021-05-09 07:33:38] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 07:33:38] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/464 places, 130/406 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-15 finished in 354 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620545618818

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

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