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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 148K 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-13-00
FORMULA_NAME BusinessProcesses-PT-13-01
FORMULA_NAME BusinessProcesses-PT-13-02
FORMULA_NAME BusinessProcesses-PT-13-03
FORMULA_NAME BusinessProcesses-PT-13-04
FORMULA_NAME BusinessProcesses-PT-13-05
FORMULA_NAME BusinessProcesses-PT-13-06
FORMULA_NAME BusinessProcesses-PT-13-07
FORMULA_NAME BusinessProcesses-PT-13-08
FORMULA_NAME BusinessProcesses-PT-13-09
FORMULA_NAME BusinessProcesses-PT-13-10
FORMULA_NAME BusinessProcesses-PT-13-11
FORMULA_NAME BusinessProcesses-PT-13-12
FORMULA_NAME BusinessProcesses-PT-13-13
FORMULA_NAME BusinessProcesses-PT-13-14
FORMULA_NAME BusinessProcesses-PT-13-15

=== Now, execution of the tool begins

BK_START 1620545710072

Running Version 0
[2021-05-09 07:35:11] [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:35:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:35:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-09 07:35:11] [INFO ] Transformed 593 places.
[2021-05-09 07:35:11] [INFO ] Transformed 536 transitions.
[2021-05-09 07:35:11] [INFO ] Found NUPN structural information;
[2021-05-09 07:35:11] [INFO ] Parsed PT model containing 593 places and 536 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:35:11] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 84 place count 501 transition count 449
Iterating global reduction 1 with 79 rules applied. Total rules applied 163 place count 501 transition count 449
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 203 place count 461 transition count 409
Iterating global reduction 1 with 40 rules applied. Total rules applied 243 place count 461 transition count 409
Applied a total of 243 rules in 97 ms. Remains 461 /585 variables (removed 124) and now considering 409/528 (removed 119) transitions.
// Phase 1: matrix 409 rows 461 cols
[2021-05-09 07:35:12] [INFO ] Computed 90 place invariants in 28 ms
[2021-05-09 07:35:12] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 409 rows 461 cols
[2021-05-09 07:35:12] [INFO ] Computed 90 place invariants in 10 ms
[2021-05-09 07:35:12] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
// Phase 1: matrix 409 rows 461 cols
[2021-05-09 07:35:12] [INFO ] Computed 90 place invariants in 5 ms
[2021-05-09 07:35:13] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 1 iterations. Remains : 461/585 places, 409/528 transitions.
[2021-05-09 07:35:13] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 07:35:13] [INFO ] Flatten gal took : 60 ms
FORMULA BusinessProcesses-PT-13-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:35:13] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:35:13] [INFO ] Input system was already deterministic with 409 transitions.
Incomplete random walk after 100000 steps, including 714 resets, run finished after 249 ms. (steps per millisecond=401 ) properties (out of 23) seen :10
Running SMT prover for 13 properties.
// Phase 1: matrix 409 rows 461 cols
[2021-05-09 07:35:13] [INFO ] Computed 90 place invariants in 15 ms
[2021-05-09 07:35:13] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-09 07:35:13] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:13] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:14] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2021-05-09 07:35:14] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:14] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 30 places in 18 ms of which 0 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Deduced a trap composed of 21 places in 16 ms of which 0 ms to minimize.
[2021-05-09 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 501 ms
[2021-05-09 07:35:14] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 21 ms.
[2021-05-09 07:35:16] [INFO ] Added : 269 causal constraints over 54 iterations in 1353 ms. Result :sat
[2021-05-09 07:35:16] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2021-05-09 07:35:16] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:16] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-09 07:35:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:16] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2021-05-09 07:35:16] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 6 ms returned sat
[2021-05-09 07:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:16] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 07:35:16] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:35:16] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:35:16] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:35:17] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:35:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1922 ms
[2021-05-09 07:35:18] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 24 ms.
[2021-05-09 07:35:20] [INFO ] Added : 310 causal constraints over 62 iterations in 2024 ms. Result :sat
[2021-05-09 07:35:20] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:35:20] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 07:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:20] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:35:20] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:35:20] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:35:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 905 ms
[2021-05-09 07:35:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:21] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:35:21] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:21] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-09 07:35:21] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2021-05-09 07:35:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 610 ms
[2021-05-09 07:35:22] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 23 ms.
[2021-05-09 07:35:23] [INFO ] Added : 271 causal constraints over 55 iterations in 1193 ms. Result :sat
[2021-05-09 07:35:23] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-09 07:35:23] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:23] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:35:24] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:35:25] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:35:26] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:35:27] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:35:28] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:35:29] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 5785 ms
[2021-05-09 07:35:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:29] [INFO ] [Nat]Absence check using 52 positive place invariants in 25 ms returned sat
[2021-05-09 07:35:29] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:29] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:35:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 728 ms
[2021-05-09 07:35:30] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 39 ms.
[2021-05-09 07:35:32] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:35:32] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:35:32] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:35:33] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:35:33] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:35:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 863 ms
[2021-05-09 07:35:33] [INFO ] Added : 290 causal constraints over 59 iterations in 2738 ms. Result :sat
[2021-05-09 07:35:33] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:35:33] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:33] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:35:33] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:35:33] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:35:34] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:35:35] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:35:36] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:35:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2370 ms
[2021-05-09 07:35:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2021-05-09 07:35:36] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 07:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:36] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:35:36] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:35:36] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:35:36] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:35:36] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:35:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1615 ms
[2021-05-09 07:35:37] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 18 ms.
[2021-05-09 07:35:39] [INFO ] Added : 271 causal constraints over 55 iterations in 1408 ms. Result :sat
[2021-05-09 07:35:39] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2021-05-09 07:35:39] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 07:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:39] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-09 07:35:39] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:35:39] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:35:39] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:35:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:35:39] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:35:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 329 ms
[2021-05-09 07:35:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:39] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2021-05-09 07:35:39] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 07:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:40] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-09 07:35:40] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:35:40] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:35:40] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:35:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:35:40] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:35:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 400 ms
[2021-05-09 07:35:40] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 27 ms.
[2021-05-09 07:35:41] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 448 ms
[2021-05-09 07:35:42] [INFO ] Added : 299 causal constraints over 61 iterations in 1845 ms. Result :sat
[2021-05-09 07:35:42] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2021-05-09 07:35:42] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:42] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:35:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 34 places in 20 ms of which 1 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 967 ms
[2021-05-09 07:35:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:43] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2021-05-09 07:35:43] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:43] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:35:43] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 18 places in 13 ms of which 0 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Deduced a trap composed of 34 places in 12 ms of which 1 ms to minimize.
[2021-05-09 07:35:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 935 ms
[2021-05-09 07:35:44] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 17 ms.
[2021-05-09 07:35:46] [INFO ] Added : 299 causal constraints over 60 iterations in 1324 ms. Result :sat
[2021-05-09 07:35:46] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2021-05-09 07:35:46] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 07:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:46] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Deduced a trap composed of 18 places in 15 ms of which 0 ms to minimize.
[2021-05-09 07:35:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 594 ms
[2021-05-09 07:35:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2021-05-09 07:35:46] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:47] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2021-05-09 07:35:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 615 ms
[2021-05-09 07:35:47] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 16 ms.
[2021-05-09 07:35:49] [INFO ] Added : 291 causal constraints over 59 iterations in 1553 ms. Result :sat
[2021-05-09 07:35:49] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:35:49] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:49] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:35:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 500 ms
[2021-05-09 07:35:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:50] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:35:50] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:50] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2021-05-09 07:35:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 509 ms
[2021-05-09 07:35:50] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 25 ms.
[2021-05-09 07:35:52] [INFO ] Added : 303 causal constraints over 61 iterations in 1539 ms. Result :sat
[2021-05-09 07:35:52] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-09 07:35:52] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:52] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-09 07:35:52] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:35:52] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:35:52] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:35:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 34 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:35:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1003 ms
[2021-05-09 07:35:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2021-05-09 07:35:53] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:35:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:53] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-09 07:35:53] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:35:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1077 ms
[2021-05-09 07:35:54] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 22 ms.
[2021-05-09 07:35:56] [INFO ] Added : 272 causal constraints over 55 iterations in 1330 ms. Result :sat
[2021-05-09 07:35:56] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-09 07:35:56] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:56] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:35:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 523 ms
[2021-05-09 07:35:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:57] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2021-05-09 07:35:57] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:57] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2021-05-09 07:35:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 449 ms
[2021-05-09 07:35:57] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 18 ms.
[2021-05-09 07:35:59] [INFO ] Added : 293 causal constraints over 59 iterations in 1531 ms. Result :sat
[2021-05-09 07:35:59] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-09 07:35:59] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:59] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 338 ms
[2021-05-09 07:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:59] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-09 07:35:59] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:00] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2021-05-09 07:36:00] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 24 ms.
[2021-05-09 07:36:01] [INFO ] Added : 203 causal constraints over 42 iterations in 1042 ms. Result :sat
[2021-05-09 07:36:01] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:36:01] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:01] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 2 ms to minimize.
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 5 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 945 ms
[2021-05-09 07:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:02] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:36:02] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:02] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 690 ms
[2021-05-09 07:36:03] [INFO ] Computed and/alt/rep : 402/827/402 causal constraints (skipped 6 transitions) in 23 ms.
[2021-05-09 07:36:04] [INFO ] Added : 215 causal constraints over 44 iterations in 931 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((p1||X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 450 transition count 398
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 450 transition count 398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 446 transition count 394
Applied a total of 30 rules in 49 ms. Remains 446 /461 variables (removed 15) and now considering 394/409 (removed 15) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:04] [INFO ] Computed 90 place invariants in 5 ms
[2021-05-09 07:36:04] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:04] [INFO ] Computed 90 place invariants in 4 ms
[2021-05-09 07:36:05] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:05] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:05] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/461 places, 394/409 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-13-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p0:(OR (EQ s83 0) (EQ s311 0) (EQ s411 0) (EQ s119 1)), p2:(EQ s116 1), p1:(EQ s116 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 713 reset in 396 ms.
Product exploration explored 100000 steps with 721 reset in 331 ms.
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 708 reset in 242 ms.
Product exploration explored 100000 steps with 710 reset in 280 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 446/446 places, 394/394 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 446 transition count 394
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 45 place count 446 transition count 594
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 137 place count 446 transition count 594
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 150 place count 433 transition count 548
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 163 place count 433 transition count 548
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 1 with 122 rules applied. Total rules applied 285 place count 433 transition count 548
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 315 place count 403 transition count 518
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 345 place count 403 transition count 518
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 348 place count 403 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 349 place count 403 transition count 531
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 352 place count 400 transition count 525
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 355 place count 400 transition count 525
Deduced a syphon composed of 216 places in 1 ms
Applied a total of 355 rules in 116 ms. Remains 400 /446 variables (removed 46) and now considering 525/394 (removed -131) transitions.
[2021-05-09 07:36:08] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 525 rows 400 cols
[2021-05-09 07:36:08] [INFO ] Computed 90 place invariants in 7 ms
[2021-05-09 07:36:08] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/446 places, 525/394 transitions.
Product exploration explored 100000 steps with 707 reset in 247 ms.
Product exploration explored 100000 steps with 714 reset in 264 ms.
[2021-05-09 07:36:09] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:36:09] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:36:09] [INFO ] Time to serialize gal into /tmp/LTL16896364141562587501.gal : 9 ms
[2021-05-09 07:36:09] [INFO ] Time to serialize properties into /tmp/LTL3741166222507335209.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/LTL16896364141562587501.gal, -t, CGAL, -LTL, /tmp/LTL3741166222507335209.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/LTL16896364141562587501.gal -t CGAL -LTL /tmp/LTL3741166222507335209.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((p103==0)||(p369==0))||(p558==0))||(p139==1))"))&&(G(("(p136==0)")||(X(G("(p136==1)")))))))
Formula 0 simplified : !(F"((((p103==0)||(p369==0))||(p558==0))||(p139==1))" & G("(p136==0)" | XG"(p136==1)"))
Detected timeout of ITS tools.
[2021-05-09 07:36:24] [INFO ] Flatten gal took : 46 ms
[2021-05-09 07:36:24] [INFO ] Applying decomposition
[2021-05-09 07:36:24] [INFO ] Flatten gal took : 38 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/graph8739259051180128293.txt, -o, /tmp/graph8739259051180128293.bin, -w, /tmp/graph8739259051180128293.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/graph8739259051180128293.bin, -l, -1, -v, -w, /tmp/graph8739259051180128293.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:36:24] [INFO ] Decomposing Gal with order
[2021-05-09 07:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:36:24] [INFO ] Removed a total of 267 redundant transitions.
[2021-05-09 07:36:24] [INFO ] Flatten gal took : 86 ms
[2021-05-09 07:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 21 ms.
[2021-05-09 07:36:24] [INFO ] Time to serialize gal into /tmp/LTL1154232755732170728.gal : 11 ms
[2021-05-09 07:36:24] [INFO ] Time to serialize properties into /tmp/LTL12040810772526178638.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/LTL1154232755732170728.gal, -t, CGAL, -LTL, /tmp/LTL12040810772526178638.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/LTL1154232755732170728.gal -t CGAL -LTL /tmp/LTL12040810772526178638.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((((i12.u33.p103==0)||(i12.u110.p369==0))||(i7.u122.p558==0))||(i11.u45.p139==1))"))&&(G(("(i1.u44.p136==0)")||(X(G("(i1.u44.p136==1)")))))))
Formula 0 simplified : !(F"((((i12.u33.p103==0)||(i12.u110.p369==0))||(i7.u122.p558==0))||(i11.u45.p139==1))" & G("(i1.u44.p136==0)" | XG"(i1.u44.p136==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5956054046500568995
[2021-05-09 07:36:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5956054046500568995
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5956054046500568995]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5956054046500568995] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5956054046500568995] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-13-00 finished in 36129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Graph (trivial) has 214 edges and 461 vertex of which 6 / 461 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 455 transition count 349
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 402 transition count 349
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 107 place count 402 transition count 257
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 308 place count 293 transition count 257
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 316 place count 285 transition count 249
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 285 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 564 place count 163 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 566 place count 162 transition count 135
Applied a total of 566 rules in 83 ms. Remains 162 /461 variables (removed 299) and now considering 135/409 (removed 274) transitions.
// Phase 1: matrix 135 rows 162 cols
[2021-05-09 07:36:40] [INFO ] Computed 69 place invariants in 2 ms
[2021-05-09 07:36:40] [INFO ] Implicit Places using invariants in 138 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 139 ms to find 19 implicit places.
[2021-05-09 07:36:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 135 rows 143 cols
[2021-05-09 07:36:40] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:36:41] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 143/461 places, 135/409 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-09 07:36:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 135 rows 143 cols
[2021-05-09 07:36:41] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:36:41] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/461 places, 135/409 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s103 1), p1:(AND (EQ s21 1) (EQ s24 1)), p2:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-01 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0) U (p1&&G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Graph (trivial) has 215 edges and 461 vertex of which 6 / 461 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 455 transition count 349
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 402 transition count 349
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 107 place count 402 transition count 255
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 312 place count 291 transition count 255
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 321 place count 282 transition count 246
Iterating global reduction 2 with 9 rules applied. Total rules applied 330 place count 282 transition count 246
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 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 566 place count 162 transition count 130
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 568 place count 161 transition count 134
Applied a total of 568 rules in 39 ms. Remains 161 /461 variables (removed 300) and now considering 134/409 (removed 275) transitions.
// Phase 1: matrix 134 rows 161 cols
[2021-05-09 07:36:41] [INFO ] Computed 69 place invariants in 2 ms
[2021-05-09 07:36:41] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 24, 25, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 133 ms to find 18 implicit places.
[2021-05-09 07:36:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 134 rows 143 cols
[2021-05-09 07:36:41] [INFO ] Computed 51 place invariants in 4 ms
[2021-05-09 07:36:41] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 143/461 places, 134/409 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2021-05-09 07:36:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 134 rows 143 cols
[2021-05-09 07:36:41] [INFO ] Computed 51 place invariants in 2 ms
[2021-05-09 07:36:41] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/461 places, 134/409 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s69 1), p2:(NEQ s11 1), p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-05 finished in 565 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 450 transition count 398
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 450 transition count 398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 446 transition count 394
Applied a total of 30 rules in 27 ms. Remains 446 /461 variables (removed 15) and now considering 394/409 (removed 15) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:41] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:42] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:42] [INFO ] Computed 90 place invariants in 7 ms
[2021-05-09 07:36:42] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:42] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:42] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/461 places, 394/409 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s305 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1805 reset in 260 ms.
Stack based approach found an accepted trace after 1424 steps with 25 reset with depth 5 and stack size 5 in 3 ms.
FORMULA BusinessProcesses-PT-13-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-09 finished in 1121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X((p0 U (p1||G(p0))))&&G(p2))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 450 transition count 398
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 450 transition count 398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 446 transition count 394
Applied a total of 30 rules in 21 ms. Remains 446 /461 variables (removed 15) and now considering 394/409 (removed 15) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:43] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:43] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:43] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-09 07:36:43] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:43] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-09 07:36:43] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/461 places, 394/409 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-13-10 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p3 p2), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p3 p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (NEQ s200 0) (AND (NEQ s410 0) (NEQ s200 0))), p2:(NEQ s200 1), p1:(AND (NEQ s410 0) (NEQ s200 0)), p0:(NEQ s200 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21912 steps with 155 reset in 92 ms.
FORMULA BusinessProcesses-PT-13-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-10 finished in 1023 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Graph (trivial) has 216 edges and 461 vertex of which 6 / 461 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 455 transition count 349
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 402 transition count 349
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 107 place count 402 transition count 253
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 316 place count 289 transition count 253
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 324 place count 281 transition count 245
Iterating global reduction 2 with 8 rules applied. Total rules applied 332 place count 281 transition count 245
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 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 568 place count 161 transition count 129
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 160 transition count 133
Applied a total of 570 rules in 57 ms. Remains 160 /461 variables (removed 301) and now considering 133/409 (removed 276) transitions.
// Phase 1: matrix 133 rows 160 cols
[2021-05-09 07:36:44] [INFO ] Computed 69 place invariants in 1 ms
[2021-05-09 07:36:44] [INFO ] Implicit Places using invariants in 122 ms returned [1, 2, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 123 ms to find 18 implicit places.
[2021-05-09 07:36:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 133 rows 142 cols
[2021-05-09 07:36:44] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:36:44] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 142/461 places, 133/409 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2021-05-09 07:36:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 133 rows 142 cols
[2021-05-09 07:36:44] [INFO ] Computed 51 place invariants in 0 ms
[2021-05-09 07:36:44] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 142/461 places, 133/409 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-11 finished in 366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 450 transition count 398
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 450 transition count 398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 446 transition count 394
Applied a total of 30 rules in 24 ms. Remains 446 /461 variables (removed 15) and now considering 394/409 (removed 15) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:44] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:44] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:44] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:44] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:36:44] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:45] [INFO ] Dead Transitions using invariants and state equation in 232 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/461 places, 394/409 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s383 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 132 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-12 finished in 842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0||G(p1)||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 451 transition count 399
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 451 transition count 399
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 448 transition count 396
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 448 transition count 396
Applied a total of 26 rules in 51 ms. Remains 448 /461 variables (removed 13) and now considering 396/409 (removed 13) transitions.
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:36:45] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:45] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:36:45] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-09 07:36:46] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:36:46] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:36:46] [INFO ] Dead Transitions using invariants and state equation in 242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/461 places, 396/409 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-13 automaton TGBA [mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=4, aps=[p1:(EQ s90 1), p2:(EQ s206 0), p0:(EQ s371 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 711 reset in 337 ms.
Product exploration explored 100000 steps with 712 reset in 324 ms.
Graph (complete) has 1023 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), p2, p0]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 711 reset in 234 ms.
Product exploration explored 100000 steps with 715 reset in 248 ms.
Applying partial POR strategy [true, true, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (NOT p1)]
Support contains 3 out of 448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 203 edges and 448 vertex of which 6 / 448 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.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 443 transition count 390
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 44 place count 443 transition count 596
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 136 place count 443 transition count 596
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 150 place count 429 transition count 546
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 164 place count 429 transition count 546
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 123 rules applied. Total rules applied 287 place count 429 transition count 546
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 319 place count 397 transition count 514
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 351 place count 397 transition count 514
Deduced a syphon composed of 212 places in 0 ms
Applied a total of 351 rules in 40 ms. Remains 397 /448 variables (removed 51) and now considering 514/396 (removed -118) transitions.
[2021-05-09 07:36:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 514 rows 397 cols
[2021-05-09 07:36:48] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-09 07:36:48] [INFO ] Dead Transitions using invariants and state equation in 227 ms returned []
Finished structural reductions, in 1 iterations. Remains : 397/448 places, 514/396 transitions.
Product exploration explored 100000 steps with 12344 reset in 693 ms.
Product exploration explored 100000 steps with 12347 reset in 743 ms.
[2021-05-09 07:36:50] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:36:50] [INFO ] Flatten gal took : 18 ms
[2021-05-09 07:36:50] [INFO ] Time to serialize gal into /tmp/LTL9103202740779127571.gal : 3 ms
[2021-05-09 07:36:50] [INFO ] Time to serialize properties into /tmp/LTL15295516535971537778.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/LTL9103202740779127571.gal, -t, CGAL, -LTL, /tmp/LTL15295516535971537778.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/LTL9103202740779127571.gal -t CGAL -LTL /tmp/LTL15295516535971537778.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((("(p459==0)")||(G("(p110==1)")))||(G("(p243==0)"))))))))
Formula 0 simplified : !XXXG("(p459==0)" | G"(p110==1)" | G"(p243==0)")
Detected timeout of ITS tools.
[2021-05-09 07:37:05] [INFO ] Flatten gal took : 23 ms
[2021-05-09 07:37:05] [INFO ] Applying decomposition
[2021-05-09 07:37:05] [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/graph11154896782010375829.txt, -o, /tmp/graph11154896782010375829.bin, -w, /tmp/graph11154896782010375829.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/graph11154896782010375829.bin, -l, -1, -v, -w, /tmp/graph11154896782010375829.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:37:05] [INFO ] Decomposing Gal with order
[2021-05-09 07:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:37:05] [INFO ] Removed a total of 262 redundant transitions.
[2021-05-09 07:37:05] [INFO ] Flatten gal took : 31 ms
[2021-05-09 07:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2021-05-09 07:37:05] [INFO ] Time to serialize gal into /tmp/LTL13143116208432294901.gal : 3 ms
[2021-05-09 07:37:05] [INFO ] Time to serialize properties into /tmp/LTL17622661166554631980.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/LTL13143116208432294901.gal, -t, CGAL, -LTL, /tmp/LTL17622661166554631980.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/LTL13143116208432294901.gal -t CGAL -LTL /tmp/LTL17622661166554631980.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((("(i17.u126.p459==0)")||(G("(i10.u35.p110==1)")))||(G("(i12.i0.u0.p243==0)"))))))))
Formula 0 simplified : !XXXG("(i17.u126.p459==0)" | G"(i10.u35.p110==1)" | G"(i12.i0.u0.p243==0)")
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t170, t243, t270, t276, t383, t384, t392, t393, t399, t404, i0.i0.t174, i0.i0.u66.t185, i0.i0.u70.t177, i0.i1.u117.t77, i0.i1.u118.t74, i1.u47.t212, i1.u49.t208, i2.u43.t220, i3.u33.t238, i3.u39.t228, i3.u41.t224, i4.t265, i4.u12.t283, i4.u18.t268, i4.u19.t267, i4.u20.t264, i4.u92.t156, i5.u14.t279, i5.u15.t278, i6.i0.u16.t275, i6.i0.u97.t141, i6.i1.u68.t181, i6.i1.u96.t144, i6.i1.u98.t138, i6.i1.u99.t134, i7.i1.u111.t96, i8.i0.u22.t260, i8.i1.t256, i8.i1.u31.t242, i9.i0.t250, i9.i1.u102.t125, i9.i1.u103.t122, i9.i1.u104.t119, i9.i1.u105.t116, i9.i1.u106.t113, i10.u35.t234, i11.t5, i11.t2, i11.i0.t3, i11.i0.t4, i11.i0.u51.t188, i11.i0.u51.t204, i11.i0.u112.t93, i11.i1.u113.t90, i11.i2.u114.t87, i12.i0.u119.t71, i12.i1.u74.t167, i12.i2.u72.t173, i12.i2.u76.t164, i13.u45.t216, i13.u115.t84, i13.u116.t81, i14.u100.t131, i14.u101.t128, i15.u93.t153, i15.u94.t150, i15.u95.t147, i16.i0.u107.t109, i16.i0.u108.t106, i16.i1.u109.t103, i16.i1.u110.t99, i17.t52, i17.t6, i17.u121.t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/280/78/394
Computing Next relation with stutter on 1188 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4038127221425185938
[2021-05-09 07:37:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4038127221425185938
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4038127221425185938]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4038127221425185938] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4038127221425185938] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-13-13 finished in 36276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 450 transition count 398
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 450 transition count 398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 446 transition count 394
Applied a total of 30 rules in 21 ms. Remains 446 /461 variables (removed 15) and now considering 394/409 (removed 15) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:37:21] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-09 07:37:21] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:37:21] [INFO ] Computed 90 place invariants in 9 ms
[2021-05-09 07:37:22] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:37:22] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:37:22] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/461 places, 394/409 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (NEQ s49 1) (NEQ s279 1) (NEQ s411 1)), p0:(OR (EQ s233 1) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 842 reset in 161 ms.
Product exploration explored 100000 steps with 840 reset in 188 ms.
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 841 reset in 163 ms.
Product exploration explored 100000 steps with 844 reset in 190 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 446/446 places, 394/394 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 446 transition count 394
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 45 place count 446 transition count 600
Deduced a syphon composed of 138 places in 2 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 138 place count 446 transition count 600
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 152 place count 432 transition count 550
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 166 place count 432 transition count 550
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 243 places in 0 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 285 place count 432 transition count 550
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 316 place count 401 transition count 519
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 347 place count 401 transition count 519
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 349 place count 401 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 350 place count 401 transition count 522
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 352 place count 399 transition count 518
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 399 transition count 518
Deduced a syphon composed of 212 places in 0 ms
Applied a total of 354 rules in 92 ms. Remains 399 /446 variables (removed 47) and now considering 518/394 (removed -124) transitions.
[2021-05-09 07:37:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 518 rows 399 cols
[2021-05-09 07:37:23] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-09 07:37:24] [INFO ] Dead Transitions using invariants and state equation in 458 ms returned []
Finished structural reductions, in 1 iterations. Remains : 399/446 places, 518/394 transitions.
Product exploration explored 100000 steps with 14096 reset in 656 ms.
Product exploration explored 100000 steps with 14070 reset in 556 ms.
[2021-05-09 07:37:25] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:37:25] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:37:25] [INFO ] Time to serialize gal into /tmp/LTL4942867622725328543.gal : 2 ms
[2021-05-09 07:37:25] [INFO ] Time to serialize properties into /tmp/LTL17190818240812531954.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/LTL4942867622725328543.gal, -t, CGAL, -LTL, /tmp/LTL17190818240812531954.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/LTL4942867622725328543.gal -t CGAL -LTL /tmp/LTL17190818240812531954.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p270==1)||(p175==1))")||(G("(((p55!=1)||(p329!=1))||(p558!=1))"))))))
Formula 0 simplified : !XF("((p270==1)||(p175==1))" | G"(((p55!=1)||(p329!=1))||(p558!=1))")
Detected timeout of ITS tools.
[2021-05-09 07:37:40] [INFO ] Flatten gal took : 16 ms
[2021-05-09 07:37:40] [INFO ] Applying decomposition
[2021-05-09 07:37:40] [INFO ] Flatten gal took : 40 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/graph7806445797457530808.txt, -o, /tmp/graph7806445797457530808.bin, -w, /tmp/graph7806445797457530808.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/graph7806445797457530808.bin, -l, -1, -v, -w, /tmp/graph7806445797457530808.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:37:40] [INFO ] Decomposing Gal with order
[2021-05-09 07:37:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:37:40] [INFO ] Removed a total of 266 redundant transitions.
[2021-05-09 07:37:40] [INFO ] Flatten gal took : 52 ms
[2021-05-09 07:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 21 ms.
[2021-05-09 07:37:40] [INFO ] Time to serialize gal into /tmp/LTL16356730750612089115.gal : 66 ms
[2021-05-09 07:37:40] [INFO ] Time to serialize properties into /tmp/LTL12131722968607477704.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/LTL16356730750612089115.gal, -t, CGAL, -LTL, /tmp/LTL12131722968607477704.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/LTL16356730750612089115.gal -t CGAL -LTL /tmp/LTL12131722968607477704.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i14.i1.u89.p270==1)||(i9.i0.u52.p175==1))")||(G("(((i14.i0.u20.p55!=1)||(i13.u101.p329!=1))||(i16.i1.u120.p558!=1))"))))))
Formula 0 simplified : !XF("((i14.i1.u89.p270==1)||(i9.i0.u52.p175==1))" | G"(((i14.i0.u20.p55!=1)||(i13.u101.p329!=1))||(i16.i1.u120.p558!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4058349562544339633
[2021-05-09 07:37:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4058349562544339633
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4058349562544339633]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4058349562544339633] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4058349562544339633] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-13-14 finished in 35278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&G((F(p1) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 409/409 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 451 transition count 399
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 451 transition count 399
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 447 transition count 395
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 447 transition count 395
Applied a total of 28 rules in 60 ms. Remains 447 /461 variables (removed 14) and now considering 395/409 (removed 14) transitions.
// Phase 1: matrix 395 rows 447 cols
[2021-05-09 07:37:56] [INFO ] Computed 90 place invariants in 4 ms
[2021-05-09 07:37:57] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 395 rows 447 cols
[2021-05-09 07:37:57] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:37:57] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 447 cols
[2021-05-09 07:37:57] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-09 07:37:57] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/461 places, 395/409 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), false, (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (NEQ s143 1) (NEQ s328 1) (NEQ s399 1)), p0:(EQ s411 0), p2:(EQ s411 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-15 finished in 1199 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4506244995941393798
[2021-05-09 07:37:57] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2021-05-09 07:37:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:37:57] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2021-05-09 07:37:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:37:57] [INFO ] Applying decomposition
[2021-05-09 07:37:57] [INFO ] Flatten gal took : 16 ms
[2021-05-09 07:37:58] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
[2021-05-09 07:37:58] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:37:58] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4506244995941393798
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4506244995941393798]
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/graph13100260440075691319.txt, -o, /tmp/graph13100260440075691319.bin, -w, /tmp/graph13100260440075691319.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/graph13100260440075691319.bin, -l, -1, -v, -w, /tmp/graph13100260440075691319.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:37:58] [INFO ] Decomposing Gal with order
[2021-05-09 07:37:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:37:58] [INFO ] Removed a total of 260 redundant transitions.
[2021-05-09 07:37:58] [INFO ] Flatten gal took : 33 ms
[2021-05-09 07:37:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2021-05-09 07:37:58] [INFO ] Time to serialize gal into /tmp/LTLFireability602684881002040660.gal : 5 ms
[2021-05-09 07:37:58] [INFO ] Time to serialize properties into /tmp/LTLFireability9623374786103783415.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/LTLFireability602684881002040660.gal, -t, CGAL, -LTL, /tmp/LTLFireability9623374786103783415.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/LTLFireability602684881002040660.gal -t CGAL -LTL /tmp/LTLFireability9623374786103783415.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !(((F("((((i7.i0.u32.p103==0)||(i7.i1.u110.p369==0))||(i17.u123.p558==0))||(i9.u44.p139==1))"))&&(G(("(i15.i0.u43.p136==0)")||(X(G("(i15.i0.u43.p136==1)")))))))
Formula 0 simplified : !(F"((((i7.i0.u32.p103==0)||(i7.i1.u110.p369==0))||(i17.u123.p558==0))||(i9.u44.p139==1))" & G("(i15.i0.u43.p136==0)" | XG"(i15.i0.u43.p136==1)"))
Compilation finished in 1950 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4506244995941393798]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))&&[](((LTLAPp1==true)||X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4506244995941393798]
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t270, t350, t392, t398, t510, t518, t520, t526, t530, i0.i0.u121.t145, i0.i0.u122.t141, i0.i1.u71.t273, i0.i1.u75.t260, i0.i2.u73.t263, i1.u48.t315, i1.u65.t285, i2.i0.u13.t402, i2.i0.u14.t401, i2.i1.u95.t233, i2.i1.u96.t229, i3.i0.t395, i3.i0.u15.t397, i3.i1.u93.t241, i3.i1.u94.t237, i4.u100.t217, i4.u101.t213, i4.u102.t209, i5.i0.u24.t373, i5.i0.u30.t349, i6.i0.t367, i6.i1.u103.t205, i6.i1.u104.t201, i6.i1.u105.t197, i6.i1.u106.t193, i7.i0.u32.t345, i7.i1.u109.t185, i7.i1.u110.t181, i7.i2.t190, i7.i2.u107.t191, i8.u34.t341, i9.u44.t323, i9.u46.t319, i10.t5, i10.t2, i10.i0.t3, i10.i0.u50.t292, i10.i0.u50.t301, i10.i0.u50.t311, i10.i0.u114.t169, i10.i1.u115.t165, i10.i2.u116.t161, i11.i0.u117.t157, i11.i1.u113.t173, i11.i2.t178, i11.i2.u111.t179, i12.i0.u20.t385, i12.i1.u91.t249, i12.i1.u92.t245, i13.t386, i13.u11.t408, i13.u18.t390, i13.u19.t389, i14.i0.t274, i14.i0.u67.t281, i14.i0.u69.t277, i14.i1.t222, i14.i1.u98.t223, i14.i2.u97.t225, i15.i0.u38.t335, i15.i0.u42.t327, i15.i1.u40.t331, i16.i0.u22.t379, i16.i1.t150, i16.i1.u119.t151, i16.i2.u118.t153, i17.t104, i17.t86, i17.t80, i17.t6, i17.u123.t13, i17.u123.t108, i17.u123.t135, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/284/86/406
Computing Next relation with stutter on 1188 deadlock states
99 unique states visited
99 strongly connected components in search stack
100 transitions explored
99 items max in DFS search stack
5487 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,54.9483,854124,1,0,1.30644e+06,923,7481,4.93962e+06,346,3489,1210219
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-13-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(G((("(i17.u130.p459==0)")||(G("(i8.u34.p110==1)")))||(G("(i0.i0.u76.p243==0)"))))))))
Formula 1 simplified : !XXXG("(i17.u130.p459==0)" | G"(i8.u34.p110==1)" | G"(i0.i0.u76.p243==0)")
Computing Next relation with stutter on 1188 deadlock states
84 unique states visited
0 strongly connected components in search stack
85 transitions explored
84 items max in DFS search stack
4887 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,103.819,1531880,1,0,2.19116e+06,925,7622,9.63585e+06,349,3524,1558241
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-13-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(("((i12.i1.u88.p270==1)||(i10.i1.u51.p175==1))")||(G(!("(((i12.i0.u20.p55==1)&&(i4.u101.p329==1))&&(i17.u123.p558==1))")))))))
Formula 2 simplified : !XF("((i12.i1.u88.p270==1)||(i10.i1.u51.p175==1))" | G!"(((i12.i0.u20.p55==1)&&(i4.u101.p329==1))&&(i17.u123.p558==1))")
Computing Next relation with stutter on 1188 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
829 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,112.108,1722312,1,0,2.50316e+06,931,7705,1.0644e+07,351,3567,2106112
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-13-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620546165040

--------------------
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-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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