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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 91K 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-08-00
FORMULA_NAME BusinessProcesses-PT-08-01
FORMULA_NAME BusinessProcesses-PT-08-02
FORMULA_NAME BusinessProcesses-PT-08-03
FORMULA_NAME BusinessProcesses-PT-08-04
FORMULA_NAME BusinessProcesses-PT-08-05
FORMULA_NAME BusinessProcesses-PT-08-06
FORMULA_NAME BusinessProcesses-PT-08-07
FORMULA_NAME BusinessProcesses-PT-08-08
FORMULA_NAME BusinessProcesses-PT-08-09
FORMULA_NAME BusinessProcesses-PT-08-10
FORMULA_NAME BusinessProcesses-PT-08-11
FORMULA_NAME BusinessProcesses-PT-08-12
FORMULA_NAME BusinessProcesses-PT-08-13
FORMULA_NAME BusinessProcesses-PT-08-14
FORMULA_NAME BusinessProcesses-PT-08-15

=== Now, execution of the tool begins

BK_START 1620544510066

Running Version 0
[2021-05-09 07:15:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:15:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:15:11] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 07:15:11] [INFO ] Transformed 393 places.
[2021-05-09 07:15:11] [INFO ] Transformed 344 transitions.
[2021-05-09 07:15:11] [INFO ] Found NUPN structural information;
[2021-05-09 07:15:11] [INFO ] Parsed PT model containing 393 places and 344 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:15:11] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 69 place count 311 transition count 270
Iterating global reduction 1 with 61 rules applied. Total rules applied 130 place count 311 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 131 place count 311 transition count 269
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 166 place count 276 transition count 234
Iterating global reduction 2 with 35 rules applied. Total rules applied 201 place count 276 transition count 234
Applied a total of 201 rules in 70 ms. Remains 276 /380 variables (removed 104) and now considering 234/331 (removed 97) transitions.
// Phase 1: matrix 234 rows 276 cols
[2021-05-09 07:15:12] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-09 07:15:12] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 234 rows 276 cols
[2021-05-09 07:15:12] [INFO ] Computed 50 place invariants in 6 ms
[2021-05-09 07:15:12] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 276 cols
[2021-05-09 07:15:12] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:12] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 276/380 places, 234/331 transitions.
[2021-05-09 07:15:12] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 07:15:12] [INFO ] Flatten gal took : 48 ms
FORMULA BusinessProcesses-PT-08-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:15:12] [INFO ] Flatten gal took : 18 ms
[2021-05-09 07:15:12] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 100000 steps, including 862 resets, run finished after 212 ms. (steps per millisecond=471 ) properties (out of 24) seen :21
Running SMT prover for 3 properties.
// Phase 1: matrix 234 rows 276 cols
[2021-05-09 07:15:12] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:13] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-09 07:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:13] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 4 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 327 ms
[2021-05-09 07:15:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-09 07:15:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:13] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:15:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 221 ms
[2021-05-09 07:15:13] [INFO ] Computed and/alt/rep : 232/436/232 causal constraints (skipped 1 transitions) in 11 ms.
[2021-05-09 07:15:14] [INFO ] Added : 169 causal constraints over 34 iterations in 408 ms. Result :sat
[2021-05-09 07:15:14] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2021-05-09 07:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:14] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-09 07:15:14] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:15:14] [INFO ] Deduced a trap composed of 32 places in 20 ms of which 0 ms to minimize.
[2021-05-09 07:15:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2021-05-09 07:15:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-09 07:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:14] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-09 07:15:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:15:14] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:15:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2021-05-09 07:15:14] [INFO ] Computed and/alt/rep : 232/436/232 causal constraints (skipped 1 transitions) in 10 ms.
[2021-05-09 07:15:15] [INFO ] Added : 171 causal constraints over 35 iterations in 526 ms. Result :sat
[2021-05-09 07:15:15] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2021-05-09 07:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:15] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-09 07:15:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2021-05-09 07:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:15] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-09 07:15:15] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:15:15] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:15:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2021-05-09 07:15:15] [INFO ] Computed and/alt/rep : 232/436/232 causal constraints (skipped 1 transitions) in 9 ms.
[2021-05-09 07:15:15] [INFO ] Added : 168 causal constraints over 34 iterations in 490 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X(X(G(p0)))) U (!p0 U p1))||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 262 transition count 220
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 262 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 260 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 260 transition count 218
Applied a total of 32 rules in 38 ms. Remains 260 /276 variables (removed 16) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:16] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:16] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:16] [INFO ] Computed 50 place invariants in 7 ms
[2021-05-09 07:15:16] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:16] [INFO ] Computed 50 place invariants in 30 ms
[2021-05-09 07:15:16] [INFO ] Dead Transitions using invariants and state equation in 216 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/276 places, 218/234 transitions.
Stuttering acceptance computed with spot in 685 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-08-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s2 1), p0:(NEQ s34 1), p2:(EQ s37 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, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1017 reset in 407 ms.
Stack based approach found an accepted trace after 21114 steps with 218 reset with depth 5 and stack size 5 in 36 ms.
FORMULA BusinessProcesses-PT-08-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-00 finished in 1755 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Graph (trivial) has 144 edges and 276 vertex of which 6 / 276 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 270 transition count 192
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 235 transition count 192
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 71 place count 235 transition count 136
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 194 place count 168 transition count 136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 207 place count 155 transition count 123
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 221 place count 154 transition count 123
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 365 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 79 transition count 51
Applied a total of 367 rules in 43 ms. Remains 79 /276 variables (removed 197) and now considering 51/234 (removed 183) transitions.
// Phase 1: matrix 51 rows 79 cols
[2021-05-09 07:15:17] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 07:15:17] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 51 rows 79 cols
[2021-05-09 07:15:17] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 07:15:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 58, 60, 62]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 164 ms to find 17 implicit places.
[2021-05-09 07:15:17] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 51 rows 62 cols
[2021-05-09 07:15:17] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 07:15:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 62/276 places, 51/234 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 50
Applied a total of 2 rules in 9 ms. Remains 61 /62 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 61 cols
[2021-05-09 07:15:18] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-09 07:15:18] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 50 rows 61 cols
[2021-05-09 07:15:18] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 07:15:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 61/276 places, 50/234 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-08-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s41 1), p1:(EQ s32 0), p2:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-01 finished in 476 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&G(p1)&&F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 262 transition count 220
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 262 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 260 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 260 transition count 218
Applied a total of 32 rules in 28 ms. Remains 260 /276 variables (removed 16) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:18] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:18] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:18] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:18] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:18] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:18] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/276 places, 218/234 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) p0), true, true, true, true]
Running random walk in product with property : BusinessProcesses-PT-08-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(EQ s129 1), p0:(EQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-02 finished in 551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 261 transition count 219
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 261 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 259 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 259 transition count 217
Applied a total of 34 rules in 13 ms. Remains 259 /276 variables (removed 17) and now considering 217/234 (removed 17) transitions.
// Phase 1: matrix 217 rows 259 cols
[2021-05-09 07:15:18] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:18] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2021-05-09 07:15:18] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:19] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2021-05-09 07:15:19] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:19] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 259/276 places, 217/234 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s31 1) (NEQ s156 1) (NEQ s258 1)), p1:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Graph (complete) has 551 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 259 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 259/259 places, 217/217 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 259 transition count 217
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 30 place count 259 transition count 328
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 78 place count 259 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 252 transition count 303
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 252 transition count 303
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 155 places in 0 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 176 place count 252 transition count 303
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 198 place count 230 transition count 281
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 220 place count 230 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 221 place count 230 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 222 place count 230 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 223 place count 229 transition count 280
Deduced a syphon composed of 133 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 224 place count 229 transition count 280
Deduced a syphon composed of 133 places in 1 ms
Applied a total of 224 rules in 75 ms. Remains 229 /259 variables (removed 30) and now considering 280/217 (removed -63) transitions.
[2021-05-09 07:15:20] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 280 rows 229 cols
[2021-05-09 07:15:20] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:20] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/259 places, 280/217 transitions.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
[2021-05-09 07:15:21] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:15:21] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:15:21] [INFO ] Time to serialize gal into /tmp/LTL16815934363370241707.gal : 4 ms
[2021-05-09 07:15:21] [INFO ] Time to serialize properties into /tmp/LTL15341710410060017521.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/LTL16815934363370241707.gal, -t, CGAL, -LTL, /tmp/LTL15341710410060017521.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/LTL16815934363370241707.gal -t CGAL -LTL /tmp/LTL15341710410060017521.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((p34!=1)||(p206!=1))||(p392!=1))")||(X(G("(p5!=1)"))))))
Formula 0 simplified : !X("(((p34!=1)||(p206!=1))||(p392!=1))" | XG"(p5!=1)")
Detected timeout of ITS tools.
[2021-05-09 07:15:36] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:15:36] [INFO ] Applying decomposition
[2021-05-09 07:15:36] [INFO ] Flatten gal took : 10 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/graph10329347829170420950.txt, -o, /tmp/graph10329347829170420950.bin, -w, /tmp/graph10329347829170420950.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/graph10329347829170420950.bin, -l, -1, -v, -w, /tmp/graph10329347829170420950.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:15:36] [INFO ] Decomposing Gal with order
[2021-05-09 07:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:15:36] [INFO ] Removed a total of 89 redundant transitions.
[2021-05-09 07:15:36] [INFO ] Flatten gal took : 40 ms
[2021-05-09 07:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2021-05-09 07:15:36] [INFO ] Time to serialize gal into /tmp/LTL15371948313538616927.gal : 5 ms
[2021-05-09 07:15:36] [INFO ] Time to serialize properties into /tmp/LTL10680063949713201494.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/LTL15371948313538616927.gal, -t, CGAL, -LTL, /tmp/LTL10680063949713201494.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/LTL15371948313538616927.gal -t CGAL -LTL /tmp/LTL10680063949713201494.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(((i7.u14.p34!=1)||(i15.i1.u57.p206!=1))||(i10.i1.u75.p392!=1))")||(X(G("(i1.u2.p5!=1)"))))))
Formula 0 simplified : !X("(((i7.u14.p34!=1)||(i15.i1.u57.p206!=1))||(i10.i1.u75.p392!=1))" | XG"(i1.u2.p5!=1)")
Reverse transition relation is NOT exact ! Due to transitions t117, t172, t206, t210, t213, t217, t221, t224, t229, t231, t232, i0.i0.u39.t110, i0.i0.u73.t33, i0.i1.u37.t113, i1.u35.t120, i2.u31.t129, i3.u27.t137, i3.u29.t133, i4.u21.t152, i5.u11.t175, i6.u9.t179, i6.u10.t177, i7.u13.t170, i7.u14.t169, i8.i0.u17.t159, i8.i0.u18.t160, i8.i1.u61.t73, i8.i1.u62.t69, i8.i1.u63.t66, i9.u19.t156, i10.i0.u25.t142, i10.i1.u75.t26, i12.i0.u33.t125, i12.i1.u69.t46, i12.i1.u70.t43, i13.i0.u23.t147, i13.i1.u64.t63, i13.i1.u65.t59, i14.u59.t79, i14.u60.t76, i15.i0.u15.t165, i15.i1.u57.t86, i15.i1.u58.t82, i16.u55.t93, i16.u56.t89, i17.u50.t107, i17.u51.t105, i18.u66.t55, i18.u67.t52, i18.u68.t49, i20.u71.t40, i20.u72.t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/161/52/213
Computing Next relation with stutter on 26 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
822 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,8.2454,267060,1,0,420837,347,2758,826831,151,791,896594
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-08-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-08-04 finished in 27344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G((G(p1)||X(!p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 261 transition count 219
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 261 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 259 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 259 transition count 217
Applied a total of 34 rules in 48 ms. Remains 259 /276 variables (removed 17) and now considering 217/234 (removed 17) transitions.
// Phase 1: matrix 217 rows 259 cols
[2021-05-09 07:15:46] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-09 07:15:46] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2021-05-09 07:15:46] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:46] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2021-05-09 07:15:46] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:46] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 259/276 places, 217/234 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : BusinessProcesses-PT-08-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1 p2), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 5}], [{ cond=p1, acceptance={1} source=2 dest: 1}, { cond=true, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={1} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s118 1), p1:(NEQ s110 1), p2:(EQ s128 1)], nbAcceptance=2, 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 1664 reset in 184 ms.
Stack based approach found an accepted trace after 1138 steps with 20 reset with depth 5 and stack size 5 in 4 ms.
FORMULA BusinessProcesses-PT-08-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-07 finished in 888 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Graph (trivial) has 146 edges and 276 vertex of which 6 / 276 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 270 transition count 191
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 234 transition count 191
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 73 place count 234 transition count 135
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 196 place count 167 transition count 135
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 209 place count 154 transition count 122
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 223 place count 153 transition count 122
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 371 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 372 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 373 place count 76 transition count 48
Applied a total of 373 rules in 30 ms. Remains 76 /276 variables (removed 200) and now considering 48/234 (removed 186) transitions.
// Phase 1: matrix 48 rows 76 cols
[2021-05-09 07:15:47] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 48 rows 76 cols
[2021-05-09 07:15:47] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 159 ms to find 38 implicit places.
[2021-05-09 07:15:47] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 48 rows 38 cols
[2021-05-09 07:15:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 38/276 places, 48/234 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 38 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 25 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 25 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 25 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 22 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 19 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 19 transition count 28
Applied a total of 41 rules in 9 ms. Remains 19 /38 variables (removed 19) and now considering 28/48 (removed 20) transitions.
// Phase 1: matrix 28 rows 19 cols
[2021-05-09 07:15:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2021-05-09 07:15:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/276 places, 28/234 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-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:(NEQ s0 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 7 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-08 finished in 362 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Graph (trivial) has 147 edges and 276 vertex of which 6 / 276 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 270 transition count 191
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 234 transition count 191
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 73 place count 234 transition count 134
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 198 place count 166 transition count 134
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 212 place count 152 transition count 120
Ensure Unique test removed 1 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 227 place count 151 transition count 120
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 369 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 77 transition count 49
Applied a total of 371 rules in 29 ms. Remains 77 /276 variables (removed 199) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 77 cols
[2021-05-09 07:15:47] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 49 rows 77 cols
[2021-05-09 07:15:47] [INFO ] Computed 35 place invariants in 2 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 60]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 160 ms to find 15 implicit places.
[2021-05-09 07:15:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 49 rows 62 cols
[2021-05-09 07:15:47] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 62/276 places, 49/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2021-05-09 07:15:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 49 rows 62 cols
[2021-05-09 07:15:47] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/276 places, 49/234 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-09 finished in 317 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Graph (trivial) has 146 edges and 276 vertex of which 6 / 276 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 270 transition count 191
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 234 transition count 191
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 73 place count 234 transition count 135
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 195 place count 168 transition count 135
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 209 place count 154 transition count 121
Ensure Unique test removed 1 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 224 place count 153 transition count 121
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 366 place count 81 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 367 place count 80 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 79 transition count 50
Applied a total of 368 rules in 24 ms. Remains 79 /276 variables (removed 197) and now considering 50/234 (removed 184) transitions.
// Phase 1: matrix 50 rows 79 cols
[2021-05-09 07:15:47] [INFO ] Computed 36 place invariants in 0 ms
[2021-05-09 07:15:47] [INFO ] Implicit Places using invariants in 43 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-09 07:15:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 50 rows 78 cols
[2021-05-09 07:15:47] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 78/276 places, 50/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2021-05-09 07:15:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 50 rows 78 cols
[2021-05-09 07:15:47] [INFO ] Computed 35 place invariants in 3 ms
[2021-05-09 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 78/276 places, 50/234 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s16 0), p0:(NEQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15478 reset in 205 ms.
Stack based approach found an accepted trace after 1160 steps with 180 reset with depth 24 and stack size 20 in 3 ms.
FORMULA BusinessProcesses-PT-08-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-10 finished in 416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 263 transition count 221
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 263 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 262 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 262 transition count 220
Applied a total of 28 rules in 12 ms. Remains 262 /276 variables (removed 14) and now considering 220/234 (removed 14) transitions.
// Phase 1: matrix 220 rows 262 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:48] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 220 rows 262 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:48] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 262 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:48] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 262/276 places, 220/234 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s247 1), p1:(EQ s162 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-12 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 262 transition count 220
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 262 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 260 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 260 transition count 218
Applied a total of 32 rules in 7 ms. Remains 260 /276 variables (removed 16) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:48] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:48] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:48] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/276 places, 218/234 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s37 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1562 steps with 13 reset in 3 ms.
FORMULA BusinessProcesses-PT-08-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-13 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((G(p1) U X(G(p2)))||p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 263 transition count 221
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 263 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 261 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 261 transition count 219
Applied a total of 30 rules in 9 ms. Remains 261 /276 variables (removed 15) and now considering 219/234 (removed 15) transitions.
// Phase 1: matrix 219 rows 261 cols
[2021-05-09 07:15:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:49] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 219 rows 261 cols
[2021-05-09 07:15:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:49] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 261 cols
[2021-05-09 07:15:49] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-09 07:15:49] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 261/276 places, 219/234 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) p2)]
Running random walk in product with property : BusinessProcesses-PT-08-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s179 0) (EQ s23 0)), p1:(EQ s23 1), p2:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 839 reset in 144 ms.
Product exploration explored 100000 steps with 852 reset in 169 ms.
Graph (complete) has 555 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 842 reset in 133 ms.
Product exploration explored 100000 steps with 845 reset in 176 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) p2)]
Support contains 2 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 261/261 places, 219/219 transitions.
Graph (trivial) has 129 edges and 261 vertex of which 6 / 261 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 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 256 transition count 213
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 31 place count 256 transition count 321
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 78 place count 256 transition count 321
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 247 transition count 294
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 247 transition count 294
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 181 place count 247 transition count 294
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 203 place count 225 transition count 272
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 225 place count 225 transition count 272
Deduced a syphon composed of 131 places in 0 ms
Applied a total of 225 rules in 24 ms. Remains 225 /261 variables (removed 36) and now considering 272/219 (removed -53) transitions.
[2021-05-09 07:15:50] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 272 rows 225 cols
[2021-05-09 07:15:50] [INFO ] Computed 50 place invariants in 4 ms
[2021-05-09 07:15:51] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/261 places, 272/219 transitions.
Product exploration explored 100000 steps with 840 reset in 137 ms.
Product exploration explored 100000 steps with 841 reset in 150 ms.
[2021-05-09 07:15:51] [INFO ] Flatten gal took : 8 ms
[2021-05-09 07:15:51] [INFO ] Flatten gal took : 8 ms
[2021-05-09 07:15:51] [INFO ] Time to serialize gal into /tmp/LTL10827527568873750573.gal : 1 ms
[2021-05-09 07:15:51] [INFO ] Time to serialize properties into /tmp/LTL14183341528470918829.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/LTL10827527568873750573.gal, -t, CGAL, -LTL, /tmp/LTL14183341528470918829.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/LTL10827527568873750573.gal -t CGAL -LTL /tmp/LTL14183341528470918829.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p233==0)||(p24==0))")||((G("(p24==1)"))U(X(G("(p233==1)"))))))))
Formula 0 simplified : !XG("((p233==0)||(p24==0))" | (G"(p24==1)" U XG"(p233==1)"))
Detected timeout of ITS tools.
[2021-05-09 07:16:06] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:16:06] [INFO ] Applying decomposition
[2021-05-09 07:16:06] [INFO ] Flatten gal took : 10 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/graph8355462726828943208.txt, -o, /tmp/graph8355462726828943208.bin, -w, /tmp/graph8355462726828943208.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/graph8355462726828943208.bin, -l, -1, -v, -w, /tmp/graph8355462726828943208.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:16:06] [INFO ] Decomposing Gal with order
[2021-05-09 07:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:16:06] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-09 07:16:06] [INFO ] Flatten gal took : 22 ms
[2021-05-09 07:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2021-05-09 07:16:06] [INFO ] Time to serialize gal into /tmp/LTL11918241851283357310.gal : 4 ms
[2021-05-09 07:16:06] [INFO ] Time to serialize properties into /tmp/LTL11240890095605169953.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/LTL11918241851283357310.gal, -t, CGAL, -LTL, /tmp/LTL11240890095605169953.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/LTL11918241851283357310.gal -t CGAL -LTL /tmp/LTL11240890095605169953.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i18.i1.u62.p233==0)||(i4.u9.p24==0))")||((G("(i4.u9.p24==1)"))U(X(G("(i18.i1.u62.p233==1)"))))))))
Formula 0 simplified : !XG("((i18.i1.u62.p233==0)||(i4.u9.p24==0))" | (G"(i4.u9.p24==1)" U XG"(i18.i1.u62.p233==1)"))
Reverse transition relation is NOT exact ! Due to transitions t117, t206, t210, t214, t217, t219, t221, t224, t229, i0.i0.u74.t33, i0.i1.u39.t110, i0.i2.u72.t40, i0.i2.u73.t37, i1.u35.t120, i2.u27.t137, i2.u29.t133, i3.u15.t165, i3.u19.t156, i4.t172, i4.u9.t178, i4.u9.t179, i4.u10.t177, i4.u11.t175, i5.u13.t170, i5.u14.t169, i6.u17.t159, i6.u18.t160, i8.u21.t152, i9.u23.t147, i11.u31.t129, i11.u68.t52, i12.i0.u33.t125, i12.i0.u51.t105, i12.i1.u70.t46, i12.i1.u71.t43, i13.u37.t113, i13.u55.t93, i14.u65.t63, i14.u66.t59, i14.u67.t55, i14.u69.t49, i16.u50.t107, i17.i0.u58.t82, i17.i0.u59.t79, i17.i1.u56.t89, i17.i1.u57.t86, i18.i0.u60.t76, i18.i0.u61.t73, i18.i0.u64.t66, i18.i1.t70, i18.i1.u63.t71, i19.i0.u25.t142, i19.i1.u76.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/53/215
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16402155839454337503
[2021-05-09 07:16:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16402155839454337503
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/ltsmin16402155839454337503]
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/ltsmin16402155839454337503] 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/ltsmin16402155839454337503] 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-08-14 finished in 33699 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 234/234 transitions.
Graph (trivial) has 143 edges and 276 vertex of which 6 / 276 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 270 transition count 192
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 235 transition count 192
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 71 place count 235 transition count 137
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 192 place count 169 transition count 137
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 203 place count 158 transition count 126
Ensure Unique test removed 1 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 215 place count 157 transition count 126
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 365 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 79 transition count 51
Applied a total of 367 rules in 39 ms. Remains 79 /276 variables (removed 197) and now considering 51/234 (removed 183) transitions.
// Phase 1: matrix 51 rows 79 cols
[2021-05-09 07:16:22] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 07:16:22] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 79 cols
[2021-05-09 07:16:22] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 07:16:22] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 61]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 123 ms to find 37 implicit places.
[2021-05-09 07:16:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 51 rows 42 cols
[2021-05-09 07:16:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:16:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 42/276 places, 51/234 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 42 transition count 45
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 36 transition count 45
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 31 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 31 transition count 40
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 31 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 29 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 36 place count 24 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 24 transition count 32
Applied a total of 37 rules in 10 ms. Remains 24 /42 variables (removed 18) and now considering 32/51 (removed 19) transitions.
// Phase 1: matrix 32 rows 24 cols
[2021-05-09 07:16:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:16:22] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 32 rows 24 cols
[2021-05-09 07:16:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:16:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/276 places, 32/234 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s21 1) (EQ s4 0)), p1:(EQ s18 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 11871 steps with 2538 reset in 9 ms.
FORMULA BusinessProcesses-PT-08-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-15 finished in 331 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16679017271048007745
[2021-05-09 07:16:22] [INFO ] Applying decomposition
[2021-05-09 07:16:22] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2021-05-09 07:16:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:16:22] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2021-05-09 07:16:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:16:22] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:16:22] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2021-05-09 07:16:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:16:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16679017271048007745
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/ltsmin16679017271048007745]
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/graph16305668384016405996.txt, -o, /tmp/graph16305668384016405996.bin, -w, /tmp/graph16305668384016405996.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/graph16305668384016405996.bin, -l, -1, -v, -w, /tmp/graph16305668384016405996.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:16:22] [INFO ] Decomposing Gal with order
[2021-05-09 07:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:16:22] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-09 07:16:22] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-09 07:16:22] [INFO ] Time to serialize gal into /tmp/LTLFireability2952914384584136632.gal : 3 ms
[2021-05-09 07:16:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17949304671228487450.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/LTLFireability2952914384584136632.gal, -t, CGAL, -LTL, /tmp/LTLFireability17949304671228487450.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/LTLFireability2952914384584136632.gal -t CGAL -LTL /tmp/LTLFireability17949304671228487450.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i17.i2.u64.p233==0)||(i2.u8.p24==0))")||((G("(i2.u8.p24==1)"))U(X(G("(i17.i2.u64.p233==1)"))))))))
Formula 0 simplified : !XG("((i17.i2.u64.p233==0)||(i2.u8.p24==0))" | (G"(i2.u8.p24==1)" U XG"(i17.i2.u64.p233==1)"))
Compilation finished in 1080 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16679017271048007745]
Link finished in 84 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((([]((LTLAPp1==true)) U X([]((LTLAPp2==true))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16679017271048007745]
Reverse transition relation is NOT exact ! Due to transitions t203, t277, t320, t323, t329, t330, t339, i0.u29.t222, i0.u31.t218, i1.u27.t226, i2.u8.t284, i2.u8.t286, i2.u9.t283, i3.i0.u13.t274, i3.i1.t276, i3.i1.u14.t272, i4.u21.t249, i4.u21.t251, i4.u21.t252, i5.u25.t233, i5.u25.t235, i5.u25.t236, i6.u33.t211, i6.u33.t213, i6.u33.t214, i7.u37.t193, i8.i0.u35.t206, i8.i1.u39.t190, i8.i2.t96, i8.i2.u78.t97, i9.u73.t115, i9.u74.t111, i9.u76.t103, i9.u77.t99, i10.i0.u72.t119, i10.i1.t128, i10.i1.u68.t129, i10.i2.t124, i10.i2.u70.t125, i11.u19.t256, i11.u66.t135, i11.u67.t131, i12.u61.t151, i12.u62.t147, i13.u50.t186, i13.u51.t183, i15.i0.u55.t167, i15.i0.u58.t159, i15.i1.t164, i15.i1.u56.t165, i16.t156, i16.u15.t270, i16.u59.t157, i17.i0.u17.t260, i17.i0.u18.t265, i17.i1.u63.t143, i17.i2.t140, i17.i2.u65.t141, i18.u23.t241, i18.u23.t243, i18.u23.t244, i19.u10.t280, i19.u75.t107, i20.t29, i20.t6, i20.u80.t79, i20.u81.t83, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/166/67/233
Computing Next relation with stutter on 26 deadlock states
8 unique states visited
6 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
1373 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.7633,409276,1,0,740142,590,3832,1.22244e+06,237,1622,1634706
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620544617500

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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