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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 159K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620547421795

Running Version 0
[2021-05-09 08:03:43] [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 08:03:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:03:43] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-09 08:03:43] [INFO ] Transformed 638 places.
[2021-05-09 08:03:43] [INFO ] Transformed 578 transitions.
[2021-05-09 08:03:43] [INFO ] Found NUPN structural information;
[2021-05-09 08:03:43] [INFO ] Parsed PT model containing 638 places and 578 transitions in 107 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 08:03:43] [INFO ] Initial state test concluded for 4 properties.
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 98 place count 532 transition count 477
Iterating global reduction 1 with 93 rules applied. Total rules applied 191 place count 532 transition count 477
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 238 place count 485 transition count 430
Iterating global reduction 1 with 47 rules applied. Total rules applied 285 place count 485 transition count 430
Applied a total of 285 rules in 99 ms. Remains 485 /630 variables (removed 145) and now considering 430/570 (removed 140) transitions.
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 08:03:43] [INFO ] Computed 95 place invariants in 39 ms
[2021-05-09 08:03:44] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 08:03:44] [INFO ] Computed 95 place invariants in 16 ms
[2021-05-09 08:03:44] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 08:03:44] [INFO ] Computed 95 place invariants in 17 ms
[2021-05-09 08:03:44] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 485/630 places, 430/570 transitions.
[2021-05-09 08:03:45] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 08:03:45] [INFO ] Flatten gal took : 79 ms
FORMULA BusinessProcesses-PT-16-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:03:45] [INFO ] Flatten gal took : 35 ms
[2021-05-09 08:03:45] [INFO ] Input system was already deterministic with 430 transitions.
Incomplete random walk after 100000 steps, including 665 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 13) seen :5
Running SMT prover for 8 properties.
// Phase 1: matrix 430 rows 485 cols
[2021-05-09 08:03:45] [INFO ] Computed 95 place invariants in 13 ms
[2021-05-09 08:03:45] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2021-05-09 08:03:45] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 08:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:45] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 08:03:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:46] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2021-05-09 08:03:46] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 08:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:46] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1240 ms
[2021-05-09 08:03:47] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 32 ms.
[2021-05-09 08:03:48] [INFO ] Added : 216 causal constraints over 44 iterations in 1382 ms. Result :sat
[2021-05-09 08:03:48] [INFO ] [Real]Absence check using 56 positive place invariants in 27 ms returned sat
[2021-05-09 08:03:48] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:49] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-09 08:03:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2021-05-09 08:03:49] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 08:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:49] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1218 ms
[2021-05-09 08:03:50] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 32 ms.
[2021-05-09 08:03:52] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:03:52] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:03:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2021-05-09 08:03:52] [INFO ] Added : 293 causal constraints over 59 iterations in 2023 ms. Result :sat
[2021-05-09 08:03:52] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2021-05-09 08:03:52] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 08:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:52] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-09 08:03:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:52] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2021-05-09 08:03:52] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 08:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:53] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Deduced a trap composed of 35 places in 16 ms of which 0 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 945 ms
[2021-05-09 08:03:54] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 18 ms.
[2021-05-09 08:03:55] [INFO ] Added : 276 causal constraints over 56 iterations in 1229 ms. Result :sat
[2021-05-09 08:03:55] [INFO ] [Real]Absence check using 56 positive place invariants in 28 ms returned sat
[2021-05-09 08:03:55] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 08:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:55] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 08:03:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:55] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2021-05-09 08:03:55] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 16 ms returned sat
[2021-05-09 08:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:55] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 734 ms
[2021-05-09 08:03:56] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 16 ms.
[2021-05-09 08:03:57] [INFO ] Added : 244 causal constraints over 49 iterations in 1107 ms. Result :sat
[2021-05-09 08:03:57] [INFO ] [Real]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-09 08:03:57] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:57] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 510 ms
[2021-05-09 08:03:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:58] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2021-05-09 08:03:58] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 08:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:58] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 5 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 568 ms
[2021-05-09 08:03:59] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 25 ms.
[2021-05-09 08:04:00] [INFO ] Added : 237 causal constraints over 48 iterations in 1125 ms. Result :sat
[2021-05-09 08:04:00] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2021-05-09 08:04:00] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 08:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:00] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-09 08:04:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:00] [INFO ] [Nat]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-09 08:04:00] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 08:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:00] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 08:04:00] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:04:00] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 14 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:04:01] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:04:02] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:04:02] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:04:02] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:04:02] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:04:02] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2021-05-09 08:04:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1543 ms
[2021-05-09 08:04:02] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 30 ms.
[2021-05-09 08:04:04] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:04:04] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:04:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2021-05-09 08:04:04] [INFO ] Added : 282 causal constraints over 57 iterations in 2070 ms. Result :sat
[2021-05-09 08:04:04] [INFO ] [Real]Absence check using 56 positive place invariants in 18 ms returned sat
[2021-05-09 08:04:04] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 08:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:04] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-09 08:04:04] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:04:05] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:04:06] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:04:07] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:04:08] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4030 ms
[2021-05-09 08:04:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-09 08:04:08] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 08:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:09] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:04:09] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:04:10] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 0 ms to minimize.
[2021-05-09 08:04:10] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:04:10] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:04:10] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:04:10] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:04:10] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:04:11] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:04:12] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3555 ms
[2021-05-09 08:04:12] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 32 ms.
[2021-05-09 08:04:14] [INFO ] Added : 287 causal constraints over 58 iterations in 1800 ms. Result :sat
[2021-05-09 08:04:14] [INFO ] [Real]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-09 08:04:14] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 08:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:14] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-09 08:04:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:04:14] [INFO ] [Nat]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-09 08:04:14] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 08:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:04:14] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:04:15] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:04:16] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:04:17] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:04:18] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3966 ms
[2021-05-09 08:04:18] [INFO ] Computed and/alt/rep : 425/872/425 causal constraints (skipped 4 transitions) in 38 ms.
[2021-05-09 08:04:20] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2021-05-09 08:04:20] [INFO ] Added : 296 causal constraints over 60 iterations in 1865 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 227 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 479 transition count 372
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 428 transition count 372
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 103 place count 428 transition count 271
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 321 place count 311 transition count 271
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 329 place count 303 transition count 263
Iterating global reduction 2 with 8 rules applied. Total rules applied 337 place count 303 transition count 263
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 598 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 169 transition count 139
Applied a total of 600 rules in 112 ms. Remains 169 /485 variables (removed 316) and now considering 139/430 (removed 291) transitions.
// Phase 1: matrix 139 rows 169 cols
[2021-05-09 08:04:20] [INFO ] Computed 74 place invariants in 5 ms
[2021-05-09 08:04:21] [INFO ] Implicit Places using invariants in 155 ms returned [1, 2, 5, 6, 7, 8, 9, 18, 19, 23, 24, 25, 26, 27, 28, 51, 52, 53, 54, 55, 125]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 158 ms to find 21 implicit places.
[2021-05-09 08:04:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 139 rows 148 cols
[2021-05-09 08:04:21] [INFO ] Computed 53 place invariants in 3 ms
[2021-05-09 08:04:21] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 148/485 places, 139/430 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:04:21] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 139 rows 148 cols
[2021-05-09 08:04:21] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:04:21] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/485 places, 139/430 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19528 reset in 326 ms.
Product exploration explored 100000 steps with 19452 reset in 186 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19558 reset in 156 ms.
Product exploration explored 100000 steps with 19426 reset in 157 ms.
[2021-05-09 08:04:22] [INFO ] Flatten gal took : 10 ms
[2021-05-09 08:04:22] [INFO ] Flatten gal took : 27 ms
[2021-05-09 08:04:22] [INFO ] Time to serialize gal into /tmp/LTL15913184146008236122.gal : 10 ms
[2021-05-09 08:04:22] [INFO ] Time to serialize properties into /tmp/LTL14046452518907358646.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/LTL15913184146008236122.gal, -t, CGAL, -LTL, /tmp/LTL14046452518907358646.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/LTL15913184146008236122.gal -t CGAL -LTL /tmp/LTL14046452518907358646.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p45==0)||(p98==1))"))))
Formula 0 simplified : !GF"((p45==0)||(p98==1))"
Reverse transition relation is NOT exact ! Due to transitions t239.t240.t1.t241, t207.t209.t210.t2.t211, t204.t205.t3.t211, t201.t202.t4.t211, t198.t199.t5.t211, t40.t41.t6, t28.t30.t31.t7, t25.t26.t8, t22.t23.t9, t19.t20.t10, t56.t159.t160.t420.t293.t294.t66, t47.t156.t157.t272.t407.t275.t276.t66, t93.t334.t195.t196.t66, t90.t329.t195.t196.t66, t87.t324.t195.t196.t66, t257.t252, t257.t258.t259, t68.t169.t171.t174.t175.t176.t180.t184.t188.t192.t212.t216.t220.t224.t228.t232.t236.t242.t246.t250.t261.t267.t271.t277.t282.t286.t291.t262.t251.t260.t254.t255.t69.t72.t75.t79.t82.t85.t88.t91.t94.t97.t100.t103.t106.t109.t112.t115.t118.t121.t124.t128.t131.t134.t137.t140.t143.t146.t149.t152.t155.t158.t161.t164.t167.t165.t162.t153.t150.t147.t144.t141.t138.t135.t132.t129.t122.t119.t116.t113.t110.t107.t104.t101.t98.t95.t92.t89.t86.t83.t80.t73.t70.t252, t68.t169.t171.t174.t175.t176.t180.t184.t188.t192.t212.t216.t220.t224.t228.t232.t236.t242.t246.t250.t261.t267.t271.t277.t282.t286.t291.t262.t251.t260.t254.t255.t69.t72.t75.t79.t82.t85.t88.t91.t94.t97.t100.t103.t106.t109.t112.t115.t118.t121.t124.t128.t131.t134.t137.t140.t143.t146.t149.t152.t155.t158.t161.t164.t167.t165.t162.t153.t150.t147.t144.t141.t138.t135.t132.t129.t122.t119.t116.t113.t110.t107.t104.t101.t98.t95.t92.t89.t86.t83.t80.t73.t70.t258.t259, t397.t254.t255.t66.t252, t397.t254.t255.t66.t258.t259, t398.t254.t255.t66.t252, t398.t254.t255.t66.t258.t259, t399.t254.t255.t66.t252, t399.t254.t255.t66.t258.t259, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/78/25/139
Computing Next relation with stutter on 1215 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
655 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.58627,183028,1,0,172,649957,271,92,6031,348632,265
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-16-03 finished in 8970 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(F(p1)) U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 423
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 474 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 474 transition count 419
Applied a total of 22 rules in 88 ms. Remains 474 /485 variables (removed 11) and now considering 419/430 (removed 11) transitions.
// Phase 1: matrix 419 rows 474 cols
[2021-05-09 08:04:29] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:04:30] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 419 rows 474 cols
[2021-05-09 08:04:30] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 08:04:30] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
// Phase 1: matrix 419 rows 474 cols
[2021-05-09 08:04:30] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:04:31] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/485 places, 419/430 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-16-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s392 0) (EQ s323 1)), p2:(OR (EQ s106 0) (EQ s398 1)), p1:(OR (EQ s91 0) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1405 reset in 181 ms.
Product exploration explored 100000 steps with 1408 reset in 199 ms.
Graph (complete) has 1088 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Product exploration explored 100000 steps with 1396 reset in 175 ms.
Product exploration explored 100000 steps with 1410 reset in 169 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Support contains 6 out of 474 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 211 edges and 474 vertex of which 6 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
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 469 transition count 413
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 97 Pre rules applied. Total rules applied 44 place count 469 transition count 629
Deduced a syphon composed of 140 places in 2 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 141 place count 469 transition count 629
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 154 place count 456 transition count 583
Deduced a syphon composed of 127 places in 2 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 167 place count 456 transition count 583
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 257 places in 1 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 297 place count 456 transition count 583
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 328 place count 425 transition count 552
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 359 place count 425 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 360 place count 425 transition count 564
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 361 place count 424 transition count 562
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 362 place count 424 transition count 562
Deduced a syphon composed of 226 places in 0 ms
Applied a total of 362 rules in 277 ms. Remains 424 /474 variables (removed 50) and now considering 562/419 (removed -143) transitions.
[2021-05-09 08:04:33] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 562 rows 424 cols
[2021-05-09 08:04:33] [INFO ] Computed 95 place invariants in 15 ms
[2021-05-09 08:04:33] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 424/474 places, 562/419 transitions.
Product exploration explored 100000 steps with 17649 reset in 890 ms.
Product exploration explored 100000 steps with 17635 reset in 776 ms.
[2021-05-09 08:04:35] [INFO ] Flatten gal took : 31 ms
[2021-05-09 08:04:35] [INFO ] Flatten gal took : 26 ms
[2021-05-09 08:04:35] [INFO ] Time to serialize gal into /tmp/LTL15744474105060672737.gal : 5 ms
[2021-05-09 08:04:35] [INFO ] Time to serialize properties into /tmp/LTL4957788450357109730.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/LTL15744474105060672737.gal, -t, CGAL, -LTL, /tmp/LTL4957788450357109730.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/LTL15744474105060672737.gal -t CGAL -LTL /tmp/LTL4957788450357109730.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p493==0)||(p389==1))"))||(X((G(F("((p118==0)||(p168==1))")))U(G("((p133==0)||(p511==1))"))))))
Formula 0 simplified : !(G"((p493==0)||(p389==1))" | X(GF"((p118==0)||(p168==1))" U G"((p133==0)||(p511==1))"))
Detected timeout of ITS tools.
[2021-05-09 08:04:50] [INFO ] Flatten gal took : 39 ms
[2021-05-09 08:04:50] [INFO ] Applying decomposition
[2021-05-09 08:04:50] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14357567578133692764.txt, -o, /tmp/graph14357567578133692764.bin, -w, /tmp/graph14357567578133692764.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/graph14357567578133692764.bin, -l, -1, -v, -w, /tmp/graph14357567578133692764.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:04:50] [INFO ] Decomposing Gal with order
[2021-05-09 08:04:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:04:50] [INFO ] Removed a total of 279 redundant transitions.
[2021-05-09 08:04:50] [INFO ] Flatten gal took : 75 ms
[2021-05-09 08:04:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 24 ms.
[2021-05-09 08:04:50] [INFO ] Time to serialize gal into /tmp/LTL398213589088221704.gal : 9 ms
[2021-05-09 08:04:50] [INFO ] Time to serialize properties into /tmp/LTL15144855872350894189.ltl : 6 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/LTL398213589088221704.gal, -t, CGAL, -LTL, /tmp/LTL15144855872350894189.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/LTL398213589088221704.gal -t CGAL -LTL /tmp/LTL15144855872350894189.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i16.u131.p493==0)||(i2.i1.u114.p389==1))"))||(X((G(F("((i7.i0.u34.p118==0)||(i11.i0.u51.p168==1))")))U(G("((i1.u40.p133==0)||(i18.u134.p511==1))"))))))
Formula 0 simplified : !(G"((i16.u131.p493==0)||(i2.i1.u114.p389==1))" | X(GF"((i7.i0.u34.p118==0)||(i11.i0.u51.p168==1))" U G"((i1.u40.p133==0)||(i18.u134.p511==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8740183910321628425
[2021-05-09 08:05:05] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8740183910321628425
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/ltsmin8740183910321628425]
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/ltsmin8740183910321628425] 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/ltsmin8740183910321628425] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-16-05 finished in 36969 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 229 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 479 transition count 371
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 427 transition count 371
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 105 place count 427 transition count 269
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 326 place count 308 transition count 269
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 335 place count 299 transition count 260
Iterating global reduction 2 with 9 rules applied. Total rules applied 344 place count 299 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 299 transition count 259
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 346 place count 298 transition count 259
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 601 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 603 place count 167 transition count 138
Applied a total of 603 rules in 33 ms. Remains 167 /485 variables (removed 318) and now considering 138/430 (removed 292) transitions.
// Phase 1: matrix 138 rows 167 cols
[2021-05-09 08:05:06] [INFO ] Computed 73 place invariants in 3 ms
[2021-05-09 08:05:06] [INFO ] Implicit Places using invariants in 177 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 191 ms to find 20 implicit places.
[2021-05-09 08:05:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 138 rows 147 cols
[2021-05-09 08:05:06] [INFO ] Computed 53 place invariants in 8 ms
[2021-05-09 08:05:07] [INFO ] Dead Transitions using invariants and state equation in 345 ms returned []
Starting structural reductions, iteration 1 : 147/485 places, 138/430 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:05:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 147 cols
[2021-05-09 08:05:07] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-09 08:05:07] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 2 iterations. Remains : 147/485 places, 138/430 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-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}]], initial=1, aps=[p0:(NEQ s44 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-16-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-06 finished in 779 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X((G(F(p1))&&(p1 U (p2||F(p3)||G(p1)))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 423
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 475 transition count 420
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 475 transition count 420
Applied a total of 20 rules in 27 ms. Remains 475 /485 variables (removed 10) and now considering 420/430 (removed 10) transitions.
// Phase 1: matrix 420 rows 475 cols
[2021-05-09 08:05:07] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:05:07] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 420 rows 475 cols
[2021-05-09 08:05:07] [INFO ] Computed 95 place invariants in 5 ms
[2021-05-09 08:05:08] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 475 cols
[2021-05-09 08:05:08] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 08:05:08] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 475/485 places, 420/430 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-16-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (NEQ s148 0) (NEQ s425 1)), p1:(AND (NEQ s148 0) (NEQ s425 1)), p2:(AND (NEQ s375 0) (NEQ s305 1)), p3:(AND (NEQ s429 0) (NEQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-08 finished in 1002 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 476 transition count 421
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 476 transition count 421
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 471 transition count 416
Applied a total of 28 rules in 43 ms. Remains 471 /485 variables (removed 14) and now considering 416/430 (removed 14) transitions.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:05:08] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:05:08] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:05:08] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:05:09] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:05:09] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 08:05:09] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Finished structural reductions, in 1 iterations. Remains : 471/485 places, 416/430 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-16-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(NEQ s129 1), p0:(AND (NEQ s201 0) (NEQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Product exploration explored 100000 steps with 33333 reset in 223 ms.
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 213 edges and 471 vertex of which 6 / 471 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 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 466 transition count 410
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 95 Pre rules applied. Total rules applied 46 place count 466 transition count 623
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 141 place count 466 transition count 623
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 154 place count 453 transition count 577
Deduced a syphon composed of 127 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 167 place count 453 transition count 577
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 260 places in 1 ms
Iterating global reduction 1 with 133 rules applied. Total rules applied 300 place count 453 transition count 577
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 333 place count 420 transition count 544
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 366 place count 420 transition count 544
Deduced a syphon composed of 227 places in 1 ms
Applied a total of 366 rules in 119 ms. Remains 420 /471 variables (removed 51) and now considering 544/416 (removed -128) transitions.
[2021-05-09 08:05:11] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 544 rows 420 cols
[2021-05-09 08:05:11] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:05:11] [INFO ] Dead Transitions using invariants and state equation in 405 ms returned []
Finished structural reductions, in 1 iterations. Remains : 420/471 places, 544/416 transitions.
Product exploration explored 100000 steps with 33333 reset in 1115 ms.
Product exploration explored 100000 steps with 33333 reset in 1120 ms.
[2021-05-09 08:05:13] [INFO ] Flatten gal took : 23 ms
[2021-05-09 08:05:13] [INFO ] Flatten gal took : 23 ms
[2021-05-09 08:05:13] [INFO ] Time to serialize gal into /tmp/LTL13193231485637361672.gal : 3 ms
[2021-05-09 08:05:13] [INFO ] Time to serialize properties into /tmp/LTL11252742913881814453.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/LTL13193231485637361672.gal, -t, CGAL, -LTL, /tmp/LTL11252742913881814453.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/LTL13193231485637361672.gal -t CGAL -LTL /tmp/LTL11252742913881814453.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(p156!=1)"))||("((p236!=0)&&(p177!=1))")))))
Formula 0 simplified : !XX("((p236!=0)&&(p177!=1))" | F"(p156!=1)")
Detected timeout of ITS tools.
[2021-05-09 08:05:28] [INFO ] Flatten gal took : 13 ms
[2021-05-09 08:05:28] [INFO ] Applying decomposition
[2021-05-09 08:05:28] [INFO ] Flatten gal took : 12 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/graph5327494602393807688.txt, -o, /tmp/graph5327494602393807688.bin, -w, /tmp/graph5327494602393807688.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/graph5327494602393807688.bin, -l, -1, -v, -w, /tmp/graph5327494602393807688.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:05:28] [INFO ] Decomposing Gal with order
[2021-05-09 08:05:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:05:28] [INFO ] Removed a total of 283 redundant transitions.
[2021-05-09 08:05:28] [INFO ] Flatten gal took : 25 ms
[2021-05-09 08:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2021-05-09 08:05:28] [INFO ] Time to serialize gal into /tmp/LTL3858459808377054433.gal : 3 ms
[2021-05-09 08:05:28] [INFO ] Time to serialize properties into /tmp/LTL3702429679407971744.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/LTL3858459808377054433.gal, -t, CGAL, -LTL, /tmp/LTL3702429679407971744.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/LTL3858459808377054433.gal -t CGAL -LTL /tmp/LTL3702429679407971744.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(i2.u48.p156!=1)"))||("((i0.i0.u76.p236!=0)&&(i16.i2.u67.p177!=1))")))))
Formula 0 simplified : !XX("((i0.i0.u76.p236!=0)&&(i16.i2.u67.p177!=1))" | F"(i2.u48.p156!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16707695105793812111
[2021-05-09 08:05:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16707695105793812111
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/ltsmin16707695105793812111]
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/ltsmin16707695105793812111] 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/ltsmin16707695105793812111] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-16-11 finished in 36530 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 422
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 422
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 472 transition count 417
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 472 transition count 417
Applied a total of 26 rules in 66 ms. Remains 472 /485 variables (removed 13) and now considering 417/430 (removed 13) transitions.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:05:45] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:05:45] [INFO ] Implicit Places using invariants in 589 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:05:45] [INFO ] Computed 95 place invariants in 4 ms
[2021-05-09 08:05:46] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2021-05-09 08:05:46] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-09 08:05:46] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/485 places, 417/430 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s82 0) (EQ s253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Graph (complete) has 1084 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 472/472 places, 417/417 transitions.
Graph (trivial) has 215 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 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 467 transition count 411
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 96 Pre rules applied. Total rules applied 46 place count 467 transition count 630
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 142 place count 467 transition count 630
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 156 place count 453 transition count 580
Deduced a syphon composed of 127 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 170 place count 453 transition count 580
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 1 with 135 rules applied. Total rules applied 305 place count 453 transition count 580
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 338 place count 420 transition count 547
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 371 place count 420 transition count 547
Deduced a syphon composed of 229 places in 1 ms
Applied a total of 371 rules in 66 ms. Remains 420 /472 variables (removed 52) and now considering 547/417 (removed -130) transitions.
[2021-05-09 08:05:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 547 rows 420 cols
[2021-05-09 08:05:48] [INFO ] Computed 95 place invariants in 7 ms
[2021-05-09 08:05:48] [INFO ] Dead Transitions using invariants and state equation in 548 ms returned []
Finished structural reductions, in 1 iterations. Remains : 420/472 places, 547/417 transitions.
Product exploration explored 100000 steps with 50000 reset in 1398 ms.
Product exploration explored 100000 steps with 50000 reset in 1321 ms.
[2021-05-09 08:05:51] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:05:51] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:05:51] [INFO ] Time to serialize gal into /tmp/LTL7546696094882285708.gal : 2 ms
[2021-05-09 08:05:51] [INFO ] Time to serialize properties into /tmp/LTL10074628863418555033.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/LTL7546696094882285708.gal, -t, CGAL, -LTL, /tmp/LTL10074628863418555033.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/LTL7546696094882285708.gal -t CGAL -LTL /tmp/LTL10074628863418555033.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p103==0)||(p297==1))"))))
Formula 0 simplified : !XF"((p103==0)||(p297==1))"
Detected timeout of ITS tools.
[2021-05-09 08:06:06] [INFO ] Flatten gal took : 32 ms
[2021-05-09 08:06:06] [INFO ] Applying decomposition
[2021-05-09 08:06:06] [INFO ] Flatten gal took : 23 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/graph6091723387520880382.txt, -o, /tmp/graph6091723387520880382.bin, -w, /tmp/graph6091723387520880382.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/graph6091723387520880382.bin, -l, -1, -v, -w, /tmp/graph6091723387520880382.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:06:06] [INFO ] Decomposing Gal with order
[2021-05-09 08:06:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:06:06] [INFO ] Removed a total of 281 redundant transitions.
[2021-05-09 08:06:06] [INFO ] Flatten gal took : 61 ms
[2021-05-09 08:06:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2021-05-09 08:06:06] [INFO ] Time to serialize gal into /tmp/LTL5516166125311513395.gal : 9 ms
[2021-05-09 08:06:06] [INFO ] Time to serialize properties into /tmp/LTL199194757901401307.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/LTL5516166125311513395.gal, -t, CGAL, -LTL, /tmp/LTL199194757901401307.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/LTL5516166125311513395.gal -t CGAL -LTL /tmp/LTL199194757901401307.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i9.u32.p103==0)||(i15.i2.u96.p297==1))"))))
Formula 0 simplified : !XF"((i9.u32.p103==0)||(i15.i2.u96.p297==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8547269323839378227
[2021-05-09 08:06:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8547269323839378227
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/ltsmin8547269323839378227]
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/ltsmin8547269323839378227] 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/ltsmin8547269323839378227] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-16-12 finished in 37821 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (X(p1)||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 476 transition count 421
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 476 transition count 421
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 471 transition count 416
Applied a total of 28 rules in 57 ms. Remains 471 /485 variables (removed 14) and now considering 416/430 (removed 14) transitions.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:06:22] [INFO ] Computed 95 place invariants in 5 ms
[2021-05-09 08:06:23] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:06:23] [INFO ] Computed 95 place invariants in 3 ms
[2021-05-09 08:06:23] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2021-05-09 08:06:23] [INFO ] Computed 95 place invariants in 5 ms
[2021-05-09 08:06:23] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 471/485 places, 416/430 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, p0]
Running random walk in product with property : BusinessProcesses-PT-16-13 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s438 1), p1:(NEQ s438 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 668 reset in 141 ms.
Product exploration explored 100000 steps with 669 reset in 165 ms.
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, p0]
Product exploration explored 100000 steps with 667 reset in 204 ms.
Product exploration explored 100000 steps with 665 reset in 258 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, p0]
Support contains 1 out of 471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 215 edges and 471 vertex of which 6 / 471 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 466 transition count 410
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 95 Pre rules applied. Total rules applied 47 place count 466 transition count 628
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 142 place count 466 transition count 628
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 156 place count 452 transition count 578
Deduced a syphon composed of 127 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 170 place count 452 transition count 578
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 1 with 135 rules applied. Total rules applied 305 place count 452 transition count 578
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 339 place count 418 transition count 544
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 373 place count 418 transition count 544
Deduced a syphon composed of 228 places in 1 ms
Applied a total of 373 rules in 85 ms. Remains 418 /471 variables (removed 53) and now considering 544/416 (removed -128) transitions.
[2021-05-09 08:06:25] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 544 rows 418 cols
[2021-05-09 08:06:25] [INFO ] Computed 95 place invariants in 6 ms
[2021-05-09 08:06:25] [INFO ] Dead Transitions using invariants and state equation in 279 ms returned []
Finished structural reductions, in 1 iterations. Remains : 418/471 places, 544/416 transitions.
Product exploration explored 100000 steps with 25000 reset in 893 ms.
Product exploration explored 100000 steps with 25000 reset in 717 ms.
[2021-05-09 08:06:27] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:06:27] [INFO ] Flatten gal took : 10 ms
[2021-05-09 08:06:27] [INFO ] Time to serialize gal into /tmp/LTL17861065394273603971.gal : 1 ms
[2021-05-09 08:06:27] [INFO ] Time to serialize properties into /tmp/LTL15075499511641660368.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/LTL17861065394273603971.gal, -t, CGAL, -LTL, /tmp/LTL15075499511641660368.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/LTL17861065394273603971.gal -t CGAL -LTL /tmp/LTL15075499511641660368.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(p605==1)"))U((X("(p605!=0)"))||(G("(p605!=1)")))))
Formula 0 simplified : !(X"(p605==1)" U (X"(p605!=0)" | G"(p605!=1)"))
Detected timeout of ITS tools.
[2021-05-09 08:06:42] [INFO ] Flatten gal took : 11 ms
[2021-05-09 08:06:42] [INFO ] Applying decomposition
[2021-05-09 08:06:42] [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/graph17544585016952784048.txt, -o, /tmp/graph17544585016952784048.bin, -w, /tmp/graph17544585016952784048.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/graph17544585016952784048.bin, -l, -1, -v, -w, /tmp/graph17544585016952784048.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:06:42] [INFO ] Decomposing Gal with order
[2021-05-09 08:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:06:42] [INFO ] Removed a total of 286 redundant transitions.
[2021-05-09 08:06:42] [INFO ] Flatten gal took : 40 ms
[2021-05-09 08:06:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2021-05-09 08:06:42] [INFO ] Time to serialize gal into /tmp/LTL11201028859032556707.gal : 4 ms
[2021-05-09 08:06:42] [INFO ] Time to serialize properties into /tmp/LTL16967065791406305497.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/LTL11201028859032556707.gal, -t, CGAL, -LTL, /tmp/LTL16967065791406305497.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/LTL11201028859032556707.gal -t CGAL -LTL /tmp/LTL16967065791406305497.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i9.i1.u156.p605==1)"))U((X("(i9.i1.u156.p605!=0)"))||(G("(i9.i1.u156.p605!=1)")))))
Formula 0 simplified : !(X"(i9.i1.u156.p605==1)" U (X"(i9.i1.u156.p605!=0)" | G"(i9.i1.u156.p605!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t176, t250, t282, t291, t398, t399, t406, t408, t415, t421, t422, t424, i0.i0.t180, i0.i0.u72.t187, i0.i0.u74.t183, i0.i1.u107.t132, i0.i1.u109.t129, i1.u52.t215, i1.u70.t191, i2.u44.t231, i2.u46.t227, i3.u34.t249, i3.u36.t245, i3.u42.t235, i4.i0.u13.t296, i4.i0.u14.t297, i4.i1.u95.t167, i4.i1.u96.t165, i4.i1.u97.t162, i4.i1.u100.t153, i5.t286, i5.i0.u15.t294, i5.i1.u17.t289, i5.i1.u18.t288, i5.i2.u101.t150, i5.i2.u102.t147, i6.u103.t144, i6.u104.t141, i6.u105.t138, i6.u106.t135, i7.i0.u124.t83, i7.i0.u125.t80, i7.i0.u126.t76, i7.i0.u127.t73, i7.i1.u25.t270, i8.i0.u23.t276, i8.i2.u27.t266, i9.i0.t260, i9.i1.t6, i9.i1.u129.t66, i10.i0.u38.t241, i10.i1.u120.t95, i10.i2.u118.t101, i10.i2.u119.t98, i11.u48.t223, i11.u50.t219, i12.i0.u76.t179, i12.i0.u80.t170, i12.i0.u128.t70, i12.i1.u78.t173, i13.i0.u116.t107, i13.i0.u117.t104, i13.i1.u114.t113, i13.i1.u115.t110, i14.u110.t125, i14.u111.t122, i14.u112.t119, i14.u113.t116, i15.t277, i15.u19.t285, i15.u21.t280, i15.u22.t279, i16.t5, i16.t2, i16.i0.t3, i16.i0.t4, i16.i0.t195, i16.i0.u54.t211, i16.i0.u121.t92, i16.i1.u122.t89, i16.i2.u123.t86, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/290/85/411
Computing Next relation with stutter on 1215 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3729979093676175480
[2021-05-09 08:06:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3729979093676175480
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/ltsmin3729979093676175480]
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/ltsmin3729979093676175480] 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/ltsmin3729979093676175480] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-16-13 finished in 35669 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10719799786466408241
[2021-05-09 08:06:58] [INFO ] Applying decomposition
[2021-05-09 08:06:58] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2021-05-09 08:06:58] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:06:58] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2021-05-09 08:06:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:06:58] [INFO ] Flatten gal took : 25 ms
[2021-05-09 08:06:58] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2021-05-09 08:06:58] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:06:58] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10719799786466408241
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/ltsmin10719799786466408241]
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/graph4444478793471074478.txt, -o, /tmp/graph4444478793471074478.bin, -w, /tmp/graph4444478793471074478.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/graph4444478793471074478.bin, -l, -1, -v, -w, /tmp/graph4444478793471074478.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:06:58] [INFO ] Decomposing Gal with order
[2021-05-09 08:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:06:58] [INFO ] Removed a total of 282 redundant transitions.
[2021-05-09 08:06:58] [INFO ] Flatten gal took : 147 ms
[2021-05-09 08:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 46 ms.
[2021-05-09 08:06:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality13850529898971549868.gal : 5 ms
[2021-05-09 08:06:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality1950437181532619677.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/LTLCardinality13850529898971549868.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1950437181532619677.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/LTLCardinality13850529898971549868.gal -t CGAL -LTL /tmp/LTLCardinality1950437181532619677.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !(((G("((i3.u136.p493==0)||(i12.u117.p389==1))"))||(X((G(F("((i11.u37.p118==0)||(i8.u54.p168==1))")))U(G("((i7.u43.p133==0)||(i4.u139.p511==1))"))))))
Formula 0 simplified : !(G"((i3.u136.p493==0)||(i12.u117.p389==1))" | X(GF"((i11.u37.p118==0)||(i8.u54.p168==1))" U G"((i7.u43.p133==0)||(i4.u139.p511==1))"))
Compilation finished in 2470 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10719799786466408241]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X(([](<>((LTLAPp1==true))) U []((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X(([](<>((LTLAPp1==true))) U []((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
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(((LTLAPp3==true)||<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
LTSmin run took 181 ms.
FORMULA BusinessProcesses-PT-16-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
LTSmin run took 383 ms.
FORMULA BusinessProcesses-PT-16-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp6==true)) U (X((LTLAPp7==true))||[](!(LTLAPp6==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: LTL layer: formula: (X((LTLAPp6==true)) U (X((LTLAPp7==true))||[](!(LTLAPp6==true))))
pins2lts-mc-linux64( 1/ 8), 0.010: "(X((LTLAPp6==true)) U (X((LTLAPp7==true))||[](!(LTLAPp6==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.289: DFS-FIFO for weak LTL, using special progress label 439
pins2lts-mc-linux64( 0/ 8), 0.289: There are 440 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.289: State length is 486, there are 439 groups
pins2lts-mc-linux64( 0/ 8), 0.289: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.289: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.289: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.289: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.439: ~1 levels ~960 states ~4720 transitions
pins2lts-mc-linux64( 2/ 8), 0.456: ~1 levels ~1920 states ~11200 transitions
pins2lts-mc-linux64( 4/ 8), 0.474: ~1 levels ~3840 states ~20504 transitions
pins2lts-mc-linux64( 4/ 8), 0.521: ~1 levels ~7680 states ~47152 transitions
pins2lts-mc-linux64( 4/ 8), 0.618: ~1 levels ~15360 states ~96160 transitions
pins2lts-mc-linux64( 4/ 8), 0.829: ~1 levels ~30720 states ~216072 transitions
pins2lts-mc-linux64( 4/ 8), 1.217: ~1 levels ~61440 states ~442248 transitions
pins2lts-mc-linux64( 4/ 8), 2.121: ~1 levels ~122880 states ~976576 transitions
pins2lts-mc-linux64( 4/ 8), 4.372: ~1 levels ~245760 states ~2101960 transitions
pins2lts-mc-linux64( 7/ 8), 8.702: ~1 levels ~491520 states ~4600944 transitions
pins2lts-mc-linux64( 7/ 8), 17.884: ~1 levels ~983040 states ~10039320 transitions
pins2lts-mc-linux64( 7/ 8), 35.209: ~1 levels ~1966080 states ~20090296 transitions
pins2lts-mc-linux64( 7/ 8), 77.264: ~1 levels ~3932160 states ~42888960 transitions
pins2lts-mc-linux64( 4/ 8), 163.427: ~1 levels ~7864320 states ~91702776 transitions
pins2lts-mc-linux64( 4/ 8), 345.064: ~1 levels ~15728640 states ~193260720 transitions
pins2lts-mc-linux64( 4/ 8), 393.715: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 393.814:
pins2lts-mc-linux64( 0/ 8), 393.814: mean standard work distribution: 4.4% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 393.814:
pins2lts-mc-linux64( 0/ 8), 393.814: Explored 16677376 states 227952380 transitions, fanout: 13.668
pins2lts-mc-linux64( 0/ 8), 393.814: Total exploration time 393.520 sec (393.420 sec minimum, 393.480 sec on average)
pins2lts-mc-linux64( 0/ 8), 393.814: States per second: 42380, Transitions per second: 579265
pins2lts-mc-linux64( 0/ 8), 393.814:
pins2lts-mc-linux64( 0/ 8), 393.814: Progress states detected: 33713030
pins2lts-mc-linux64( 0/ 8), 393.814: Redundant explorations: -50.5315
pins2lts-mc-linux64( 0/ 8), 393.814:
pins2lts-mc-linux64( 0/ 8), 393.814: Queue width: 8B, total height: 28618639, memory: 218.34MB
pins2lts-mc-linux64( 0/ 8), 393.814: Tree memory: 513.2MB, 16.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 393.814: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 393.814: Stored 432 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 393.814: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 393.814: Est. total memory use: 731.6MB (~1242.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp6==true)) U (X((LTLAPp7==true))||[](!(LTLAPp6==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp6==true)) U (X((LTLAPp7==true))||[](!(LTLAPp6==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10719799786466408241]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t294, t374, t410, t430, t547, t556, t568, t570, t572, i0.i0.u129.t157, i0.i0.u130.t153, i0.i1.u77.t297, i0.i1.u81.t284, i0.i2.u79.t287, i1.u47.t351, i1.u49.t347, i2.i0.u25.t403, i2.i0.u27.t397, i3.t424, i3.t416, i3.u16.t428, i3.u17.t427, i3.u18.t423, i3.u106.t241, i3.u136.t114, i3.u136.t118, i4.t98, i4.t95, i4.t6, i4.u132.t147, i5.i0.u20.t414, i5.i0.u21.t413, i5.i1.t409, i5.i1.u23.t407, i6.t387, i6.t385, i6.t384, i6.u30.t391, i6.u34.t382, i7.u39.t365, i7.u43.t359, i7.u45.t355, i8.u51.t343, i8.u53.t339, i9.t335, i9.t3, i9.t2, i9.i0.t4, i9.i0.t5, i9.i0.u55.t314, i9.i0.u123.t177, i9.i0.u124.t173, i9.i1.u59.t317, i9.i1.u122.t181, i10.i0.u125.t169, i10.i0.u126.t165, i10.i1.t162, i10.i1.u128.t163, i11.u35.t373, i11.u37.t369, i12.u114.t213, i12.u115.t209, i12.u116.t205, i12.u117.t201, i13.i0.u109.t229, i13.i0.u112.t221, i13.i0.u113.t217, i13.i1.t226, i13.i1.u111.t227, i14.i0.t298, i14.i0.u73.t305, i14.i0.u75.t301, i14.i1.u107.t237, i14.i1.u108.t233, i15.i0.u14.t437, i15.i1.u102.t257, i15.i1.u103.t253, i16.i0.u12.t440, i16.i0.u13.t443, i16.i1.u96.t280, i16.i1.u97.t277, i16.i1.u98.t273, i16.i1.u101.t261, i17.i0.u71.t309, i17.i1.u104.t249, i17.i1.u105.t245, i18.i0.u121.t185, i18.i1.u118.t197, i18.i1.u119.t193, i18.i1.u120.t189, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/297/94/427
Computing Next relation with stutter on 1215 deadlock states
Detected timeout of ITS tools.
[2021-05-09 08:28:04] [INFO ] Applying decomposition
[2021-05-09 08:28:04] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:28:04] [INFO ] Decomposing Gal with order
[2021-05-09 08:28:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:28:04] [INFO ] Removed a total of 145 redundant transitions.
[2021-05-09 08:28:04] [INFO ] Flatten gal took : 40 ms
[2021-05-09 08:28:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 126 ms.
[2021-05-09 08:28:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality3867111964874191709.gal : 7 ms
[2021-05-09 08:28:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality7837061888916588093.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/LTLCardinality3867111964874191709.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7837061888916588093.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/LTLCardinality3867111964874191709.gal -t CGAL -LTL /tmp/LTLCardinality7837061888916588093.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((G("((i1.u206.p493==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u121.p389==1))"))||(X((G(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u40.p118==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u49.p168==1))")))U(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u44.p133==0)||(i1.u206.p511==1))"))))))
Formula 0 simplified : !(G"((i1.u206.p493==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u121.p389==1))" | X(GF"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u40.p118==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u49.p168==1))" U G"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u44.p133==0)||(i1.u206.p511==1))"))
Detected timeout of ITS tools.
[2021-05-09 08:49:11] [INFO ] Flatten gal took : 188 ms
[2021-05-09 08:49:12] [INFO ] Input system was already deterministic with 430 transitions.
[2021-05-09 08:49:12] [INFO ] Transformed 485 places.
[2021-05-09 08:49:12] [INFO ] Transformed 430 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 08:49:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality17488178729445590895.gal : 10 ms
[2021-05-09 08:49:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality10006661323366227523.ltl : 7 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/LTLCardinality17488178729445590895.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10006661323366227523.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality17488178729445590895.gal -t CGAL -LTL /tmp/LTLCardinality10006661323366227523.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p493==0)||(p389==1))"))||(X((G(F("((p118==0)||(p168==1))")))U(G("((p133==0)||(p511==1))"))))))
Formula 0 simplified : !(G"((p493==0)||(p389==1))" | X(GF"((p118==0)||(p168==1))" U G"((p133==0)||(p511==1))"))

BK_TIME_CONFINEMENT_REACHED

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

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