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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 85K 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-06-00
FORMULA_NAME BusinessProcesses-PT-06-01
FORMULA_NAME BusinessProcesses-PT-06-02
FORMULA_NAME BusinessProcesses-PT-06-03
FORMULA_NAME BusinessProcesses-PT-06-04
FORMULA_NAME BusinessProcesses-PT-06-05
FORMULA_NAME BusinessProcesses-PT-06-06
FORMULA_NAME BusinessProcesses-PT-06-07
FORMULA_NAME BusinessProcesses-PT-06-08
FORMULA_NAME BusinessProcesses-PT-06-09
FORMULA_NAME BusinessProcesses-PT-06-10
FORMULA_NAME BusinessProcesses-PT-06-11
FORMULA_NAME BusinessProcesses-PT-06-12
FORMULA_NAME BusinessProcesses-PT-06-13
FORMULA_NAME BusinessProcesses-PT-06-14
FORMULA_NAME BusinessProcesses-PT-06-15

=== Now, execution of the tool begins

BK_START 1620543374928

Running Version 0
[2021-05-09 06:56:17] [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 06:56:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:56:17] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-09 06:56:17] [INFO ] Transformed 376 places.
[2021-05-09 06:56:17] [INFO ] Transformed 297 transitions.
[2021-05-09 06:56:17] [INFO ] Found NUPN structural information;
[2021-05-09 06:56:17] [INFO ] Parsed PT model containing 376 places and 297 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:56:17] [INFO ] Initial state test concluded for 4 properties.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 43 place count 332 transition count 255
Iterating global reduction 1 with 41 rules applied. Total rules applied 84 place count 332 transition count 255
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 99 place count 317 transition count 240
Iterating global reduction 1 with 15 rules applied. Total rules applied 114 place count 317 transition count 240
Applied a total of 114 rules in 136 ms. Remains 317 /375 variables (removed 58) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:56:17] [INFO ] Computed 79 place invariants in 33 ms
[2021-05-09 06:56:18] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:56:18] [INFO ] Computed 79 place invariants in 30 ms
[2021-05-09 06:56:18] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:56:18] [INFO ] Computed 79 place invariants in 9 ms
[2021-05-09 06:56:18] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/375 places, 240/296 transitions.
[2021-05-09 06:56:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 06:56:19] [INFO ] Flatten gal took : 92 ms
FORMULA BusinessProcesses-PT-06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:56:19] [INFO ] Flatten gal took : 31 ms
[2021-05-09 06:56:19] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 100000 steps, including 1017 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 27) seen :21
Running SMT prover for 6 properties.
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:56:19] [INFO ] Computed 79 place invariants in 14 ms
[2021-05-09 06:56:19] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2021-05-09 06:56:19] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 16 ms returned sat
[2021-05-09 06:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:19] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-09 06:56:19] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 9 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 435 ms
[2021-05-09 06:56:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:56:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-09 06:56:20] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 06:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:20] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2021-05-09 06:56:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 306 ms
[2021-05-09 06:56:20] [INFO ] Computed and/alt/rep : 238/425/238 causal constraints (skipped 1 transitions) in 23 ms.
[2021-05-09 06:56:21] [INFO ] Added : 235 causal constraints over 47 iterations in 885 ms. Result :sat
[2021-05-09 06:56:21] [INFO ] [Real]Absence check using 40 positive place invariants in 23 ms returned sat
[2021-05-09 06:56:21] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-09 06:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:21] [INFO ] [Real]Absence check using state equation in 82 ms returned unsat
[2021-05-09 06:56:21] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-09 06:56:21] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-09 06:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:21] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-09 06:56:22] [INFO ] Computed and/alt/rep : 238/425/238 causal constraints (skipped 1 transitions) in 16 ms.
[2021-05-09 06:56:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:56:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-09 06:56:22] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 06:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:22] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-09 06:56:22] [INFO ] Computed and/alt/rep : 238/425/238 causal constraints (skipped 1 transitions) in 15 ms.
[2021-05-09 06:56:22] [INFO ] Added : 206 causal constraints over 42 iterations in 705 ms. Result :sat
[2021-05-09 06:56:22] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2021-05-09 06:56:23] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-09 06:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:23] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 11 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 18 places in 15 ms of which 0 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 367 ms
[2021-05-09 06:56:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:56:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-09 06:56:23] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 06:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:23] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2021-05-09 06:56:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 356 ms
[2021-05-09 06:56:24] [INFO ] Computed and/alt/rep : 238/425/238 causal constraints (skipped 1 transitions) in 18 ms.
[2021-05-09 06:56:24] [INFO ] Added : 235 causal constraints over 47 iterations in 985 ms. Result :sat
[2021-05-09 06:56:25] [INFO ] [Real]Absence check using 40 positive place invariants in 17 ms returned sat
[2021-05-09 06:56:25] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-09 06:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:25] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-09 06:56:25] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2021-05-09 06:56:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2021-05-09 06:56:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:56:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-09 06:56:25] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 06:56:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:56:25] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 06:56:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2021-05-09 06:56:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2021-05-09 06:56:25] [INFO ] Computed and/alt/rep : 238/425/238 causal constraints (skipped 1 transitions) in 16 ms.
[2021-05-09 06:56:26] [INFO ] Added : 231 causal constraints over 47 iterations in 985 ms. Result :sat
[2021-05-09 06:56:26] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-09 06:56:26] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U G(p1))||(G(F(p1))&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 139 edges and 317 vertex of which 6 / 317 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 311 transition count 205
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 283 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 59 place count 282 transition count 138
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 201 place count 206 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 207 place count 200 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 200 transition count 132
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 387 place count 109 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 388 place count 108 transition count 48
Applied a total of 388 rules in 74 ms. Remains 108 /317 variables (removed 209) and now considering 48/240 (removed 192) transitions.
// Phase 1: matrix 48 rows 108 cols
[2021-05-09 06:56:26] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-09 06:56:26] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 48 rows 108 cols
[2021-05-09 06:56:26] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-09 06:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 06:56:26] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 211 ms to find 20 implicit places.
[2021-05-09 06:56:26] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 48 rows 88 cols
[2021-05-09 06:56:26] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-09 06:56:27] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 88/317 places, 48/240 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 88 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 79 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 57 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 55 transition count 29
Applied a total of 52 rules in 9 ms. Remains 55 /88 variables (removed 33) and now considering 29/48 (removed 19) transitions.
// Phase 1: matrix 29 rows 55 cols
[2021-05-09 06:56:27] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-09 06:56:27] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 29 rows 55 cols
[2021-05-09 06:56:27] [INFO ] Computed 27 place invariants in 2 ms
[2021-05-09 06:56:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-09 06:56:27] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 55/317 places, 29/240 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s28 1), p2:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-01 finished in 877 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(F((p1&&F(p2))))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 22 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:27] [INFO ] Computed 79 place invariants in 10 ms
[2021-05-09 06:56:27] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:27] [INFO ] Computed 79 place invariants in 3 ms
[2021-05-09 06:56:27] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:27] [INFO ] Computed 79 place invariants in 3 ms
[2021-05-09 06:56:27] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-06-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s113 0) (EQ s196 0) (EQ s291 0)), p1:(OR (EQ s113 0) (EQ s196 0) (EQ s291 0)), p2:(EQ s283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3051 steps with 32 reset in 18 ms.
FORMULA BusinessProcesses-PT-06-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-03 finished in 672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 13 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:28] [INFO ] Computed 79 place invariants in 3 ms
[2021-05-09 06:56:28] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:28] [INFO ] Computed 79 place invariants in 1 ms
[2021-05-09 06:56:28] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:28] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:28] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-06-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(OR (AND (EQ s149 1) (EQ s248 1) (EQ s278 1)) (AND (EQ s18 1) (EQ s172 1) (EQ s256 1))), p2:(AND (EQ s149 1) (EQ s248 1) (EQ s278 1)), p1:(NEQ s100 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-04 finished in 674 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 138 edges and 317 vertex of which 6 / 317 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 311 transition count 204
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 59 place count 282 transition count 138
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 201 place count 206 transition count 138
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 201 transition count 133
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 201 transition count 133
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 376 place count 118 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 117 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 378 place count 116 transition count 50
Applied a total of 378 rules in 26 ms. Remains 116 /317 variables (removed 201) and now considering 50/240 (removed 190) transitions.
// Phase 1: matrix 50 rows 116 cols
[2021-05-09 06:56:28] [INFO ] Computed 67 place invariants in 0 ms
[2021-05-09 06:56:28] [INFO ] Implicit Places using invariants in 55 ms returned [100, 102, 104, 106, 108, 110, 112]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
[2021-05-09 06:56:28] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 50 rows 109 cols
[2021-05-09 06:56:28] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:56:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 109/317 places, 50/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2021-05-09 06:56:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 50 rows 109 cols
[2021-05-09 06:56:29] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:56:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 109/317 places, 50/240 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s84 0), p0:(OR (EQ s93 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-05 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G((p0||G(p1)))||(p2&&(p0||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 132 edges and 317 vertex of which 6 / 317 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 311 transition count 204
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 282 transition count 204
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 59 place count 282 transition count 146
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 185 place count 214 transition count 146
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 191 place count 208 transition count 140
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 208 transition count 140
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 373 place count 116 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 374 place count 115 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 375 place count 114 transition count 55
Applied a total of 375 rules in 34 ms. Remains 114 /317 variables (removed 203) and now considering 55/240 (removed 185) transitions.
// Phase 1: matrix 55 rows 114 cols
[2021-05-09 06:56:29] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 55 rows 114 cols
[2021-05-09 06:56:29] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 187 ms to find 36 implicit places.
[2021-05-09 06:56:29] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 55 rows 78 cols
[2021-05-09 06:56:29] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-09 06:56:29] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 78/317 places, 55/240 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 78 transition count 48
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 71 transition count 48
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 37 place count 56 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 39 place count 55 transition count 39
Applied a total of 39 rules in 3 ms. Remains 55 /78 variables (removed 23) and now considering 39/55 (removed 16) transitions.
// Phase 1: matrix 39 rows 55 cols
[2021-05-09 06:56:29] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 39 rows 55 cols
[2021-05-09 06:56:29] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 55/317 places, 39/240 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-06 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s10 1), p2:(NEQ s10 0), p1:(OR (NEQ s39 1) (NEQ s41 1) (NEQ s43 1) (NEQ s45 1) (NEQ s47 1) (NEQ s49 1) (NEQ s51 1) (NEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 81 steps with 13 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-06 finished in 486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p1&&(p2 U p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 135 edges and 317 vertex of which 6 / 317 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 311 transition count 205
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 283 transition count 205
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 57 place count 283 transition count 140
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 197 place count 208 transition count 140
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 204 transition count 136
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 204 transition count 136
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 381 place count 112 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 111 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 110 transition count 51
Applied a total of 383 rules in 20 ms. Remains 110 /317 variables (removed 207) and now considering 51/240 (removed 189) transitions.
// Phase 1: matrix 51 rows 110 cols
[2021-05-09 06:56:29] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 51 rows 110 cols
[2021-05-09 06:56:29] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 17, 19, 21, 23, 25, 34, 35, 65, 67, 69, 71, 73, 75, 77]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 188 ms to find 26 implicit places.
[2021-05-09 06:56:29] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 51 rows 84 cols
[2021-05-09 06:56:29] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-09 06:56:29] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 84/317 places, 51/240 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 82 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 72 transition count 45
Applied a total of 18 rules in 4 ms. Remains 72 /84 variables (removed 12) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 72 cols
[2021-05-09 06:56:29] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:56:29] [INFO ] Implicit Places using invariants in 53 ms returned [13, 71]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 70/317 places, 45/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2021-05-09 06:56:30] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 45 rows 70 cols
[2021-05-09 06:56:30] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-09 06:56:30] [INFO ] Dead Transitions using invariants and state equation in 508 ms returned []
Finished structural reductions, in 3 iterations. Remains : 70/317 places, 45/240 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-06-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s58 1)), p1:(EQ s4 1), p3:(EQ s39 1), p2:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-07 finished in 1032 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X(p1)) U (G((p0&&X(p1)))||(p0&&X((p1&&X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 13 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:30] [INFO ] Computed 79 place invariants in 1 ms
[2021-05-09 06:56:30] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:30] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:31] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:31] [INFO ] Computed 79 place invariants in 3 ms
[2021-05-09 06:56:31] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : BusinessProcesses-PT-06-08 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(OR (AND (NEQ s209 1) (OR (NEQ s39 1) (NEQ s227 1) (NEQ s278 1))) (NEQ s280 1)), p0:(OR (NEQ s122 1) (NEQ s232 1) (NEQ s300 1)), p1:(NEQ s209 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 289 ms.
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true]
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Product exploration explored 100000 steps with 33333 reset in 202 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true]
Support contains 8 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 309/309 places, 232/232 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 309 transition count 232
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 27 place count 309 transition count 1300
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 93 place count 309 transition count 1300
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 104 place count 298 transition count 1259
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 115 place count 298 transition count 1259
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 196 place count 298 transition count 1259
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 210 place count 284 transition count 1245
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 224 place count 284 transition count 1245
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 226 place count 284 transition count 1249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 227 place count 284 transition count 1248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 229 place count 282 transition count 1244
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 282 transition count 1244
Deduced a syphon composed of 149 places in 0 ms
Applied a total of 231 rules in 168 ms. Remains 282 /309 variables (removed 27) and now considering 1244/232 (removed -1012) transitions.
[2021-05-09 06:56:33] [INFO ] Redundant transitions in 99 ms returned []
// Phase 1: matrix 1244 rows 282 cols
[2021-05-09 06:56:33] [INFO ] Computed 79 place invariants in 29 ms
[2021-05-09 06:56:34] [INFO ] Dead Transitions using invariants and state equation in 1461 ms returned []
Finished structural reductions, in 1 iterations. Remains : 282/309 places, 1244/232 transitions.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
[2021-05-09 06:56:35] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:56:35] [INFO ] Flatten gal took : 12 ms
[2021-05-09 06:56:35] [INFO ] Time to serialize gal into /tmp/LTL2895122879429109859.gal : 8 ms
[2021-05-09 06:56:35] [INFO ] Time to serialize properties into /tmp/LTL9163482888086580000.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/LTL2895122879429109859.gal, -t, CGAL, -LTL, /tmp/LTL9163482888086580000.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/LTL2895122879429109859.gal -t CGAL -LTL /tmp/LTL9163482888086580000.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("(p220!=1)"))&&("(((p122!=1)||(p248!=1))||(p367!=1))"))U((G(("(((p122!=1)||(p248!=1))||(p367!=1))")&&(X("(p220!=1)"))))||((X(("(p220!=1)")&&(X("(((p220!=1)&&(((p39!=1)||(p242!=1))||(p345!=1)))||(p347!=1))"))))&&("(((p122!=1)||(p248!=1))||(p367!=1))")))))
Formula 0 simplified : !(("(((p122!=1)||(p248!=1))||(p367!=1))" & X"(p220!=1)") U (G("(((p122!=1)||(p248!=1))||(p367!=1))" & X"(p220!=1)") | ("(((p122!=1)||(p248!=1))||(p367!=1))" & X("(p220!=1)" & X"(((p220!=1)&&(((p39!=1)||(p242!=1))||(p345!=1)))||(p347!=1))"))))
Detected timeout of ITS tools.
[2021-05-09 06:56:50] [INFO ] Flatten gal took : 41 ms
[2021-05-09 06:56:50] [INFO ] Applying decomposition
[2021-05-09 06:56:50] [INFO ] Flatten gal took : 15 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/graph5916668320543215507.txt, -o, /tmp/graph5916668320543215507.bin, -w, /tmp/graph5916668320543215507.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/graph5916668320543215507.bin, -l, -1, -v, -w, /tmp/graph5916668320543215507.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:56:50] [INFO ] Decomposing Gal with order
[2021-05-09 06:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:56:50] [INFO ] Removed a total of 32 redundant transitions.
[2021-05-09 06:56:50] [INFO ] Flatten gal took : 120 ms
[2021-05-09 06:56:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-09 06:56:50] [INFO ] Time to serialize gal into /tmp/LTL13378343700336548815.gal : 15 ms
[2021-05-09 06:56:50] [INFO ] Time to serialize properties into /tmp/LTL8648455821444212947.ltl : 11 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/LTL13378343700336548815.gal, -t, CGAL, -LTL, /tmp/LTL8648455821444212947.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/LTL13378343700336548815.gal -t CGAL -LTL /tmp/LTL8648455821444212947.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((X("(i12.u78.p220!=1)"))&&("(((i9.i0.u47.p122!=1)||(i11.u83.p248!=1))||(i9.i1.u102.p367!=1))"))U((G(("(((i9.i0.u47.p122!=1)||(i11.u83.p248!=1))||(i9.i1.u102.p367!=1))")&&(X("(i12.u78.p220!=1)"))))||((X(("(i12.u78.p220!=1)")&&(X("(((i12.u78.p220!=1)&&(((i1.u15.p39!=1)||(i11.u82.p242!=1))||(i17.u89.p345!=1)))||(i9.i1.u102.p347!=1))"))))&&("(((i9.i0.u47.p122!=1)||(i11.u83.p248!=1))||(i9.i1.u102.p367!=1))")))))
Formula 0 simplified : !(("(((i9.i0.u47.p122!=1)||(i11.u83.p248!=1))||(i9.i1.u102.p367!=1))" & X"(i12.u78.p220!=1)") U (G("(((i9.i0.u47.p122!=1)||(i11.u83.p248!=1))||(i9.i1.u102.p367!=1))" & X"(i12.u78.p220!=1)") | ("(((i9.i0.u47.p122!=1)||(i11.u83.p248!=1))||(i9.i1.u102.p367!=1))" & X("(i12.u78.p220!=1)" & X"(((i12.u78.p220!=1)&&(((i1.u15.p39!=1)||(i11.u82.p242!=1))||(i17.u89.p345!=1)))||(i9.i1.u102.p347!=1))"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10607547475688499926
[2021-05-09 06:57:05] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10607547475688499926
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/ltsmin10607547475688499926]
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/ltsmin10607547475688499926] 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/ltsmin10607547475688499926] 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-06-08 finished in 36356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 316 transition count 212
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 289 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 287 transition count 210
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 58 place count 287 transition count 142
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 204 place count 209 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 210 place count 203 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 216 place count 203 transition count 136
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 398 place count 108 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 108 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 107 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 401 place count 106 transition count 47
Applied a total of 401 rules in 48 ms. Remains 106 /317 variables (removed 211) and now considering 47/240 (removed 193) transitions.
// Phase 1: matrix 47 rows 106 cols
[2021-05-09 06:57:07] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:57:07] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 47 rows 106 cols
[2021-05-09 06:57:07] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:57:07] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 352 ms to find 34 implicit places.
[2021-05-09 06:57:07] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 47 rows 72 cols
[2021-05-09 06:57:07] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-09 06:57:07] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 72/317 places, 47/240 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 72 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 63 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 41 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 39 transition count 28
Applied a total of 52 rules in 10 ms. Remains 39 /72 variables (removed 33) and now considering 28/47 (removed 19) transitions.
// Phase 1: matrix 28 rows 39 cols
[2021-05-09 06:57:07] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 06:57:07] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 28 rows 39 cols
[2021-05-09 06:57:07] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 06:57:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/317 places, 28/240 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-10 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 s9 0) (EQ s25 0) (EQ s38 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 16012 reset in 175 ms.
Stack based approach found an accepted trace after 4695 steps with 730 reset with depth 26 and stack size 26 in 8 ms.
FORMULA BusinessProcesses-PT-06-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-10 finished in 910 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 138 edges and 317 vertex of which 6 / 317 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 311 transition count 205
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 283 transition count 205
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 57 place count 283 transition count 139
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 199 place count 207 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 201 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 201 transition count 133
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 389 place count 108 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 107 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 106 transition count 47
Applied a total of 391 rules in 25 ms. Remains 106 /317 variables (removed 211) and now considering 47/240 (removed 193) transitions.
// Phase 1: matrix 47 rows 106 cols
[2021-05-09 06:57:07] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 47 rows 106 cols
[2021-05-09 06:57:08] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 192 ms to find 39 implicit places.
[2021-05-09 06:57:08] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 47 rows 67 cols
[2021-05-09 06:57:08] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 67/317 places, 47/240 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 67 transition count 37
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 57 transition count 37
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 50 place count 35 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 33 transition count 27
Applied a total of 54 rules in 4 ms. Remains 33 /67 variables (removed 34) and now considering 27/47 (removed 20) transitions.
// Phase 1: matrix 27 rows 33 cols
[2021-05-09 06:57:08] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 27 rows 33 cols
[2021-05-09 06:57:08] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 33/317 places, 27/240 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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-06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-11 finished in 378 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 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 138 edges and 317 vertex of which 6 / 317 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 311 transition count 205
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 283 transition count 205
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 57 place count 283 transition count 140
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 197 place count 208 transition count 140
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 202 place count 203 transition count 135
Iterating global reduction 2 with 5 rules applied. Total rules applied 207 place count 203 transition count 135
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 389 place count 108 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 107 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 106 transition count 47
Applied a total of 391 rules in 17 ms. Remains 106 /317 variables (removed 211) and now considering 47/240 (removed 193) transitions.
// Phase 1: matrix 47 rows 106 cols
[2021-05-09 06:57:08] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 47 rows 106 cols
[2021-05-09 06:57:08] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 76]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 178 ms to find 38 implicit places.
[2021-05-09 06:57:08] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 47 rows 68 cols
[2021-05-09 06:57:08] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 68/317 places, 47/240 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 68 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 59 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 37 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 35 transition count 28
Applied a total of 52 rules in 2 ms. Remains 35 /68 variables (removed 33) and now considering 28/47 (removed 19) transitions.
// Phase 1: matrix 28 rows 35 cols
[2021-05-09 06:57:08] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 28 rows 35 cols
[2021-05-09 06:57:08] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 06:57:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/317 places, 28/240 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-15 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 s30 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 5 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-15 finished in 367 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5301617900432187711
[2021-05-09 06:57:08] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2021-05-09 06:57:08] [INFO ] Applying decomposition
[2021-05-09 06:57:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 06:57:08] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2021-05-09 06:57:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 06:57:08] [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/graph3664214297420541742.txt, -o, /tmp/graph3664214297420541742.bin, -w, /tmp/graph3664214297420541742.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/graph3664214297420541742.bin, -l, -1, -v, -w, /tmp/graph3664214297420541742.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:57:08] [INFO ] Decomposing Gal with order
[2021-05-09 06:57:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:57:08] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2021-05-09 06:57:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 06:57:08] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5301617900432187711
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/ltsmin5301617900432187711]
[2021-05-09 06:57:08] [INFO ] Removed a total of 31 redundant transitions.
[2021-05-09 06:57:08] [INFO ] Flatten gal took : 48 ms
[2021-05-09 06:57:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 06:57:08] [INFO ] Time to serialize gal into /tmp/LTLFireability7841491891919049917.gal : 15 ms
[2021-05-09 06:57:08] [INFO ] Time to serialize properties into /tmp/LTLFireability3865370907368920156.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/LTLFireability7841491891919049917.gal, -t, CGAL, -LTL, /tmp/LTLFireability3865370907368920156.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/LTLFireability7841491891919049917.gal -t CGAL -LTL /tmp/LTLFireability3865370907368920156.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((!("(((i18.i0.u40.p122==1)&&(i15.i0.u85.p248==1))&&(i18.i1.u108.p367==1))"))&&(X("(i11.i1.u80.p220!=1)")))U((((!("(((i18.i0.u40.p122==1)&&(i15.i0.u85.p248==1))&&(i18.i1.u108.p367==1))"))&&(X(X(!("(((i11.i1.u80.p220==1)||(((i8.u15.p39==1)&&(i15.i1.u84.p242==1))&&(i17.u91.p345==1)))&&(i18.i1.u108.p347==1))")))))&&(X("(i11.i1.u80.p220!=1)")))||(G((!("(((i18.i0.u40.p122==1)&&(i15.i0.u85.p248==1))&&(i18.i1.u108.p367==1))"))&&(X("(i11.i1.u80.p220!=1)")))))))
Formula 0 simplified : !((!"(((i18.i0.u40.p122==1)&&(i15.i0.u85.p248==1))&&(i18.i1.u108.p367==1))" & X"(i11.i1.u80.p220!=1)") U ((!"(((i18.i0.u40.p122==1)&&(i15.i0.u85.p248==1))&&(i18.i1.u108.p367==1))" & X"(i11.i1.u80.p220!=1)" & XX!"(((i11.i1.u80.p220==1)||(((i8.u15.p39==1)&&(i15.i1.u84.p242==1))&&(i17.u91.p345==1)))&&(i18.i1.u108.p347==1))") | G(!"(((i18.i0.u40.p122==1)&&(i15.i0.u85.p248==1))&&(i18.i1.u108.p367==1))" & X"(i11.i1.u80.p220!=1)")))
Compilation finished in 1264 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5301617900432187711]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true)&&X((LTLAPp1==true))) U ([](((LTLAPp0==true)&&X((LTLAPp1==true))))||((LTLAPp0==true)&&X(((LTLAPp1==true)&&X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5301617900432187711]
LTSmin run took 1321 ms.
FORMULA BusinessProcesses-PT-06-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620543431721

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

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