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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 146K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-00
FORMULA_NAME BusinessProcesses-PT-12-01
FORMULA_NAME BusinessProcesses-PT-12-02
FORMULA_NAME BusinessProcesses-PT-12-03
FORMULA_NAME BusinessProcesses-PT-12-04
FORMULA_NAME BusinessProcesses-PT-12-05
FORMULA_NAME BusinessProcesses-PT-12-06
FORMULA_NAME BusinessProcesses-PT-12-07
FORMULA_NAME BusinessProcesses-PT-12-08
FORMULA_NAME BusinessProcesses-PT-12-09
FORMULA_NAME BusinessProcesses-PT-12-10
FORMULA_NAME BusinessProcesses-PT-12-11
FORMULA_NAME BusinessProcesses-PT-12-12
FORMULA_NAME BusinessProcesses-PT-12-13
FORMULA_NAME BusinessProcesses-PT-12-14
FORMULA_NAME BusinessProcesses-PT-12-15

=== Now, execution of the tool begins

BK_START 1620545391191

Running Version 0
[2021-05-09 07:29:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:29:52] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-09 07:29:52] [INFO ] Transformed 586 places.
[2021-05-09 07:29:52] [INFO ] Transformed 525 transitions.
[2021-05-09 07:29:52] [INFO ] Found NUPN structural information;
[2021-05-09 07:29:52] [INFO ] Parsed PT model containing 586 places and 525 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:29:52] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 521
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 76 place count 506 transition count 447
Iterating global reduction 1 with 74 rules applied. Total rules applied 150 place count 506 transition count 447
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 187 place count 469 transition count 410
Iterating global reduction 1 with 37 rules applied. Total rules applied 224 place count 469 transition count 410
Applied a total of 224 rules in 105 ms. Remains 469 /582 variables (removed 113) and now considering 410/521 (removed 111) transitions.
// Phase 1: matrix 410 rows 469 cols
[2021-05-09 07:29:53] [INFO ] Computed 96 place invariants in 30 ms
[2021-05-09 07:29:53] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 410 rows 469 cols
[2021-05-09 07:29:53] [INFO ] Computed 96 place invariants in 11 ms
[2021-05-09 07:29:53] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
// Phase 1: matrix 410 rows 469 cols
[2021-05-09 07:29:54] [INFO ] Computed 96 place invariants in 29 ms
[2021-05-09 07:29:54] [INFO ] Dead Transitions using invariants and state equation in 275 ms returned []
Finished structural reductions, in 1 iterations. Remains : 469/582 places, 410/521 transitions.
[2021-05-09 07:29:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 07:29:54] [INFO ] Flatten gal took : 72 ms
FORMULA BusinessProcesses-PT-12-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:29:54] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:29:54] [INFO ] Input system was already deterministic with 410 transitions.
Incomplete random walk after 100000 steps, including 727 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 21) seen :10
Running SMT prover for 11 properties.
// Phase 1: matrix 410 rows 469 cols
[2021-05-09 07:29:54] [INFO ] Computed 96 place invariants in 11 ms
[2021-05-09 07:29:54] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:29:54] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:55] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-09 07:29:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:29:55] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-09 07:29:55] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:29:55] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:29:55] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 5 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:29:56] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:29:57] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:29:58] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 5 ms to minimize.
[2021-05-09 07:29:59] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4610 ms
[2021-05-09 07:29:59] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 33 ms.
[2021-05-09 07:30:01] [INFO ] Added : 199 causal constraints over 40 iterations in 1359 ms. Result :sat
[2021-05-09 07:30:01] [INFO ] [Real]Absence check using 55 positive place invariants in 27 ms returned sat
[2021-05-09 07:30:01] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-09 07:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:01] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:30:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:30:01] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 18 ms returned sat
[2021-05-09 07:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:01] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:30:01] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:30:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 877 ms
[2021-05-09 07:30:02] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 29 ms.
[2021-05-09 07:30:04] [INFO ] Added : 264 causal constraints over 53 iterations in 1658 ms. Result :sat
[2021-05-09 07:30:04] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-09 07:30:04] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:04] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:30:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:30:04] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:04] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-09 07:30:04] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:30:05] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:30:06] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2170 ms
[2021-05-09 07:30:06] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-09 07:30:08] [INFO ] Added : 307 causal constraints over 62 iterations in 1715 ms. Result :sat
[2021-05-09 07:30:08] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-09 07:30:08] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:08] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-09 07:30:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-09 07:30:08] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:09] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:30:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 719 ms
[2021-05-09 07:30:09] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-09 07:30:11] [INFO ] Added : 301 causal constraints over 61 iterations in 1465 ms. Result :sat
[2021-05-09 07:30:11] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:30:11] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:11] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-09 07:30:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:30:11] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:11] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:30:11] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:30:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 791 ms
[2021-05-09 07:30:12] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-09 07:30:13] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 430 ms
[2021-05-09 07:30:14] [INFO ] Added : 263 causal constraints over 54 iterations in 1754 ms. Result :sat
[2021-05-09 07:30:14] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:30:14] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 7 ms returned sat
[2021-05-09 07:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:14] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:30:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 401 ms
[2021-05-09 07:30:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:14] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:30:15] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:15] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:30:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 421 ms
[2021-05-09 07:30:15] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-09 07:30:16] [INFO ] Added : 290 causal constraints over 58 iterations in 1380 ms. Result :sat
[2021-05-09 07:30:17] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:30:17] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:17] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:30:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:17] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-09 07:30:17] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:17] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:30:17] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:30:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:30:19] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:30:20] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2779 ms
[2021-05-09 07:30:20] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-09 07:30:22] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:30:22] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:30:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2021-05-09 07:30:22] [INFO ] Added : 281 causal constraints over 57 iterations in 2118 ms. Result :sat
[2021-05-09 07:30:22] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned unsat
[2021-05-09 07:30:22] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-09 07:30:22] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:22] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:30:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2021-05-09 07:30:22] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-09 07:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:22] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:30:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:30:24] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:30:25] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2263 ms
[2021-05-09 07:30:25] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 28 ms.
[2021-05-09 07:30:26] [INFO ] Added : 261 causal constraints over 53 iterations in 1497 ms. Result :sat
[2021-05-09 07:30:26] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:30:26] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:26] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-09 07:30:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:26] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:30:26] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:27] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:30:27] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:30:28] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:30:29] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2173 ms
[2021-05-09 07:30:29] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-09 07:30:30] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2021-05-09 07:30:31] [INFO ] Added : 307 causal constraints over 62 iterations in 1984 ms. Result :sat
[2021-05-09 07:30:31] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-09 07:30:31] [INFO ] [Real]Absence check using 55 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-09 07:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:31] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-09 07:30:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:30:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-09 07:30:31] [INFO ] [Nat]Absence check using 55 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 07:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:30:31] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:30:31] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:30:32] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:30:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1513 ms
[2021-05-09 07:30:33] [INFO ] Computed and/alt/rep : 404/904/404 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-09 07:30:34] [INFO ] Added : 269 causal constraints over 54 iterations in 1524 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 459 transition count 401
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 459 transition count 401
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 455 transition count 397
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 455 transition count 397
Applied a total of 27 rules in 76 ms. Remains 455 /469 variables (removed 14) and now considering 397/410 (removed 13) transitions.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:30:34] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:30:35] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:30:35] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 07:30:35] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:30:35] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:30:35] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/469 places, 397/410 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s399 0) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 468 ms.
Product exploration explored 100000 steps with 33333 reset in 396 ms.
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 455 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 455/455 places, 397/397 transitions.
Graph (trivial) has 204 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 450 transition count 391
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 94 Pre rules applied. Total rules applied 46 place count 450 transition count 596
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 140 place count 450 transition count 596
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 156 place count 434 transition count 537
Deduced a syphon composed of 123 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 172 place count 434 transition count 537
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 296 place count 434 transition count 537
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 326 place count 404 transition count 507
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 356 place count 404 transition count 507
Deduced a syphon composed of 217 places in 1 ms
Applied a total of 356 rules in 158 ms. Remains 404 /455 variables (removed 51) and now considering 507/397 (removed -110) transitions.
[2021-05-09 07:30:37] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 507 rows 404 cols
[2021-05-09 07:30:37] [INFO ] Computed 95 place invariants in 12 ms
[2021-05-09 07:30:38] [INFO ] Dead Transitions using invariants and state equation in 303 ms returned []
Finished structural reductions, in 1 iterations. Remains : 404/455 places, 507/397 transitions.
Product exploration explored 100000 steps with 33333 reset in 831 ms.
Product exploration explored 100000 steps with 33333 reset in 719 ms.
[2021-05-09 07:30:39] [INFO ] Flatten gal took : 22 ms
[2021-05-09 07:30:39] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:30:39] [INFO ] Time to serialize gal into /tmp/LTL12265650930472442025.gal : 13 ms
[2021-05-09 07:30:39] [INFO ] Time to serialize properties into /tmp/LTL11929562127059163090.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/LTL12265650930472442025.gal, -t, CGAL, -LTL, /tmp/LTL11929562127059163090.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/LTL12265650930472442025.gal -t CGAL -LTL /tmp/LTL11929562127059163090.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p512==0)||(p279==1))")))))
Formula 0 simplified : !XXF"((p512==0)||(p279==1))"
Detected timeout of ITS tools.
[2021-05-09 07:30:54] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:30:54] [INFO ] Applying decomposition
[2021-05-09 07:30:54] [INFO ] Flatten gal took : 18 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/graph15632400657574548090.txt, -o, /tmp/graph15632400657574548090.bin, -w, /tmp/graph15632400657574548090.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/graph15632400657574548090.bin, -l, -1, -v, -w, /tmp/graph15632400657574548090.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:30:55] [INFO ] Decomposing Gal with order
[2021-05-09 07:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:30:55] [INFO ] Removed a total of 254 redundant transitions.
[2021-05-09 07:30:55] [INFO ] Flatten gal took : 68 ms
[2021-05-09 07:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 15 ms.
[2021-05-09 07:30:55] [INFO ] Time to serialize gal into /tmp/LTL12439012469961646204.gal : 9 ms
[2021-05-09 07:30:55] [INFO ] Time to serialize properties into /tmp/LTL15555126243869387875.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/LTL12439012469961646204.gal, -t, CGAL, -LTL, /tmp/LTL15555126243869387875.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/LTL12439012469961646204.gal -t CGAL -LTL /tmp/LTL15555126243869387875.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i16.u124.p512==0)||(i13.i1.u95.p279==1))")))))
Formula 0 simplified : !XXF"((i16.u124.p512==0)||(i13.i1.u95.p279==1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t167, t171, t187, t265, t275, t399, t400, t402, t403, i0.i0.u77.t170, i0.i0.u81.t162, i0.i0.u122.t76, i0.i0.u123.t73, i0.i1.u79.t165, i1.t179, i1.t175, i1.u69.t186, i1.u71.t182, i1.u73.t178, i2.u57.t206, i2.u65.t194, i3.i0.u42.t234, i3.i0.u44.t230, i3.i0.u105.t125, i3.i1.u40.t238, i3.i2.u104.t128, i4.i0.u14.t278, i4.i0.u22.t260, i4.i1.u20.t264, i5.u12.t281, i5.u13.t280, i6.i0.u46.t226, i6.i0.u48.t222, i6.i2.u106.t122, i6.i2.u107.t119, i6.i2.u108.t116, i6.i2.u109.t113, i7.i0.u59.t202, i7.i2.u113.t101, i7.i2.u114.t97, i8.u102.t134, i8.u103.t131, i9.u75.t174, i9.u120.t82, i9.u121.t79, i10.u67.t190, i10.u118.t88, i10.u119.t85, i11.i0.u53.t214, i11.i0.u55.t210, i11.i1.u110.t110, i11.i1.u111.t107, i11.i1.u112.t104, i12.i0.t274, i12.i1.u97.t151, i12.i1.u98.t148, i12.i1.u99.t144, i13.t2, i13.t1, i13.t0, i13.i0.t3, i13.i0.u24.t241, i13.i0.u24.t256, i13.i0.u100.t140, i13.i0.u101.t137, i13.i1.u95.t157, i14.u94.t159, i15.u116.t94, i15.u117.t91, i16.u124.t27, i16.u124.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/284/75/395
Computing Next relation with stutter on 1232 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
457 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.63452,141640,1,0,237722,690,6406,648412,287,1786,556108
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-12-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-12-00 finished in 26051 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 458 transition count 400
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 458 transition count 400
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 454 transition count 396
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 454 transition count 396
Applied a total of 29 rules in 80 ms. Remains 454 /469 variables (removed 15) and now considering 396/410 (removed 14) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:31:00] [INFO ] Computed 95 place invariants in 13 ms
[2021-05-09 07:31:01] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:31:01] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 07:31:01] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:31:01] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:31:01] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/469 places, 396/410 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s381 0) (EQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 726 reset in 220 ms.
Product exploration explored 100000 steps with 734 reset in 221 ms.
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 729 reset in 214 ms.
Product exploration explored 100000 steps with 730 reset in 370 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 454 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 454/454 places, 396/396 transitions.
Graph (trivial) has 204 edges and 454 vertex of which 6 / 454 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 449 transition count 390
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 95 Pre rules applied. Total rules applied 46 place count 449 transition count 610
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 141 place count 449 transition count 610
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 157 place count 433 transition count 551
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 173 place count 433 transition count 551
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 297 place count 433 transition count 551
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 327 place count 403 transition count 521
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 357 place count 403 transition count 521
Deduced a syphon composed of 218 places in 1 ms
Applied a total of 357 rules in 75 ms. Remains 403 /454 variables (removed 51) and now considering 521/396 (removed -125) transitions.
[2021-05-09 07:31:03] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 521 rows 403 cols
[2021-05-09 07:31:03] [INFO ] Computed 95 place invariants in 5 ms
[2021-05-09 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 404 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/454 places, 521/396 transitions.
Product exploration explored 100000 steps with 14352 reset in 815 ms.
Product exploration explored 100000 steps with 14371 reset in 661 ms.
[2021-05-09 07:31:05] [INFO ] Flatten gal took : 16 ms
[2021-05-09 07:31:05] [INFO ] Flatten gal took : 18 ms
[2021-05-09 07:31:05] [INFO ] Time to serialize gal into /tmp/LTL13721201250599531771.gal : 8 ms
[2021-05-09 07:31:05] [INFO ] Time to serialize properties into /tmp/LTL17534425650254237329.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/LTL13721201250599531771.gal, -t, CGAL, -LTL, /tmp/LTL17534425650254237329.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/LTL13721201250599531771.gal -t CGAL -LTL /tmp/LTL17534425650254237329.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p470==0)||(p427==1))")))))
Formula 0 simplified : !XXG"((p470==0)||(p427==1))"
Detected timeout of ITS tools.
[2021-05-09 07:31:20] [INFO ] Flatten gal took : 36 ms
[2021-05-09 07:31:20] [INFO ] Applying decomposition
[2021-05-09 07:31:20] [INFO ] Flatten gal took : 27 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/graph17321350231112749737.txt, -o, /tmp/graph17321350231112749737.bin, -w, /tmp/graph17321350231112749737.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/graph17321350231112749737.bin, -l, -1, -v, -w, /tmp/graph17321350231112749737.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:31:20] [INFO ] Decomposing Gal with order
[2021-05-09 07:31:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:31:20] [INFO ] Removed a total of 252 redundant transitions.
[2021-05-09 07:31:20] [INFO ] Flatten gal took : 44 ms
[2021-05-09 07:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 07:31:20] [INFO ] Time to serialize gal into /tmp/LTL8143060454612833211.gal : 6 ms
[2021-05-09 07:31:20] [INFO ] Time to serialize properties into /tmp/LTL12824800744086921896.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/LTL8143060454612833211.gal, -t, CGAL, -LTL, /tmp/LTL12824800744086921896.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/LTL8143060454612833211.gal -t CGAL -LTL /tmp/LTL12824800744086921896.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i6.i0.u97.p470==0)||(i5.i1.u122.p427==1))")))))
Formula 0 simplified : !XXG"((i6.i0.u97.p470==0)||(i5.i1.u122.p427==1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t167, t179, t187, t265, t398, t399, t400, t402, t403, i0.i0.u78.t162, i0.i1.u74.t170, i0.i1.u76.t165, i0.i2.u118.t79, i0.i2.u119.t76, i0.i2.u120.t73, i1.u62.t194, i1.u66.t186, i1.u113.t94, i2.u52.t210, i2.u54.t206, i3.u17.t264, i3.u19.t260, i3.u39.t234, i4.t275, i4.i0.u10.t281, i4.i0.u11.t280, i4.i1.u12.t278, i5.i0.t274, i5.i1.t10, i5.i1.u121.t69, i6.t2, i6.t0, i6.i0.t1, i6.i0.t3, i6.i0.u21.t241, i6.i0.u21.t256, i6.i0.u97.t140, i6.i1.u92.t157, i6.i2.u98.t137, i7.u41.t230, i7.u43.t226, i7.u104.t122, i8.i0.u45.t222, i8.i0.u50.t214, i9.i0.u56.t202, i9.i2.u110.t104, i9.i2.u111.t101, i9.i2.u112.t97, i10.i0.u64.t190, i10.i1.u114.t91, i10.i1.u115.t88, i10.i1.u116.t85, i11.u68.t182, i12.t175, i12.t171, i12.u70.t178, i12.u72.t174, i12.u117.t82, i13.i0.u108.t110, i13.i0.u109.t107, i13.i1.u105.t119, i13.i1.u106.t116, i13.i1.u107.t113, i14.i0.u37.t238, i14.i1.u99.t134, i14.i1.u100.t131, i14.i2.u101.t128, i14.i2.u103.t125, i15.u91.t159, i15.u94.t151, i15.u95.t148, i15.u96.t144, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/284/76/396
Computing Next relation with stutter on 1232 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11436082706731806001
[2021-05-09 07:31:35] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11436082706731806001
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/ltsmin11436082706731806001]
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/ltsmin11436082706731806001] 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/ltsmin11436082706731806001] 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-12-01 finished in 36094 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&F(p2)&&X((!p0 U (p3||G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 459 transition count 401
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 459 transition count 401
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 455 transition count 397
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 455 transition count 397
Applied a total of 27 rules in 41 ms. Remains 455 /469 variables (removed 14) and now considering 397/410 (removed 13) transitions.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:31:36] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:31:37] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:31:37] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:31:37] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2021-05-09 07:31:37] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:31:38] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 455/469 places, 397/410 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2) (AND p0 (NOT p3))), true, (NOT p1), (NOT p2), (AND p0 (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-12-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s17 0) (EQ s163 1)), p0:(EQ s8 1), p2:(OR (EQ s263 0) (EQ s269 1)), p3:(AND (NEQ s17 0) (NEQ s163 1) (NEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-04 finished in 1445 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Graph (trivial) has 216 edges and 469 vertex of which 6 / 469 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 55 place count 462 transition count 350
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 409 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 408 transition count 349
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 110 place count 408 transition count 256
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 314 place count 297 transition count 256
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 322 place count 289 transition count 248
Iterating global reduction 3 with 8 rules applied. Total rules applied 330 place count 289 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 289 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 288 transition count 247
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 572 place count 166 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 3 with 2 rules applied. Total rules applied 574 place count 165 transition count 133
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 580 place count 165 transition count 133
Applied a total of 580 rules in 83 ms. Remains 165 /469 variables (removed 304) and now considering 133/410 (removed 277) transitions.
// Phase 1: matrix 133 rows 165 cols
[2021-05-09 07:31:38] [INFO ] Computed 73 place invariants in 2 ms
[2021-05-09 07:31:38] [INFO ] Implicit Places using invariants in 164 ms returned [1, 2, 5, 6, 30, 31, 32, 33, 40, 41, 42, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 167 ms to find 19 implicit places.
[2021-05-09 07:31:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 133 rows 146 cols
[2021-05-09 07:31:38] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 07:31:38] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 146/469 places, 133/410 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2021-05-09 07:31:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 133 rows 146 cols
[2021-05-09 07:31:38] [INFO ] Computed 54 place invariants in 3 ms
[2021-05-09 07:31:38] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 146/469 places, 133/410 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s5 1)), p1:(AND (NEQ s36 0) (NEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21654 reset in 328 ms.
Product exploration explored 100000 steps with 21704 reset in 326 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 21690 reset in 226 ms.
Product exploration explored 100000 steps with 21630 reset in 201 ms.
[2021-05-09 07:31:40] [INFO ] Flatten gal took : 8 ms
[2021-05-09 07:31:40] [INFO ] Flatten gal took : 7 ms
[2021-05-09 07:31:40] [INFO ] Time to serialize gal into /tmp/LTL8360910069458180638.gal : 1 ms
[2021-05-09 07:31:40] [INFO ] Time to serialize properties into /tmp/LTL7551700572174765835.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/LTL8360910069458180638.gal, -t, CGAL, -LTL, /tmp/LTL7551700572174765835.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/LTL8360910069458180638.gal -t CGAL -LTL /tmp/LTL7551700572174765835.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p91==0)||(p83==1))"))||(F(G("((p186!=0)&&(p184!=1))")))))
Formula 0 simplified : !(G"((p91==0)||(p83==1))" | FG"((p186!=0)&&(p184!=1))")
Reverse transition relation is NOT exact ! Due to transitions t201.t5.t202, t49.t51.t52.t6, t45.t46.t7.t47, t42.t43.t8, t39.t40.t9, t23.t25.t26.t10.t27, t252.t254.t0.t256, t249.t250.t1.t256, t246.t247.t2.t256, t243.t244.t3.t256, t59.t154.t155.t276.t292.t402.t277.t278.t69, t158.t353.t241.t256.t69, t138.t343.t241.t256.t69, t140.t141.t348.t241.t256.t69, t406.t164.t299.t165.t69, t71.t161.t163.t166.t167.t171.t175.t179.t183.t187.t191.t195.t203.t207.t211.t215.t223.t227.t231.t235.t239.t257.t261.t265.t275.t266.t267.t216.t218.t72.t75.t78.t81.t84.t87.t90.t93.t96.t100.t103.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t143.t147.t150.t153.t156.t159.t157.t151.t148.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t104.t101.t94.t91.t88.t85.t82.t79.t76.t73.t269.t270.t268, t71.t161.t163.t166.t167.t171.t175.t179.t183.t187.t191.t195.t203.t207.t211.t215.t223.t227.t231.t235.t239.t257.t261.t265.t275.t266.t267.t216.t218.t72.t75.t78.t81.t84.t87.t90.t93.t96.t100.t103.t106.t109.t112.t115.t118.t121.t124.t127.t130.t133.t136.t139.t143.t147.t150.t153.t156.t159.t157.t151.t148.t137.t134.t131.t128.t125.t122.t119.t116.t113.t110.t107.t104.t101.t94.t91.t88.t85.t82.t79.t76.t73.t269.t270.t271.t272, t398.t69.t269.t270.t268, t398.t69.t269.t270.t271.t272, t399.t69.t269.t270.t268, t399.t69.t269.t270.t271.t272, t400.t69.t269.t270.t268, t400.t69.t269.t270.t271.t272, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/74/23/133
Computing Next relation with stutter on 1232 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
160 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.62673,64092,1,0,340,188283,265,296,5861,219735,632
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-12-05 finished in 3603 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(G(p0))&&(G(p0)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 461 transition count 402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 461 transition count 402
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 458 transition count 399
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 458 transition count 399
Applied a total of 22 rules in 52 ms. Remains 458 /469 variables (removed 11) and now considering 399/410 (removed 11) transitions.
// Phase 1: matrix 399 rows 458 cols
[2021-05-09 07:31:42] [INFO ] Computed 96 place invariants in 5 ms
[2021-05-09 07:31:42] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 399 rows 458 cols
[2021-05-09 07:31:42] [INFO ] Computed 96 place invariants in 12 ms
[2021-05-09 07:31:42] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
// Phase 1: matrix 399 rows 458 cols
[2021-05-09 07:31:42] [INFO ] Computed 96 place invariants in 4 ms
[2021-05-09 07:31:42] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 458/469 places, 399/410 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(OR p1 p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s252 0) (EQ s376 1)), p1:(OR (EQ s6 0) (EQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3963 steps with 29 reset in 10 ms.
FORMULA BusinessProcesses-PT-12-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-06 finished in 1157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(F((G(p2)||p1))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 459 transition count 401
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 459 transition count 401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 456 transition count 398
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 456 transition count 398
Applied a total of 25 rules in 38 ms. Remains 456 /469 variables (removed 13) and now considering 398/410 (removed 12) transitions.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:31:43] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:31:43] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:31:43] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:31:43] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:31:43] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-09 07:31:44] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/469 places, 398/410 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s209 0) (EQ s378 1)), p1:(OR (NEQ s395 0) (NEQ s28 1)), p2:(AND (NEQ s28 0) (NEQ s395 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Graph (complete) has 1034 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 456 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 456/456 places, 398/398 transitions.
Graph (trivial) has 202 edges and 456 vertex of which 6 / 456 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 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 451 transition count 392
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 96 Pre rules applied. Total rules applied 44 place count 451 transition count 612
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 140 place count 451 transition count 612
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 155 place count 436 transition count 554
Deduced a syphon composed of 124 places in 2 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 170 place count 436 transition count 554
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 1 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 291 place count 436 transition count 554
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 320 place count 407 transition count 525
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 349 place count 407 transition count 525
Deduced a syphon composed of 216 places in 0 ms
Applied a total of 349 rules in 77 ms. Remains 407 /456 variables (removed 49) and now considering 525/398 (removed -127) transitions.
[2021-05-09 07:31:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 525 rows 407 cols
[2021-05-09 07:31:46] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 07:31:46] [INFO ] Dead Transitions using invariants and state equation in 305 ms returned []
Finished structural reductions, in 1 iterations. Remains : 407/456 places, 525/398 transitions.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
[2021-05-09 07:31:47] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:31:47] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:31:47] [INFO ] Time to serialize gal into /tmp/LTL15992213372998779718.gal : 3 ms
[2021-05-09 07:31:47] [INFO ] Time to serialize properties into /tmp/LTL15341357647972965134.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/LTL15992213372998779718.gal, -t, CGAL, -LTL, /tmp/LTL15341357647972965134.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/LTL15992213372998779718.gal -t CGAL -LTL /tmp/LTL15341357647972965134.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p236==0)||(p462==1))")||(X(X(F(("((p504!=0)||(p28!=1))")||(G("((p28!=0)&&(p504!=1))")))))))))
Formula 0 simplified : !X("((p236==0)||(p462==1))" | XXF("((p504!=0)||(p28!=1))" | G"((p28!=0)&&(p504!=1))"))
Detected timeout of ITS tools.
[2021-05-09 07:32:02] [INFO ] Flatten gal took : 32 ms
[2021-05-09 07:32:02] [INFO ] Applying decomposition
[2021-05-09 07:32:02] [INFO ] Flatten gal took : 49 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/graph14952503243428526001.txt, -o, /tmp/graph14952503243428526001.bin, -w, /tmp/graph14952503243428526001.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/graph14952503243428526001.bin, -l, -1, -v, -w, /tmp/graph14952503243428526001.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:32:02] [INFO ] Decomposing Gal with order
[2021-05-09 07:32:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:32:02] [INFO ] Removed a total of 251 redundant transitions.
[2021-05-09 07:32:02] [INFO ] Flatten gal took : 37 ms
[2021-05-09 07:32:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-09 07:32:02] [INFO ] Time to serialize gal into /tmp/LTL15446033317651579074.gal : 6 ms
[2021-05-09 07:32:02] [INFO ] Time to serialize properties into /tmp/LTL15695653482977106779.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/LTL15446033317651579074.gal, -t, CGAL, -LTL, /tmp/LTL15695653482977106779.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/LTL15446033317651579074.gal -t CGAL -LTL /tmp/LTL15695653482977106779.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i1.i1.u78.p236==0)||(i14.i2.u129.p462==1))")||(X(X(F(("((i15.u137.p504!=0)||(i5.u12.p28!=1))")||(G("((i5.u12.p28!=0)&&(i15.u137.p504!=1))")))))))))
Formula 0 simplified : !X("((i1.i1.u78.p236==0)||(i14.i2.u129.p462==1))" | XXF("((i15.u137.p504!=0)||(i5.u12.p28!=1))" | G"((i5.u12.p28!=0)&&(i15.u137.p504!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t167, t175, t187, t265, t398, t400, t402, t403, i0.i0.u119.t79, i0.i0.u120.t76, i0.i1.t171, i0.i1.t179, i0.i1.u68.t186, i0.i1.u70.t182, i0.i1.u74.t174, i1.i0.u76.t170, i1.i0.u80.t162, i1.i0.u121.t73, i1.i1.u78.t165, i2.i0.u66.t190, i2.i1.u72.t178, i2.i2.u115.t91, i2.i2.u116.t88, i2.i2.u117.t85, i2.i2.u118.t82, i3.u52.t214, i3.u54.t210, i3.u56.t206, i4.u19.t264, i4.u21.t260, i5.t275, i5.u12.t281, i5.u13.t280, i5.u14.t278, i6.t274, i7.i0.u41.t234, i7.i0.u43.t230, i7.i0.u104.t125, i7.i1.u101.t134, i7.i1.u102.t131, i7.i1.u103.t128, i7.i1.u105.t122, i8.i0.u45.t226, i8.i0.u47.t222, i9.i0.u58.t202, i9.i2.u110.t107, i9.i2.u111.t104, i9.i2.u112.t101, i10.u64.t194, i10.u113.t97, i10.u114.t94, i11.i0.u108.t113, i11.i0.u109.t110, i11.i1.u106.t119, i11.i1.u107.t116, i12.u39.t238, i13.i0.u98.t144, i13.i1.u93.t159, i13.i1.u96.t151, i13.i1.u97.t148, i14.t2, i14.t0, i14.i0.u94.t157, i14.i1.t1, i14.i1.t3, i14.i1.u23.t241, i14.i1.u23.t256, i14.i1.u99.t140, i14.i2.u100.t137, i15.t31, i15.t10, i15.u122.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/285/76/397
Computing Next relation with stutter on 1232 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
383 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,3.90038,131240,1,0,206848,755,6396,557319,285,1752,481249
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-12-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-12-07 finished in 23962 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 458 transition count 400
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 458 transition count 400
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 454 transition count 396
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 454 transition count 396
Applied a total of 29 rules in 53 ms. Remains 454 /469 variables (removed 15) and now considering 396/410 (removed 14) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:32:07] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:32:07] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:32:07] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 07:32:07] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:32:07] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:32:08] [INFO ] Dead Transitions using invariants and state equation in 276 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/469 places, 396/410 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-12-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s100 0) (EQ s91 1)), p0:(AND (EQ s91 0) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 724 reset in 240 ms.
Product exploration explored 100000 steps with 726 reset in 289 ms.
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 738 reset in 240 ms.
Product exploration explored 100000 steps with 731 reset in 289 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 454 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 454/454 places, 396/396 transitions.
Graph (trivial) has 203 edges and 454 vertex of which 6 / 454 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.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 449 transition count 390
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 94 Pre rules applied. Total rules applied 46 place count 449 transition count 609
Deduced a syphon composed of 139 places in 2 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 140 place count 449 transition count 609
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 156 place count 433 transition count 550
Deduced a syphon composed of 123 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 172 place count 433 transition count 550
Performed 123 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 123 rules applied. Total rules applied 295 place count 433 transition count 550
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 324 place count 404 transition count 521
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 353 place count 404 transition count 521
Deduced a syphon composed of 217 places in 1 ms
Applied a total of 353 rules in 80 ms. Remains 404 /454 variables (removed 50) and now considering 521/396 (removed -125) transitions.
[2021-05-09 07:32:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 521 rows 404 cols
[2021-05-09 07:32:10] [INFO ] Computed 95 place invariants in 12 ms
[2021-05-09 07:32:10] [INFO ] Dead Transitions using invariants and state equation in 399 ms returned []
Finished structural reductions, in 1 iterations. Remains : 404/454 places, 521/396 transitions.
Product exploration explored 100000 steps with 25000 reset in 931 ms.
Product exploration explored 100000 steps with 25000 reset in 875 ms.
[2021-05-09 07:32:12] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:32:12] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:32:12] [INFO ] Time to serialize gal into /tmp/LTL6963358539157523356.gal : 2 ms
[2021-05-09 07:32:12] [INFO ] Time to serialize properties into /tmp/LTL9355122277983499097.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/LTL6963358539157523356.gal, -t, CGAL, -LTL, /tmp/LTL9355122277983499097.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/LTL6963358539157523356.gal -t CGAL -LTL /tmp/LTL9355122277983499097.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((p119==0)||(p110==1))"))||("((p110==0)&&(p119==1))"))))
Formula 0 simplified : !X("((p110==0)&&(p119==1))" | G"((p119==0)||(p110==1))")
Detected timeout of ITS tools.
[2021-05-09 07:32:27] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:32:27] [INFO ] Applying decomposition
[2021-05-09 07:32:27] [INFO ] Flatten gal took : 11 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/graph16145801750374029414.txt, -o, /tmp/graph16145801750374029414.bin, -w, /tmp/graph16145801750374029414.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/graph16145801750374029414.bin, -l, -1, -v, -w, /tmp/graph16145801750374029414.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:32:27] [INFO ] Decomposing Gal with order
[2021-05-09 07:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:32:27] [INFO ] Removed a total of 253 redundant transitions.
[2021-05-09 07:32:27] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2021-05-09 07:32:27] [INFO ] Time to serialize gal into /tmp/LTL13436542340222653499.gal : 3 ms
[2021-05-09 07:32:27] [INFO ] Time to serialize properties into /tmp/LTL12432118645575741106.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/LTL13436542340222653499.gal, -t, CGAL, -LTL, /tmp/LTL12432118645575741106.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/LTL13436542340222653499.gal -t CGAL -LTL /tmp/LTL12432118645575741106.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((i9.u39.p119==0)||(i4.u36.p110==1))"))||("((i4.u36.p110==0)&&(i9.u39.p119==1))"))))
Formula 0 simplified : !X("((i4.u36.p110==0)&&(i9.u39.p119==1))" | G"((i9.u39.p119==0)||(i4.u36.p110==1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t167, t175, t265, t399, t400, t402, t403, i0.u81.t162, i0.u79.t165, i0.u77.t170, i0.u122.t76, i0.u123.t73, i1.t171, i1.u73.t178, i1.u75.t174, i1.u120.t82, i1.u118.t88, i1.u119.t85, i1.u121.t79, i2.t187, i2.u64.t194, i2.u67.t190, i3.u18.t264, i3.u20.t260, i4.t241, i4.t3, i4.t2, i4.t1, i4.t0, i4.u94.t157, i4.u22.t256, i4.u99.t140, i4.u100.t137, i5.u43.t230, i5.u45.t226, i5.u106.t122, i5.u104.t128, i5.u105.t125, i5.u107.t119, i6.u47.t222, i6.u108.t116, i6.u109.t113, i7.u56.t206, i7.u58.t202, i8.t179, i8.u69.t186, i8.u71.t182, i9.u39.t238, i9.u41.t234, i9.u102.t134, i9.u103.t131, i10.u113.t101, i10.u114.t97, i10.u115.t94, i10.u117.t91, i11.u52.t214, i11.u54.t210, i11.u110.t110, i11.u111.t107, i11.u112.t104, i12.u93.t159, i12.u96.t151, i12.u97.t148, i12.u98.t144, i13.t275, i13.u13.t278, i13.u11.t281, i13.u12.t280, i14.i0.t274, i14.i1.t10, i14.i1.u124.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/283/75/394
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
483 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.8783,211676,1,0,413332,806,6617,766591,283,2602,1081746
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-12-08 finished in 26235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 459 transition count 401
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 459 transition count 401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 456 transition count 398
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 456 transition count 398
Applied a total of 25 rules in 22 ms. Remains 456 /469 variables (removed 13) and now considering 398/410 (removed 12) transitions.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:33] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 07:32:33] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:33] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:32:34] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2021-05-09 07:32:34] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 07:32:34] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/469 places, 398/410 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-12-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s378 0) (EQ s2 1)), p0:(AND (EQ s293 0) (EQ s40 1)), p2:(AND (NEQ s424 0) (NEQ s24 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-09 finished in 1266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 410
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 458 transition count 400
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 458 transition count 400
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 454 transition count 396
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 454 transition count 396
Applied a total of 29 rules in 46 ms. Remains 454 /469 variables (removed 15) and now considering 396/410 (removed 14) transitions.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:32:34] [INFO ] Computed 95 place invariants in 5 ms
[2021-05-09 07:32:34] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:32:34] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 07:32:35] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2021-05-09 07:32:35] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 07:32:35] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/469 places, 396/410 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s441 0) (NEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-11 finished in 1174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 469 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 469/469 places, 410/410 transitions.
Graph (trivial) has 217 edges and 469 vertex of which 6 / 469 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 462 transition count 349
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 408 transition count 349
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 110 place count 408 transition count 254
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 318 place count 295 transition count 254
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 325 place count 288 transition count 247
Iterating global reduction 2 with 7 rules applied. Total rules applied 332 place count 288 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 288 transition count 246
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 334 place count 287 transition count 246
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 576 place count 164 transition count 127
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 578 place count 163 transition count 131
Applied a total of 578 rules in 25 ms. Remains 163 /469 variables (removed 306) and now considering 131/410 (removed 279) transitions.
// Phase 1: matrix 131 rows 163 cols
[2021-05-09 07:32:35] [INFO ] Computed 73 place invariants in 1 ms
[2021-05-09 07:32:35] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 119 ms to find 19 implicit places.
[2021-05-09 07:32:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 131 rows 144 cols
[2021-05-09 07:32:35] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-09 07:32:35] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 144/469 places, 131/410 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2021-05-09 07:32:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 131 rows 144 cols
[2021-05-09 07:32:35] [INFO ] Computed 54 place invariants in 0 ms
[2021-05-09 07:32:36] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/469 places, 131/410 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s75 0) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-13 finished in 317 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1799437095146109113
[2021-05-09 07:32:36] [INFO ] Computing symmetric may disable matrix : 410 transitions.
[2021-05-09 07:32:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:32:36] [INFO ] Applying decomposition
[2021-05-09 07:32:36] [INFO ] Computing symmetric may enable matrix : 410 transitions.
[2021-05-09 07:32:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:32:36] [INFO ] Flatten gal took : 9 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/graph8169082948053614332.txt, -o, /tmp/graph8169082948053614332.bin, -w, /tmp/graph8169082948053614332.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/graph8169082948053614332.bin, -l, -1, -v, -w, /tmp/graph8169082948053614332.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:32:36] [INFO ] Decomposing Gal with order
[2021-05-09 07:32:36] [INFO ] Computing Do-Not-Accords matrix : 410 transitions.
[2021-05-09 07:32:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:32:36] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:32:36] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1799437095146109113
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/ltsmin1799437095146109113]
[2021-05-09 07:32:36] [INFO ] Removed a total of 255 redundant transitions.
[2021-05-09 07:32:36] [INFO ] Flatten gal took : 20 ms
[2021-05-09 07:32:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2021-05-09 07:32:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality2026205738207925731.gal : 2 ms
[2021-05-09 07:32:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality6550562979834512828.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/LTLCardinality2026205738207925731.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6550562979834512828.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/LTLCardinality2026205738207925731.gal -t CGAL -LTL /tmp/LTLCardinality6550562979834512828.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i14.i2.u104.p470==0)||(i16.u130.p427==1))")))))
Formula 0 simplified : !XXG"((i14.i2.u104.p470==0)||(i16.u130.p427==1))"
Compilation finished in 1931 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1799437095146109113]
Link finished in 95 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1799437095146109113]
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t260, t274, t282, t388, t514, t515, t517, t518, i0.u12.t395, i0.u13.t394, i0.u21.t369, i0.u23.t365, i1.t387, i1.t372, i2.u48.t321, i2.u111.t202, i2.u112.t198, i3.i0.u50.t317, i4.i0.u57.t305, i4.i0.u115.t186, i4.i1.u59.t301, i5.i0.u61.t297, i5.i0.u67.t289, i5.i2.t171, i5.i2.u119.t172, i6.i0.u83.t253, i6.i1.u81.t256, i6.i2.u79.t263, i6.i2.u127.t142, i6.i2.u128.t138, i7.t264, i7.i0.t270, i7.i0.u73.t277, i7.i0.u75.t273, i7.i1.u77.t269, i7.i2.u125.t150, i7.i2.u126.t146, i8.u69.t285, i8.u123.t158, i8.u124.t154, i9.u55.t309, i9.u113.t194, i9.u114.t190, i9.u116.t182, i10.i1.u42.t335, i10.i2.u44.t331, i10.i2.u46.t327, i10.i3.u108.t214, i10.i3.u109.t210, i10.i3.u110.t206, i11.i0.u14.t391, i11.i1.u100.t238, i11.i1.u101.t234, i11.i2.u97.t249, i12.u71.t281, i13.i0.u107.t218, i13.i1.t231, i13.i1.u103.t232, i14.t1, i14.t0, i14.i0.t2, i14.i0.t3, i14.i0.t342, i14.i0.u25.t361, i14.i0.u106.t222, i14.i1.u98.t246, i14.i2.t227, i14.i2.u104.t228, i15.i0.u121.t166, i15.i0.u122.t162, i15.i1.u117.t178, i15.i1.u118.t174, i16.t104, i16.t101, i16.t50, i16.u151.t33, i16.u151.t44, i16.u151.t92, i16.u151.t132, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/290/82/408
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1738 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,17.4312,465908,1,0,806872,900,7499,1.77442e+06,267,2832,2118320
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620545601269

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, examination is LTLCardinality"
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-162038143800412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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