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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 161K 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-17-00
FORMULA_NAME BusinessProcesses-PT-17-01
FORMULA_NAME BusinessProcesses-PT-17-02
FORMULA_NAME BusinessProcesses-PT-17-03
FORMULA_NAME BusinessProcesses-PT-17-04
FORMULA_NAME BusinessProcesses-PT-17-05
FORMULA_NAME BusinessProcesses-PT-17-06
FORMULA_NAME BusinessProcesses-PT-17-07
FORMULA_NAME BusinessProcesses-PT-17-08
FORMULA_NAME BusinessProcesses-PT-17-09
FORMULA_NAME BusinessProcesses-PT-17-10
FORMULA_NAME BusinessProcesses-PT-17-11
FORMULA_NAME BusinessProcesses-PT-17-12
FORMULA_NAME BusinessProcesses-PT-17-13
FORMULA_NAME BusinessProcesses-PT-17-14
FORMULA_NAME BusinessProcesses-PT-17-15

=== Now, execution of the tool begins

BK_START 1620548254647

Running Version 0
[2021-05-09 08:17:36] [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:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:17:36] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-09 08:17:36] [INFO ] Transformed 650 places.
[2021-05-09 08:17:36] [INFO ] Transformed 580 transitions.
[2021-05-09 08:17:36] [INFO ] Found NUPN structural information;
[2021-05-09 08:17:36] [INFO ] Parsed PT model containing 650 places and 580 transitions in 152 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:17:36] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 87 place count 559 transition count 492
Iterating global reduction 1 with 84 rules applied. Total rules applied 171 place count 559 transition count 492
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 214 place count 516 transition count 449
Iterating global reduction 1 with 43 rules applied. Total rules applied 257 place count 516 transition count 449
Applied a total of 257 rules in 118 ms. Remains 516 /646 variables (removed 130) and now considering 449/576 (removed 127) transitions.
// Phase 1: matrix 449 rows 516 cols
[2021-05-09 08:17:37] [INFO ] Computed 105 place invariants in 22 ms
[2021-05-09 08:17:37] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 449 rows 516 cols
[2021-05-09 08:17:37] [INFO ] Computed 105 place invariants in 10 ms
[2021-05-09 08:17:37] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
// Phase 1: matrix 449 rows 516 cols
[2021-05-09 08:17:37] [INFO ] Computed 105 place invariants in 6 ms
[2021-05-09 08:17:38] [INFO ] Dead Transitions using invariants and state equation in 314 ms returned []
Finished structural reductions, in 1 iterations. Remains : 516/646 places, 449/576 transitions.
[2021-05-09 08:17:38] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 08:17:38] [INFO ] Flatten gal took : 67 ms
FORMULA BusinessProcesses-PT-17-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:17:38] [INFO ] Flatten gal took : 31 ms
[2021-05-09 08:17:38] [INFO ] Input system was already deterministic with 449 transitions.
Incomplete random walk after 100000 steps, including 659 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 11) seen :4
Running SMT prover for 7 properties.
// Phase 1: matrix 449 rows 516 cols
[2021-05-09 08:17:38] [INFO ] Computed 105 place invariants in 8 ms
[2021-05-09 08:17:38] [INFO ] [Real]Absence check using 59 positive place invariants in 12 ms returned sat
[2021-05-09 08:17:38] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 8 ms returned sat
[2021-05-09 08:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:39] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 6 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 9 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2021-05-09 08:17:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 724 ms
[2021-05-09 08:17:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:39] [INFO ] [Nat]Absence check using 59 positive place invariants in 13 ms returned sat
[2021-05-09 08:17:39] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 8 ms returned sat
[2021-05-09 08:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:40] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2021-05-09 08:17:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 544 ms
[2021-05-09 08:17:40] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-09 08:17:42] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2021-05-09 08:17:42] [INFO ] Added : 329 causal constraints over 66 iterations in 1995 ms. Result :sat
[2021-05-09 08:17:42] [INFO ] [Real]Absence check using 59 positive place invariants in 26 ms returned sat
[2021-05-09 08:17:42] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:42] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 872 ms
[2021-05-09 08:17:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:43] [INFO ] [Nat]Absence check using 59 positive place invariants in 23 ms returned sat
[2021-05-09 08:17:43] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:44] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2021-05-09 08:17:44] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:17:45] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:17:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1012 ms
[2021-05-09 08:17:45] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-09 08:17:46] [INFO ] Added : 287 causal constraints over 58 iterations in 1837 ms. Result :sat
[2021-05-09 08:17:47] [INFO ] [Real]Absence check using 59 positive place invariants in 18 ms returned sat
[2021-05-09 08:17:47] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:47] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:17:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:47] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2021-05-09 08:17:47] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:47] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-09 08:17:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:17:47] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:17:47] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:17:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:17:47] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:17:47] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1202 ms
[2021-05-09 08:17:48] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 34 ms.
[2021-05-09 08:17:50] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:17:50] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:17:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2021-05-09 08:17:50] [INFO ] Added : 297 causal constraints over 60 iterations in 2112 ms. Result :sat
[2021-05-09 08:17:50] [INFO ] [Real]Absence check using 59 positive place invariants in 25 ms returned sat
[2021-05-09 08:17:50] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:51] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-09 08:17:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:51] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2021-05-09 08:17:51] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:51] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:17:51] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 12 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1065 ms
[2021-05-09 08:17:52] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 42 ms.
[2021-05-09 08:17:54] [INFO ] Added : 298 causal constraints over 60 iterations in 1873 ms. Result :sat
[2021-05-09 08:17:54] [INFO ] [Real]Absence check using 59 positive place invariants in 23 ms returned sat
[2021-05-09 08:17:54] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:54] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-09 08:17:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:54] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2021-05-09 08:17:54] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:54] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:17:56] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2903 ms
[2021-05-09 08:17:57] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:17:59] [INFO ] Added : 316 causal constraints over 64 iterations in 1635 ms. Result :sat
[2021-05-09 08:17:59] [INFO ] [Real]Absence check using 59 positive place invariants in 23 ms returned sat
[2021-05-09 08:17:59] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 14 ms returned sat
[2021-05-09 08:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:59] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-09 08:17:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:59] [INFO ] [Nat]Absence check using 59 positive place invariants in 20 ms returned sat
[2021-05-09 08:17:59] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:00] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:18:00] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2021-05-09 08:18:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1406 ms
[2021-05-09 08:18:01] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-09 08:18:03] [INFO ] Added : 314 causal constraints over 63 iterations in 1673 ms. Result :sat
[2021-05-09 08:18:03] [INFO ] [Real]Absence check using 59 positive place invariants in 33 ms returned sat
[2021-05-09 08:18:03] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:03] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-09 08:18:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 17 ms returned sat
[2021-05-09 08:18:03] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:03] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-09 08:18:03] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:18:03] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:18:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2021-05-09 08:18:03] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:18:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:18:04] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:18:04] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:18:04] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 4 ms to minimize.
[2021-05-09 08:18:04] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:18:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 616 ms
[2021-05-09 08:18:04] [INFO ] Computed and/alt/rep : 443/915/443 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-09 08:18:06] [INFO ] Added : 330 causal constraints over 66 iterations in 1776 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 506 transition count 439
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 506 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 503 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 503 transition count 436
Applied a total of 26 rules in 53 ms. Remains 503 /516 variables (removed 13) and now considering 436/449 (removed 13) transitions.
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:18:06] [INFO ] Computed 105 place invariants in 11 ms
[2021-05-09 08:18:06] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:18:06] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:18:06] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:18:06] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:18:07] [INFO ] Dead Transitions using invariants and state equation in 265 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/516 places, 436/449 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-17-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s64 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-17-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-01 finished in 1412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 242 edges and 516 vertex of which 6 / 516 are part of one of the 1 SCC in 6 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 510 transition count 383
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 451 transition count 383
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 119 place count 451 transition count 276
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 352 place count 325 transition count 276
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 361 place count 316 transition count 267
Iterating global reduction 2 with 9 rules applied. Total rules applied 370 place count 316 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 370 place count 316 transition count 266
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 372 place count 315 transition count 266
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 641 place count 178 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 643 place count 177 transition count 138
Applied a total of 643 rules in 117 ms. Remains 177 /516 variables (removed 339) and now considering 138/449 (removed 311) transitions.
// Phase 1: matrix 138 rows 177 cols
[2021-05-09 08:18:07] [INFO ] Computed 81 place invariants in 0 ms
[2021-05-09 08:18:07] [INFO ] Implicit Places using invariants in 125 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 126 ms to find 23 implicit places.
[2021-05-09 08:18:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 138 rows 154 cols
[2021-05-09 08:18:07] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:18:07] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 154/516 places, 138/449 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:18:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 138 rows 154 cols
[2021-05-09 08:18:07] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 08:18:07] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 154/516 places, 138/449 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-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:(NEQ s106 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 21743 reset in 471 ms.
Product exploration explored 100000 steps with 21726 reset in 259 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21601 reset in 172 ms.
Product exploration explored 100000 steps with 21633 reset in 217 ms.
[2021-05-09 08:18:09] [INFO ] Flatten gal took : 30 ms
[2021-05-09 08:18:09] [INFO ] Flatten gal took : 26 ms
[2021-05-09 08:18:09] [INFO ] Time to serialize gal into /tmp/LTL3462889425078422664.gal : 7 ms
[2021-05-09 08:18:09] [INFO ] Time to serialize properties into /tmp/LTL12169313843776329363.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/LTL3462889425078422664.gal, -t, CGAL, -LTL, /tmp/LTL12169313843776329363.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/LTL3462889425078422664.gal -t CGAL -LTL /tmp/LTL12169313843776329363.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p494!=1)"))))
Formula 0 simplified : !GF"(p494!=1)"
Reverse transition relation is NOT exact ! Due to transitions t442, t267.t269.t270.t0.t271, t264.t265.t1.t271, t261.t262.t2.t271, t257.t258.t3.t259, t212.t214.t215.t5.t216, t49.t51.t52.t6, t46.t47.t7, t43.t44.t8, t39.t40.t9.t41, t22.t24.t25.t10, t55.t155.t156.t291.t322.t433.t292.t293.t69, t159.t384.t255.t271.t69, t144.t379.t255.t271.t69, t141.t374.t255.t271.t69, t445.t177.t330.t178.t69, t71.t174.t176.t179.t180.t184.t189.t193.t197.t201.t205.t209.t217.t221.t225.t229.t237.t241.t245.t249.t253.t272.t276.t280.t290.t294.t299.t303.t281.t289.t230.t232.t72.t75.t78.t81.t85.t88.t91.t94.t98.t101.t105.t108.t111.t114.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t164.t161.t158.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t112.t109.t106.t99.t92.t89.t86.t79.t76.t73.t285.t286.t282, t71.t174.t176.t179.t180.t184.t189.t193.t197.t201.t205.t209.t217.t221.t225.t229.t237.t241.t245.t249.t253.t272.t276.t280.t290.t294.t299.t303.t281.t289.t230.t232.t72.t75.t78.t81.t85.t88.t91.t94.t98.t101.t105.t108.t111.t114.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t164.t161.t158.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t112.t109.t106.t99.t92.t89.t86.t79.t76.t73.t285.t286.t287.t288, t429.t69.t285.t286.t282, t429.t69.t285.t286.t287.t288, t430.t69.t285.t286.t282, t430.t69.t285.t286.t287.t288, t431.t69.t285.t286.t282, t431.t69.t285.t286.t287.t288, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/78/24/138
Computing Next relation with stutter on 1312 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
114 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.1787,55152,1,0,179,129352,269,94,6259,90756,268
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-17-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-17-03 finished in 3433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 243 edges and 516 vertex of which 6 / 516 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 510 transition count 383
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 451 transition count 383
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 119 place count 451 transition count 275
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 355 place count 323 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 364 place count 314 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 373 place count 314 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 373 place count 314 transition count 265
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 313 transition count 265
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 636 place count 180 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 638 place count 179 transition count 141
Applied a total of 638 rules in 77 ms. Remains 179 /516 variables (removed 337) and now considering 141/449 (removed 308) transitions.
// Phase 1: matrix 141 rows 179 cols
[2021-05-09 08:18:10] [INFO ] Computed 80 place invariants in 2 ms
[2021-05-09 08:18:11] [INFO ] Implicit Places using invariants in 152 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 153 ms to find 22 implicit places.
[2021-05-09 08:18:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 141 rows 157 cols
[2021-05-09 08:18:11] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 08:18:11] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 157/516 places, 141/449 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:18:11] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 141 rows 157 cols
[2021-05-09 08:18:11] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 08:18:11] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 2 iterations. Remains : 157/516 places, 141/449 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-05 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 (NEQ s39 0) (NEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 140 steps with 20 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-05 finished in 583 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 506 transition count 439
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 506 transition count 439
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 502 transition count 435
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 502 transition count 435
Applied a total of 28 rules in 33 ms. Remains 502 /516 variables (removed 14) and now considering 435/449 (removed 14) transitions.
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:18:11] [INFO ] Computed 105 place invariants in 4 ms
[2021-05-09 08:18:11] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:18:11] [INFO ] Computed 105 place invariants in 4 ms
[2021-05-09 08:18:12] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:18:12] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:18:12] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Finished structural reductions, in 1 iterations. Remains : 502/516 places, 435/449 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-17-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s219 1), p0:(EQ s219 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7658 steps with 49 reset in 23 ms.
FORMULA BusinessProcesses-PT-17-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-06 finished in 1166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 238 edges and 516 vertex of which 4 / 516 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 512 transition count 387
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 454 transition count 387
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 117 place count 454 transition count 279
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 353 place count 326 transition count 279
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 361 place count 318 transition count 271
Iterating global reduction 2 with 8 rules applied. Total rules applied 369 place count 318 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 369 place count 318 transition count 270
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 371 place count 317 transition count 270
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 640 place count 180 transition count 138
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 642 place count 179 transition count 142
Applied a total of 642 rules in 35 ms. Remains 179 /516 variables (removed 337) and now considering 142/449 (removed 307) transitions.
// Phase 1: matrix 142 rows 179 cols
[2021-05-09 08:18:12] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-09 08:18:12] [INFO ] Implicit Places using invariants in 145 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 146 ms to find 22 implicit places.
[2021-05-09 08:18:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 157 cols
[2021-05-09 08:18:12] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:18:12] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 157/516 places, 142/449 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2021-05-09 08:18:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 157 cols
[2021-05-09 08:18:12] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 08:18:13] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 2 iterations. Remains : 157/516 places, 142/449 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s113 0) (EQ s102 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]]
Product exploration explored 100000 steps with 13503 reset in 255 ms.
Product exploration explored 100000 steps with 13372 reset in 293 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13569 reset in 254 ms.
Product exploration explored 100000 steps with 13523 reset in 253 ms.
[2021-05-09 08:18:14] [INFO ] Flatten gal took : 15 ms
[2021-05-09 08:18:14] [INFO ] Flatten gal took : 14 ms
[2021-05-09 08:18:14] [INFO ] Time to serialize gal into /tmp/LTL17219680938496257616.gal : 3 ms
[2021-05-09 08:18:14] [INFO ] Time to serialize properties into /tmp/LTL15794798160139036110.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/LTL17219680938496257616.gal, -t, CGAL, -LTL, /tmp/LTL15794798160139036110.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/LTL17219680938496257616.gal -t CGAL -LTL /tmp/LTL15794798160139036110.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p529==0)||(p468==1))")))
Formula 0 simplified : !G"((p529==0)||(p468==1))"
Reverse transition relation is NOT exact ! Due to transitions t37, t442, t267.t269.t270.t0.t271, t264.t265.t1.t271, t261.t262.t2.t271, t257.t258.t3.t259, t212.t214.t215.t5.t216, t49.t51.t52.t6, t46.t47.t7, t43.t44.t8, t39.t40.t9.t41, t22.t24.t25.t10, t55.t155.t156.t291.t322.t433.t292.t293.t69, t144.t379.t255.t271.t69, t141.t374.t255.t271.t69, t445.t177.t330.t178.t69, t71.t174.t176.t179.t180.t184.t189.t193.t197.t201.t205.t209.t217.t221.t225.t229.t237.t241.t245.t249.t253.t272.t276.t280.t290.t294.t299.t303.t281.t289.t230.t232.t72.t75.t78.t81.t85.t88.t91.t94.t98.t101.t105.t108.t111.t114.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t164.t161.t158.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t112.t109.t106.t99.t92.t89.t86.t79.t76.t73.t285.t286.t287.t288, t71.t174.t176.t179.t180.t184.t189.t193.t197.t201.t205.t209.t217.t221.t225.t229.t237.t241.t245.t249.t253.t272.t276.t280.t290.t294.t299.t303.t281.t289.t230.t232.t72.t75.t78.t81.t85.t88.t91.t94.t98.t101.t105.t108.t111.t114.t118.t121.t124.t127.t130.t133.t136.t139.t142.t145.t148.t151.t154.t157.t160.t163.t166.t169.t172.t170.t167.t164.t161.t158.t152.t149.t146.t143.t140.t137.t134.t131.t128.t125.t122.t119.t112.t109.t106.t99.t92.t89.t86.t79.t76.t73.t285.t286.t282, t429.t69.t285.t286.t287.t288, t429.t69.t285.t286.t282, t430.t69.t285.t286.t287.t288, t430.t69.t285.t286.t282, t431.t69.t285.t286.t287.t288, t431.t69.t285.t286.t282, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/82/24/142
Computing Next relation with stutter on 1312 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
205 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,2.09022,88176,1,0,328,255266,276,288,6308,295203,602
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-17-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-17-08 finished in 4049 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(F(p0))||(p1&&F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 507 transition count 440
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 507 transition count 440
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 504 transition count 437
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 504 transition count 437
Applied a total of 24 rules in 25 ms. Remains 504 /516 variables (removed 12) and now considering 437/449 (removed 12) transitions.
// Phase 1: matrix 437 rows 504 cols
[2021-05-09 08:18:16] [INFO ] Computed 105 place invariants in 5 ms
[2021-05-09 08:18:16] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 437 rows 504 cols
[2021-05-09 08:18:16] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-09 08:18:17] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
// Phase 1: matrix 437 rows 504 cols
[2021-05-09 08:18:17] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:18:17] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/516 places, 437/449 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-17-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s431 0) (EQ s372 1)), p0:(AND (NEQ s403 0) (NEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Graph (complete) has 1140 edges and 504 vertex of which 503 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 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 469 ms.
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 437/437 transitions.
Graph (trivial) has 226 edges and 504 vertex of which 6 / 504 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 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 499 transition count 431
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 103 Pre rules applied. Total rules applied 51 place count 499 transition count 664
Deduced a syphon composed of 153 places in 2 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 154 place count 499 transition count 664
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 171 place count 482 transition count 603
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 188 place count 482 transition count 603
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 276 places in 0 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 328 place count 482 transition count 603
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 362 place count 448 transition count 569
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 396 place count 448 transition count 569
Deduced a syphon composed of 242 places in 0 ms
Applied a total of 396 rules in 129 ms. Remains 448 /504 variables (removed 56) and now considering 569/437 (removed -132) transitions.
[2021-05-09 08:18:20] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 569 rows 448 cols
[2021-05-09 08:18:20] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-09 08:18:20] [INFO ] Dead Transitions using invariants and state equation in 310 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/504 places, 569/437 transitions.
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Product exploration explored 100000 steps with 50000 reset in 339 ms.
[2021-05-09 08:18:21] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:18:21] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:18:21] [INFO ] Time to serialize gal into /tmp/LTL14331411055906629225.gal : 5 ms
[2021-05-09 08:18:21] [INFO ] Time to serialize properties into /tmp/LTL13606282644668994701.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/LTL14331411055906629225.gal, -t, CGAL, -LTL, /tmp/LTL13606282644668994701.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/LTL14331411055906629225.gal -t CGAL -LTL /tmp/LTL13606282644668994701.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("((p467!=0)&&(p39!=1))")))||((F("((p467==0)||(p39==1))"))&&("((p534==0)||(p427==1))"))))))
Formula 0 simplified : !XF(XF"((p467!=0)&&(p39!=1))" | ("((p534==0)||(p427==1))" & F"((p467==0)||(p39==1))"))
Detected timeout of ITS tools.
[2021-05-09 08:18:36] [INFO ] Flatten gal took : 67 ms
[2021-05-09 08:18:36] [INFO ] Applying decomposition
[2021-05-09 08:18:36] [INFO ] Flatten gal took : 37 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/graph11408174853297109536.txt, -o, /tmp/graph11408174853297109536.bin, -w, /tmp/graph11408174853297109536.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/graph11408174853297109536.bin, -l, -1, -v, -w, /tmp/graph11408174853297109536.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:18:36] [INFO ] Decomposing Gal with order
[2021-05-09 08:18:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:18:36] [INFO ] Removed a total of 269 redundant transitions.
[2021-05-09 08:18:36] [INFO ] Flatten gal took : 98 ms
[2021-05-09 08:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 32 ms.
[2021-05-09 08:18:36] [INFO ] Time to serialize gal into /tmp/LTL1803417057816131812.gal : 20 ms
[2021-05-09 08:18:36] [INFO ] Time to serialize properties into /tmp/LTL2485343183697861094.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/LTL1803417057816131812.gal, -t, CGAL, -LTL, /tmp/LTL2485343183697861094.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/LTL1803417057816131812.gal -t CGAL -LTL /tmp/LTL2485343183697861094.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("((i16.u139.p467!=0)&&(i6.i0.u16.p39!=1))")))||((F("((i16.u139.p467==0)||(i6.i0.u16.p39==1))"))&&("((i15.i0.u115.p534==0)||(i12.i2.u131.p427==1))"))))))
Formula 0 simplified : !XF(XF"((i16.u139.p467!=0)&&(i6.i0.u16.p39!=1))" | ("((i15.i0.u115.p534==0)||(i12.i2.u131.p427==1))" & F"((i16.u139.p467==0)||(i6.i0.u16.p39==1))"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t180, t201, t280, t294, t303, t430, t431, t433, t434, t442, i0.i0.u86.t183, i0.i0.u137.t76, i0.i0.u138.t73, i0.i1.u90.t175, i0.i2.u88.t178, i1.t193, i1.i0.t184, i1.i0.t189, i1.i0.u78.t200, i1.i0.u82.t192, i1.i0.u84.t188, i1.i1.u80.t196, i1.i2.u135.t82, i1.i2.u136.t79, i2.i0.u66.t220, i2.i0.u68.t216, i3.u55.t240, i3.u62.t228, i3.u64.t224, i4.u29.t279, i4.u31.t275, i5.i0.u13.t311, i5.i0.u14.t310, i5.i1.u18.t302, i5.i1.u105.t172, i5.i1.u106.t170, i5.i1.u107.t167, i6.i0.t306, i6.i0.u15.t308, i6.i2.u108.t164, i6.i2.u109.t161, i7.t290, i7.u20.t297, i7.u21.t296, i7.u23.t293, i8.i0.u51.t248, i8.i0.u53.t244, i8.i1.u49.t252, i8.i1.u119.t131, i9.i0.u57.t236, i10.u124.t115, i10.u125.t112, i10.u126.t109, i10.u127.t106, i10.u128.t102, i11.u76.t204, i11.u133.t89, i11.u134.t86, i12.i0.u74.t208, i12.i1.u129.t99, i12.i1.u132.t92, i12.i2.t96, i12.i2.u130.t97, i13.u118.t134, i13.u120.t128, i13.u121.t125, i13.u122.t122, i13.u123.t119, i14.i0.t289, i14.i1.u114.t146, i14.i1.u117.t137, i14.i2.u112.t152, i14.i2.u113.t149, i15.t1, i15.t0, i15.i0.t2, i15.i0.t3, i15.i0.t255, i15.i0.u33.t271, i15.i0.u115.t143, i15.i0.u116.t140, i15.i1.u110.t158, i16.t10, i16.u139.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/311/88/435
Computing Next relation with stutter on 1312 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
672 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.79535,244940,1,0,423650,684,7071,928881,272,1531,1035222
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-17-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-17-09 finished in 28100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(G(p1))&&p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 507 transition count 440
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 507 transition count 440
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 503 transition count 436
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 503 transition count 436
Applied a total of 26 rules in 69 ms. Remains 503 /516 variables (removed 13) and now considering 436/449 (removed 13) transitions.
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:18:44] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-09 08:18:45] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:18:45] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:18:45] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:18:45] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-09 08:18:46] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/516 places, 436/449 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-17-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (NEQ s272 1) (NEQ s360 0) (NEQ s231 1)), p1:(AND (NEQ s83 0) (NEQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-13 finished in 1594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 516/516 places, 449/449 transitions.
Graph (trivial) has 241 edges and 516 vertex of which 6 / 516 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 510 transition count 384
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 452 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 451 transition count 383
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 119 place count 451 transition count 276
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 353 place count 324 transition count 276
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 361 place count 316 transition count 268
Iterating global reduction 3 with 8 rules applied. Total rules applied 369 place count 316 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 369 place count 316 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 371 place count 315 transition count 267
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 269 rules applied. Total rules applied 640 place count 178 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 3 with 2 rules applied. Total rules applied 642 place count 177 transition count 139
Applied a total of 642 rules in 50 ms. Remains 177 /516 variables (removed 339) and now considering 139/449 (removed 310) transitions.
// Phase 1: matrix 139 rows 177 cols
[2021-05-09 08:18:46] [INFO ] Computed 80 place invariants in 8 ms
[2021-05-09 08:18:46] [INFO ] Implicit Places using invariants in 140 ms returned [1, 2, 5, 6, 9, 10, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 141 ms to find 21 implicit places.
[2021-05-09 08:18:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 156 cols
[2021-05-09 08:18:46] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-09 08:18:46] [INFO ] Dead Transitions using invariants and state equation in 246 ms returned []
Starting structural reductions, iteration 1 : 156/516 places, 139/449 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:18:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 156 cols
[2021-05-09 08:18:46] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:18:46] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 2 iterations. Remains : 156/516 places, 139/449 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s75 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 78548 steps with 16916 reset in 144 ms.
FORMULA BusinessProcesses-PT-17-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-14 finished in 748 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620548327428

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

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