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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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.3K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 59K 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-02-00
FORMULA_NAME BusinessProcesses-PT-02-01
FORMULA_NAME BusinessProcesses-PT-02-02
FORMULA_NAME BusinessProcesses-PT-02-03
FORMULA_NAME BusinessProcesses-PT-02-04
FORMULA_NAME BusinessProcesses-PT-02-05
FORMULA_NAME BusinessProcesses-PT-02-06
FORMULA_NAME BusinessProcesses-PT-02-07
FORMULA_NAME BusinessProcesses-PT-02-08
FORMULA_NAME BusinessProcesses-PT-02-09
FORMULA_NAME BusinessProcesses-PT-02-10
FORMULA_NAME BusinessProcesses-PT-02-11
FORMULA_NAME BusinessProcesses-PT-02-12
FORMULA_NAME BusinessProcesses-PT-02-13
FORMULA_NAME BusinessProcesses-PT-02-14
FORMULA_NAME BusinessProcesses-PT-02-15

=== Now, execution of the tool begins

BK_START 1620542434124

Running Version 0
[2021-05-09 06:40:37] [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:40:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:40:37] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-09 06:40:37] [INFO ] Transformed 262 places.
[2021-05-09 06:40:37] [INFO ] Transformed 219 transitions.
[2021-05-09 06:40:37] [INFO ] Found NUPN structural information;
[2021-05-09 06:40:37] [INFO ] Parsed PT model containing 262 places and 219 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:40:37] [INFO ] Initial state test concluded for 6 properties.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 31 place count 214 transition count 179
Iterating global reduction 1 with 25 rules applied. Total rules applied 56 place count 214 transition count 179
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 204 transition count 169
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 204 transition count 169
Applied a total of 76 rules in 107 ms. Remains 204 /245 variables (removed 41) and now considering 169/204 (removed 35) transitions.
// Phase 1: matrix 169 rows 204 cols
[2021-05-09 06:40:38] [INFO ] Computed 37 place invariants in 19 ms
[2021-05-09 06:40:38] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 169 rows 204 cols
[2021-05-09 06:40:38] [INFO ] Computed 37 place invariants in 10 ms
[2021-05-09 06:40:38] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 204 cols
[2021-05-09 06:40:38] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-09 06:40:38] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/245 places, 169/204 transitions.
[2021-05-09 06:40:39] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 06:40:39] [INFO ] Flatten gal took : 73 ms
FORMULA BusinessProcesses-PT-02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:40:39] [INFO ] Flatten gal took : 36 ms
[2021-05-09 06:40:39] [INFO ] Input system was already deterministic with 169 transitions.
Incomplete random walk after 100000 steps, including 1358 resets, run finished after 225 ms. (steps per millisecond=444 ) properties (out of 23) seen :19
Running SMT prover for 4 properties.
// Phase 1: matrix 169 rows 204 cols
[2021-05-09 06:40:39] [INFO ] Computed 37 place invariants in 7 ms
[2021-05-09 06:40:39] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2021-05-09 06:40:39] [INFO ] [Real]Absence check using 24 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:39] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-09 06:40:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
[2021-05-09 06:40:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2021-05-09 06:40:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2021-05-09 06:40:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2021-05-09 06:40:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:40] [INFO ] [Nat]Absence check using 24 positive place invariants in 19 ms returned sat
[2021-05-09 06:40:40] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 11 ms returned sat
[2021-05-09 06:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:40] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 106 ms
[2021-05-09 06:40:40] [INFO ] Computed and/alt/rep : 167/314/167 causal constraints (skipped 1 transitions) in 12 ms.
[2021-05-09 06:40:40] [INFO ] Added : 141 causal constraints over 29 iterations in 361 ms. Result :sat
[2021-05-09 06:40:40] [INFO ] [Real]Absence check using 24 positive place invariants in 5 ms returned sat
[2021-05-09 06:40:40] [INFO ] [Real]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:40] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Deduced a trap composed of 17 places in 13 ms of which 0 ms to minimize.
[2021-05-09 06:40:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 136 ms
[2021-05-09 06:40:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:40] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2021-05-09 06:40:40] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-09 06:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:40] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 17 places in 12 ms of which 0 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 139 ms
[2021-05-09 06:40:41] [INFO ] Computed and/alt/rep : 167/314/167 causal constraints (skipped 1 transitions) in 11 ms.
[2021-05-09 06:40:41] [INFO ] Added : 130 causal constraints over 26 iterations in 359 ms. Result :sat
[2021-05-09 06:40:41] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2021-05-09 06:40:41] [INFO ] [Real]Absence check using 24 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:41] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 33 places in 20 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 266 ms
[2021-05-09 06:40:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:41] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2021-05-09 06:40:41] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:41] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 365 ms
[2021-05-09 06:40:42] [INFO ] Computed and/alt/rep : 167/314/167 causal constraints (skipped 1 transitions) in 13 ms.
[2021-05-09 06:40:42] [INFO ] Added : 125 causal constraints over 25 iterations in 367 ms. Result :sat
[2021-05-09 06:40:42] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Real]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:42] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-09 06:40:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:42] [INFO ] [Nat]Absence check using 24 positive place invariants in 5 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-09 06:40:42] [INFO ] Computed and/alt/rep : 167/314/167 causal constraints (skipped 1 transitions) in 10 ms.
[2021-05-09 06:40:43] [INFO ] Added : 120 causal constraints over 24 iterations in 259 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Graph (trivial) has 104 edges and 204 vertex of which 6 / 204 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 198 transition count 131
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 167 transition count 131
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 63 place count 167 transition count 94
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 145 place count 122 transition count 94
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 154 place count 113 transition count 85
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 113 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 113 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 112 transition count 84
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 265 place count 61 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 60 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 59 transition count 34
Applied a total of 267 rules in 68 ms. Remains 59 /204 variables (removed 145) and now considering 34/169 (removed 135) transitions.
// Phase 1: matrix 34 rows 59 cols
[2021-05-09 06:40:43] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-09 06:40:43] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 34 rows 59 cols
[2021-05-09 06:40:43] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-09 06:40:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 140 ms to find 25 implicit places.
[2021-05-09 06:40:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 34 rows 34 cols
[2021-05-09 06:40:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 06:40:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 34/204 places, 34/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 34 transition count 29
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 29 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 27 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 27 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 24 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 24 transition count 23
Applied a total of 21 rules in 6 ms. Remains 24 /34 variables (removed 10) and now considering 23/34 (removed 11) transitions.
// Phase 1: matrix 23 rows 24 cols
[2021-05-09 06:40:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 06:40:43] [INFO ] Implicit Places using invariants in 20 ms returned [3, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 22/204 places, 23/169 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 22
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 4 place count 20 transition count 21
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 20 cols
[2021-05-09 06:40:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:40:43] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 21 rows 20 cols
[2021-05-09 06:40:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 06:40:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 20/204 places, 21/169 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s19 1), p0:(EQ s13 1), p2:(EQ s15 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-01 finished in 672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 193 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 189 transition count 154
Applied a total of 30 rules in 21 ms. Remains 189 /204 variables (removed 15) and now considering 154/169 (removed 15) transitions.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:43] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-09 06:40:44] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:44] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-09 06:40:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:44] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-09 06:40:44] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/204 places, 154/169 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(EQ s102 1), p0:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1650 reset in 360 ms.
Stack based approach found an accepted trace after 572 steps with 8 reset with depth 64 and stack size 64 in 1 ms.
FORMULA BusinessProcesses-PT-02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-04 finished in 1136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Graph (trivial) has 105 edges and 204 vertex of which 6 / 204 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 198 transition count 132
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 167 transition count 131
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 63 place count 167 transition count 94
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 144 place count 123 transition count 94
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 155 place count 112 transition count 83
Iterating global reduction 3 with 11 rules applied. Total rules applied 166 place count 112 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 112 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 111 transition count 82
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 264 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 60 transition count 34
Applied a total of 266 rules in 35 ms. Remains 60 /204 variables (removed 144) and now considering 34/169 (removed 135) transitions.
// Phase 1: matrix 34 rows 60 cols
[2021-05-09 06:40:45] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-09 06:40:45] [INFO ] Implicit Places using invariants in 100 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
[2021-05-09 06:40:45] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 34 rows 59 cols
[2021-05-09 06:40:45] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-09 06:40:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 59/204 places, 34/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2021-05-09 06:40:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 34 rows 59 cols
[2021-05-09 06:40:45] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-09 06:40:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 59/204 places, 34/169 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 1), p1:(NEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-05 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1) U G((p0||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 193 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 190 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 190 transition count 155
Applied a total of 28 rules in 10 ms. Remains 190 /204 variables (removed 14) and now considering 155/169 (removed 14) transitions.
// Phase 1: matrix 155 rows 190 cols
[2021-05-09 06:40:45] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:45] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 155 rows 190 cols
[2021-05-09 06:40:45] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:45] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 190 cols
[2021-05-09 06:40:45] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:45] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 190/204 places, 155/169 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-02-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s180 1), p1:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-07 finished in 369 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1||(p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 193 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 189 transition count 154
Applied a total of 30 rules in 9 ms. Remains 189 /204 variables (removed 15) and now considering 154/169 (removed 15) transitions.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:45] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:45] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:45] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-09 06:40:45] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:45] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/204 places, 154/169 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(NEQ s35 1), p3:(AND (NEQ s102 1) (NEQ s75 1)), p2:(NEQ s75 1), p1:(AND (EQ s36 1) (EQ s139 1) (EQ s182 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Graph (complete) has 377 edges and 189 vertex of which 185 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Knowledge obtained : [p0, p3, p2, (NOT p1)]
Stuttering acceptance computed with spot in 333 ms :[true, (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Applying partial POR strategy [true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0))]
Support contains 6 out of 189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 189/189 places, 154/154 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 189 transition count 154
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 35 Pre rules applied. Total rules applied 24 place count 189 transition count 211
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 59 place count 189 transition count 211
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 182 transition count 190
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 182 transition count 190
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 127 place count 182 transition count 190
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 141 place count 168 transition count 176
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 155 place count 168 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 168 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 158 place count 168 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 166 transition count 175
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 166 transition count 175
Deduced a syphon composed of 92 places in 0 ms
Applied a total of 162 rules in 65 ms. Remains 166 /189 variables (removed 23) and now considering 175/154 (removed -21) transitions.
[2021-05-09 06:40:48] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 175 rows 166 cols
[2021-05-09 06:40:48] [INFO ] Computed 37 place invariants in 7 ms
[2021-05-09 06:40:48] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 166/189 places, 175/154 transitions.
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Product exploration explored 100000 steps with 50000 reset in 610 ms.
[2021-05-09 06:40:50] [INFO ] Flatten gal took : 24 ms
[2021-05-09 06:40:50] [INFO ] Flatten gal took : 9 ms
[2021-05-09 06:40:50] [INFO ] Time to serialize gal into /tmp/LTL12135552967138092360.gal : 12 ms
[2021-05-09 06:40:50] [INFO ] Time to serialize properties into /tmp/LTL3921611712846118100.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/LTL12135552967138092360.gal, -t, CGAL, -LTL, /tmp/LTL3921611712846118100.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/LTL12135552967138092360.gal -t CGAL -LTL /tmp/LTL3921611712846118100.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p41!=1)"))||(X(("(((p42==1)&&(p173==1))&&(p255==1))")||(("(p89!=1)")U(("((p121!=1)&&(p89!=1))")||(G("(p89!=1)"))))))))
Formula 0 simplified : !(G"(p41!=1)" | X("(((p42==1)&&(p173==1))&&(p255==1))" | ("(p89!=1)" U ("((p121!=1)&&(p89!=1))" | G"(p89!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t2, t28, t33, t37, t40, t44, t47, t51, t54, t58, t61, t64, t67, t76, t79, t83, t84, t86, t89, t93, t97, t101, t105, t106, t109, t110, t115, t116, t121, t122, t127, t128, t131, t134, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/120/34/154
Computing Next relation with stutter on 41 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
730 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.3278,231588,1,0,329,723270,355,157,5226,589243,329
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-02-08 finished in 12439 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((p1||F(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 192 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 192 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 189 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 189 transition count 154
Applied a total of 30 rules in 10 ms. Remains 189 /204 variables (removed 15) and now considering 154/169 (removed 15) transitions.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:58] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:58] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:58] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-09 06:40:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:58] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:58] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/204 places, 154/169 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s115 1) (EQ s178 1)), p1:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-10 finished in 529 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 193 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 189 transition count 154
Applied a total of 30 rules in 10 ms. Remains 189 /204 variables (removed 15) and now considering 154/169 (removed 15) transitions.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:58] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:40:58] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:40:58] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:00] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2021-05-09 06:41:00] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:00] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/204 places, 154/169 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s7 1) (AND (EQ s149 1) (EQ s7 1))), p0:(EQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3759 reset in 138 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA BusinessProcesses-PT-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-11 finished in 2325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 193 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 190 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 190 transition count 155
Applied a total of 28 rules in 10 ms. Remains 190 /204 variables (removed 14) and now considering 155/169 (removed 14) transitions.
// Phase 1: matrix 155 rows 190 cols
[2021-05-09 06:41:01] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:01] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 155 rows 190 cols
[2021-05-09 06:41:01] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 190 cols
[2021-05-09 06:41:01] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:01] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 190/204 places, 155/169 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (EQ s55 1) (EQ s142 1) (EQ s183 1)), p0:(EQ s175 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-12 finished in 429 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Graph (trivial) has 106 edges and 204 vertex of which 6 / 204 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 198 transition count 131
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 167 transition count 131
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 63 place count 167 transition count 94
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 145 place count 122 transition count 94
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 155 place count 112 transition count 84
Iterating global reduction 2 with 10 rules applied. Total rules applied 165 place count 112 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 112 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 111 transition count 83
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 265 place count 61 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 60 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 59 transition count 34
Applied a total of 267 rules in 37 ms. Remains 59 /204 variables (removed 145) and now considering 34/169 (removed 135) transitions.
// Phase 1: matrix 34 rows 59 cols
[2021-05-09 06:41:01] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-09 06:41:01] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 34 rows 59 cols
[2021-05-09 06:41:01] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-09 06:41:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 34, 38, 39, 41, 43]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 117 ms to find 16 implicit places.
[2021-05-09 06:41:01] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 34 rows 43 cols
[2021-05-09 06:41:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 06:41:01] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 43/204 places, 34/169 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 43 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 41 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 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 14 place count 35 transition count 28
Applied a total of 14 rules in 5 ms. Remains 35 /43 variables (removed 8) and now considering 28/34 (removed 6) transitions.
// Phase 1: matrix 28 rows 35 cols
[2021-05-09 06:41:01] [INFO ] Computed 8 place invariants in 13 ms
[2021-05-09 06:41:01] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 28 rows 35 cols
[2021-05-09 06:41:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 06:41:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/204 places, 28/169 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s22 1), p0:(EQ s4 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-02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-14 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 194 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 194 transition count 159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 192 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 192 transition count 157
Applied a total of 24 rules in 9 ms. Remains 192 /204 variables (removed 12) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 192 cols
[2021-05-09 06:41:01] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-09 06:41:02] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 157 rows 192 cols
[2021-05-09 06:41:02] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:02] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 192 cols
[2021-05-09 06:41:02] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:41:02] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/204 places, 157/169 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s146 0), p0:(OR (EQ s167 1) (EQ s25 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]]
Product exploration explored 100000 steps with 3282 reset in 191 ms.
Stack based approach found an accepted trace after 18428 steps with 602 reset with depth 44 and stack size 44 in 31 ms.
FORMULA BusinessProcesses-PT-02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-15 finished in 783 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542463256

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

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