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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 10 09:42 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 47K 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-01-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620762095698

Running Version 0
[2021-05-11 19:41:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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-11 19:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:41:37] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-11 19:41:37] [INFO ] Transformed 200 places.
[2021-05-11 19:41:37] [INFO ] Transformed 178 transitions.
[2021-05-11 19:41:37] [INFO ] Found NUPN structural information;
[2021-05-11 19:41:37] [INFO ] Parsed PT model containing 200 places and 178 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Support contains 197 out of 199 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 199/199 places, 177/177 transitions.
Applied a total of 0 rules in 12 ms. Remains 199 /199 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 199 cols
[2021-05-11 19:41:37] [INFO ] Computed 30 place invariants in 19 ms
[2021-05-11 19:41:38] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 177 rows 199 cols
[2021-05-11 19:41:38] [INFO ] Computed 30 place invariants in 13 ms
[2021-05-11 19:41:38] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
// Phase 1: matrix 177 rows 199 cols
[2021-05-11 19:41:38] [INFO ] Computed 30 place invariants in 13 ms
[2021-05-11 19:41:38] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 177/177 transitions.
[2021-05-11 19:41:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:41:38] [INFO ] Flatten gal took : 36 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:38] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:41:38] [INFO ] Input system was already deterministic with 177 transitions.
Incomplete random walk after 100000 steps, including 1119 resets, run finished after 1140 ms. (steps per millisecond=87 ) properties (out of 103) seen :42
Running SMT prover for 61 properties.
// Phase 1: matrix 177 rows 199 cols
[2021-05-11 19:41:39] [INFO ] Computed 30 place invariants in 6 ms
[2021-05-11 19:41:39] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-11 19:41:39] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 8 ms returned sat
[2021-05-11 19:41:40] [INFO ] SMT Verify possible in real domain returnedunsat :54 sat :0 real:7
[2021-05-11 19:41:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-11 19:41:40] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-11 19:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:41:40] [INFO ] [Nat]Absence check using state equation in 95 ms returned unsat :5 sat :56
Attempting to minimize the solution found.
Minimization took 44 ms.
[2021-05-11 19:41:40] [INFO ] SMT Verify possible in nat domain returned unsat :5 sat :56
Successfully simplified 59 atomic propositions for a total of 15 simplifications.
[2021-05-11 19:41:40] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-01-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (trivial) has 125 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 373 edges and 192 vertex of which 190 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 189 transition count 121
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 143 transition count 121
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 94 place count 143 transition count 95
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 152 place count 111 transition count 95
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 180 place count 83 transition count 67
Iterating global reduction 2 with 28 rules applied. Total rules applied 208 place count 83 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 208 place count 83 transition count 64
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 214 place count 80 transition count 64
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 270 place count 52 transition count 36
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 274 place count 50 transition count 38
Applied a total of 274 rules in 45 ms. Remains 50 /199 variables (removed 149) and now considering 38/177 (removed 139) transitions.
[2021-05-11 19:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 6 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:41:40] [INFO ] Input system was already deterministic with 38 transitions.
Graph (trivial) has 118 edges and 199 vertex of which 7 / 199 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 375 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 190 transition count 126
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 147 transition count 126
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 88 place count 147 transition count 101
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 144 place count 116 transition count 101
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 170 place count 90 transition count 75
Iterating global reduction 2 with 26 rules applied. Total rules applied 196 place count 90 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 196 place count 90 transition count 73
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 200 place count 88 transition count 73
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 260 place count 58 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 56 transition count 45
Applied a total of 264 rules in 28 ms. Remains 56 /199 variables (removed 143) and now considering 45/177 (removed 132) transitions.
[2021-05-11 19:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 6 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:41:40] [INFO ] Input system was already deterministic with 45 transitions.
Graph (trivial) has 89 edges and 199 vertex of which 5 / 199 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 377 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 192 transition count 147
Reduce places removed 24 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 32 rules applied. Total rules applied 58 place count 168 transition count 139
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 66 place count 160 transition count 139
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 66 place count 160 transition count 111
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 124 place count 130 transition count 111
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 146 place count 108 transition count 89
Iterating global reduction 3 with 22 rules applied. Total rules applied 168 place count 108 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 168 place count 108 transition count 88
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 107 transition count 88
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 198 place count 93 transition count 74
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 3 with 2 rules applied. Total rules applied 200 place count 92 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 91 transition count 72
Applied a total of 201 rules in 33 ms. Remains 91 /199 variables (removed 108) and now considering 72/177 (removed 105) transitions.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 6 ms
[2021-05-11 19:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-01-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 6 ms
[2021-05-11 19:41:40] [INFO ] Input system was already deterministic with 72 transitions.
Graph (trivial) has 45 edges and 199 vertex of which 5 / 199 are part of one of the 1 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 377 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 12 place count 193 transition count 161
Reduce places removed 10 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 183 transition count 152
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 174 transition count 152
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 40 place count 174 transition count 145
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 54 place count 167 transition count 145
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 64 place count 157 transition count 135
Iterating global reduction 3 with 10 rules applied. Total rules applied 74 place count 157 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 157 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 156 transition count 134
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 96 place count 146 transition count 124
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 3 with 2 rules applied. Total rules applied 98 place count 145 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 144 transition count 122
Applied a total of 99 rules in 34 ms. Remains 144 /199 variables (removed 55) and now considering 122/177 (removed 55) transitions.
[2021-05-11 19:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 9 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:41:40] [INFO ] Input system was already deterministic with 122 transitions.
Graph (trivial) has 125 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 373 edges and 192 vertex of which 190 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 189 transition count 121
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 143 transition count 121
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 94 place count 143 transition count 95
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 152 place count 111 transition count 95
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 180 place count 83 transition count 67
Iterating global reduction 2 with 28 rules applied. Total rules applied 208 place count 83 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 208 place count 83 transition count 64
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 214 place count 80 transition count 64
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 270 place count 52 transition count 36
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 274 place count 50 transition count 38
Applied a total of 274 rules in 18 ms. Remains 50 /199 variables (removed 149) and now considering 38/177 (removed 139) transitions.
[2021-05-11 19:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 5 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 4 ms
[2021-05-11 19:41:40] [INFO ] Input system was already deterministic with 38 transitions.
[2021-05-11 19:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 10 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:41:40] [INFO ] Applying decomposition
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 9 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/graph9902211691506493332.txt, -o, /tmp/graph9902211691506493332.bin, -w, /tmp/graph9902211691506493332.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/graph9902211691506493332.bin, -l, -1, -v, -w, /tmp/graph9902211691506493332.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:41:40] [INFO ] Decomposing Gal with order
[2021-05-11 19:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:41:40] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-11 19:41:40] [INFO ] Flatten gal took : 55 ms
[2021-05-11 19:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2021-05-11 19:41:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11660368199376623439.gal : 5 ms
[2021-05-11 19:41:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16977003394639146245.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality11660368199376623439.gal, -t, CGAL, -ctl, /tmp/CTLCardinality16977003394639146245.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality11660368199376623439.gal -t CGAL -ctl /tmp/CTLCardinality16977003394639146245.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.4161e+10,1.38833,55356,2,40965,5,193060,6,0,969,181715,0


Converting to forward existential form...Done !
original formula: EF((!(EF((((((((gi2.gu9.p61+gi2.gu9.p184)+gi2.gu9.p65)+gi2.gu9.p52)+gi2.gu9.p49)+gi2.gu9.p20)+gu17.p189)<=gi1.gu13.p89))) + !(AX(((gu15.p95+gu15.p177)<=(((((((((gu15.p0+gu15.p64)+gi1.gu13.p146)+gu17.p192)+gu15.p22)+gu15.p112)+gu15.p43)+gi4.gu14.p130)+gu15.p102)+gu15.p127))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((((((gi2.gu9.p61+gi2.gu9.p184)+gi2.gu9.p65)+gi2.gu9.p52)+gi2.gu9.p49)+gi2.gu9.p20)+gu17.p189)<=gi1.gu13.p89))))] != FALSE + [(EY(FwdU(Init,TRUE)) * !(((gu15.p95+gu15.p177)<=(((((((((gu15.p0+gu15.p64)+gi1.gu13.p146)+gu17.p192)+gu15.p22)+gu15.p112)+gu15.p43)+gi4.gu14.p130)+gu15.p102)+gu15.p127))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions gu17.t54, gu17.t78, gu17.t116, gu15.t63, gi0.gu8.t3, gi0.gu8.t5, gi0.gu8.t20, gi0.gu8.t23, gi0.gu8.t27, gi0.gu8.t33, gi0.gu8.t37, gi0.gu8.t42, gi0.gu19.t136, gi0.t25, gi1.t128, gi1.t124, gi2.gu9.t108, gi2.gu9.t112, gi2.gu20.t59, gi3.gu11.t104, gi4.gu14.t67, gi5.gu3.t132, gi5.gu16.t74, gi5.gu18.t71, t8, t14, t17, t30, t35, t48, t55, t58, t62, t66, t70, t75, t79, t82, t83, t86, t87, t94, t98, t100, t105, t109, t113, t119, t121, t126, t133, t139, t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/118/53/175
(forward)formula 0,1,32.1468,697952,1,0,391,3.33154e+06,369,174,5463,2.59226e+06,366
FORMULA BusinessProcesses-PT-01-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(AX((AF((((((((gu17.p140+gu15.p12)+gu15.p0)+gu15.p16)+gu15.p54)+gu17.p13)+gu17.p40)>=3)) + ((((((gi3.gu7.p4+gi3.gu7.p59)+gi3.gu7.p44)+gi3.gu7.p196)+gi3.gu7.p120)>((gi3.gu7.p75+gu17.p185)+gi3.gu7.p182)) * EG(AX((((((gi5.gu18.p101+gi5.gu18.p143)+gi5.gu18.p183)+gi5.gu18.p133)+gi5.gu18.p119)<=((((gi5.gu18.p96+gi5.gu18.p66)+gi0.gu1.p104)+gi5.gu21.p176)+gi1.gu13.p137))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(EG(!((((((((gu17.p140+gu15.p12)+gu15.p0)+gu15.p16)+gu15.p54)+gu17.p13)+gu17.p40)>=3)))) + ((((((gi3.gu7.p4+gi3.gu7.p59)+gi3.gu7.p44)+gi3.gu7.p196)+gi3.gu7.p120)>((gi3.gu7.p75+gu17.p185)+gi3.gu7.p182)) * EG(!(EX(!((((((gi5.gu18.p101+gi5.gu18.p143)+gi5.gu18.p183)+gi5.gu18.p133)+gi5.gu18.p119)<=((((gi5.gu18.p96+gi5.gu18.p66)+gi0.gu1.p104)+gi5.gu21.p176)+gi1.gu13.p137))))))))))))] != FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 1,1,720.857,7692712,1,0,601,5.26744e+07,11,295,3100,5.31052e+07,196
FORMULA BusinessProcesses-PT-01-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(E(!(AX(FALSE)) U !(EX(TRUE))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(FALSE))))) * !(EX(TRUE)))] = FALSE
(forward)formula 2,0,780.28,7692712,1,0,661,5.26744e+07,15,461,3369,5.31052e+07,708
FORMULA BusinessProcesses-PT-01-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(!(AG(AX((((((gi0.gu1.p76+gi1.gu13.p73)+gi1.gu13.p63)+gi0.gu19.p170)+gi2.gu9.p61)<=(gi1.gu13.p155+gu15.p72))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!(E(TRUE U !(!(EX(!((((((gi0.gu1.p76+gi1.gu13.p73)+gi1.gu13.p63)+gi0.gu19.p170)+gi2.gu9.p61)<=(gi1.gu13.p155+gu15.p72)))))))))))] = FALSE
(forward)formula 3,1,803.762,7692712,1,0,702,5.26744e+07,27,483,3616,5.31052e+07,759
FORMULA BusinessProcesses-PT-01-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(EF(AG((((((EF((((((gi0.gu19.p6+gi0.gu19.p167)+gi0.gu19.p174)+gi0.gu19.p170)+gi0.gu19.p17)<=((gu15.p152+gi0.gu19.p145)+gi1.gu13.p100))) * EF(((gi1.gu13.p113+gi1.gu13.p89)<=((((gi1.gu13.p41+gi0.gu1.p30)+gi4.gu14.p122)+gi0.gu0.p180)+gi1.gu13.p82)))) * AX(((((((gi2.gu9.p164+gi2.gu20.p134)+gu17.p98)+gi2.gu9.p166)+gi1.gu13.p38)+gu17.p185)<=gi2.gu9.p91))) * (((((((((gi4.gu14.p179+gi4.gu14.p130)+gi4.gu14.p79)+gi4.gu14.p181)+gi4.gu14.p62)+gi4.gu14.p93)+gi4.gu14.p122)+gi4.gu14.p99)<=(((gi4.gu14.p118+gi4.gu14.p55)+gi4.gu14.p124)+gi1.gu13.p100))||((gi3.gu10.p84+gi3.gu10.p56)>=48))) * (gu17.p3<=(((((((((gi5.gu21.p163+gi5.gu21.p19)+gi5.gu21.p111)+gi5.gu21.p186)+gi5.gu21.p97)+gi5.gu21.p68)+gi5.gu21.p90)+gi5.gu21.p197)+gu17.p3)+gi5.gu21.p176))) * (((((((gi1.gu13.p38+gu15.p95)+gi1.gu13.p149)+gi1.gu13.p113)+gi1.gu13.p15)+gi4.gu14.p118)+gu17.p13)<=5)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((E(TRUE U (((((gi0.gu19.p6+gi0.gu19.p167)+gi0.gu19.p174)+gi0.gu19.p170)+gi0.gu19.p17)<=((gu15.p152+gi0.gu19.p145)+gi1.gu13.p100))) * E(TRUE U ((gi1.gu13.p113+gi1.gu13.p89)<=((((gi1.gu13.p41+gi0.gu1.p30)+gi4.gu14.p122)+gi0.gu0.p180)+gi1.gu13.p82)))) * !(EX(!(((((((gi2.gu9.p164+gi2.gu20.p134)+gu17.p98)+gi2.gu9.p166)+gi1.gu13.p38)+gu17.p185)<=gi2.gu9.p91))))) * (((((((((gi4.gu14.p179+gi4.gu14.p130)+gi4.gu14.p79)+gi4.gu14.p181)+gi4.gu14.p62)+gi4.gu14.p93)+gi4.gu14.p122)+gi4.gu14.p99)<=(((gi4.gu14.p118+gi4.gu14.p55)+gi4.gu14.p124)+gi1.gu13.p100))||((gi3.gu10.p84+gi3.gu10.p56)>=48))) * (gu17.p3<=(((((((((gi5.gu21.p163+gi5.gu21.p19)+gi5.gu21.p111)+gi5.gu21.p186)+gi5.gu21.p97)+gi5.gu21.p68)+gi5.gu21.p90)+gi5.gu21.p197)+gu17.p3)+gi5.gu21.p176))) * (((((((gi1.gu13.p38+gu15.p95)+gi1.gu13.p149)+gi1.gu13.p113)+gi1.gu13.p15)+gi4.gu14.p118)+gu17.p13)<=5))))))] = FALSE
(forward)formula 4,1,835.665,7692712,1,0,773,5.26744e+07,34,522,3918,5.31052e+07,850
FORMULA BusinessProcesses-PT-01-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG((AG((((((((gi2.gu9.p166+gi0.gu0.p180)+gi0.gu19.p145)+gi0.gu0.p34)+gi0.gu0.p106)+gi0.gu1.p1)<=(((gi4.gu14.p118+gi0.gu1.p156)+gi0.gu0.p78)+gu15.p158)) * EG((((((((((gi1.gu13.p74+gi1.gu13.p137)+gi1.gu13.p73)+gi1.gu13.p108)+gi1.gu13.p63)+gi1.gu13.p100)+gi1.gu13.p89)+gi1.gu13.p35)+gi1.gu13.p168)<=((((gi1.gu13.p113+gi1.gu13.p38)+gi1.gu13.p146)+gi1.gu13.p188)+gi1.gu13.p14))))) * (!(AX(FALSE)) + EX(((((gu15.p12+gu15.p127)+gu15.p152)<=(((((((((gu15.p16+gu15.p72)+gu15.p131)+gu15.p158)+gu17.p109)+gu15.p129)+gu17.p3)+gu15.p107)+gu15.p22)+gu15.p177))&&(((((gi5.gu6.p36+gi5.gu21.p176)+gi5.gu6.p172)<=18)&&((((((((((gi0.gu1.p70+gi0.gu1.p11)+gi0.gu1.p76)+gi0.gu1.p47)+gi0.gu1.p156)+gi0.gu1.p1)+gi0.gu1.p162)+gi0.gu1.p2)+gi0.gu1.p148)+gi0.gu1.p198)<=(gi0.gu1.p104+gi0.gu1.p30)))||((((((gi4.gu12.p71+gi4.gu14.p79)+gi4.gu12.p199)+gi4.gu12.p121)+gi4.gu12.p144)+gi4.gu12.p135)<25)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((((((((gi2.gu9.p166+gi0.gu0.p180)+gi0.gu19.p145)+gi0.gu0.p34)+gi0.gu0.p106)+gi0.gu1.p1)<=(((gi4.gu14.p118+gi0.gu1.p156)+gi0.gu0.p78)+gu15.p158)) * EG((((((((((gi1.gu13.p74+gi1.gu13.p137)+gi1.gu13.p73)+gi1.gu13.p108)+gi1.gu13.p63)+gi1.gu13.p100)+gi1.gu13.p89)+gi1.gu13.p35)+gi1.gu13.p168)<=((((gi1.gu13.p113+gi1.gu13.p38)+gi1.gu13.p146)+gi1.gu13.p188)+gi1.gu13.p14))))))) * (!(!(EX(!(FALSE)))) + EX(((((gu15.p12+gu15.p127)+gu15.p152)<=(((((((((gu15.p16+gu15.p72)+gu15.p131)+gu15.p158)+gu17.p109)+gu15.p129)+gu17.p3)+gu15.p107)+gu15.p22)+gu15.p177))&&(((((gi5.gu6.p36+gi5.gu21.p176)+gi5.gu6.p172)<=18)&&((((((((((gi0.gu1.p70+gi0.gu1.p11)+gi0.gu1.p76)+gi0.gu1.p47)+gi0.gu1.p156)+gi0.gu1.p1)+gi0.gu1.p162)+gi0.gu1.p2)+gi0.gu1.p148)+gi0.gu1.p198)<=(gi0.gu1.p104+gi0.gu1.p30)))||((((((gi4.gu12.p71+gi4.gu14.p79)+gi4.gu12.p199)+gi4.gu12.p121)+gi4.gu12.p144)+gi4.gu12.p135)<25)))))))] != FALSE
(forward)formula 5,0,1130.81,8501324,1,0,1242,5.43753e+07,22,756,3494,5.6123e+07,227
FORMULA BusinessProcesses-PT-01-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(AF((!(EG((((((gu17.p80+gu17.p150)+gu15.p127)+gi1.gu13.p74)+gi3.gu7.p120)<=gi2.gu9.p171))) * (AG((gi1.gu13.p73<=(((((gi0.gu1.p1+gi0.gu0.p34)+gi4.gu14.p122)+gi1.gu13.p89)+gu15.p131)+gi1.gu13.p188))) + (AG(((((((((((gu17.p140+gu17.p80)+gu17.p190)+gu17.p87)+gu17.p88)+gi0.gu1.p156)+gu17.p161)+gu17.p109)+gu17.p81)+gu17.p60)<=(((((((((gu17.p159+gu17.p161)+gu17.p136)+gu17.p185)+gu17.p192)+gu17.p40)+gu17.p31)+gu17.p189)+gu17.p3)+gu17.p13))) * ((gi5.gu18.p143==0)||(gu17.p13==1)))))) U ((((((((gi0.gu1.p11+gi3.gu10.p56)+gi3.gu7.p75)+gi3.gu10.p116)+gi2.gu20.p134)>41)||(((((gu17.p88+gu17.p40)+gu17.p178)+gu17.p189)+gi5.gu21.p176)>47))&&((((gi0.gu19.p125+gi3.gu7.p196)+gu17.p60)+gi0.gu19.p17)<=(gi5.gu21.p163+gi0.gu1.p198)))||((((((((((((gu17.p140+gi2.gu9.p5)+gi2.gu9.p171)+gi2.gu9.p91)+gi4.gu14.p130)+gi2.gu9.p166)+gi2.gu9.p65)+gi2.gu9.p45)+gi2.gu9.p52)+gi2.gu9.p10)>4)&&((gi2.gu9.p10+gi2.gu9.p49)>gu17.p88))&&(((((gi0.gu8.p153+gi0.gu8.p48)+gi0.gu8.p193)+gi0.gu8.p195)+gi0.gu1.p47)<15))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((!(EG((((((gu17.p80+gu17.p150)+gu15.p127)+gi1.gu13.p74)+gi3.gu7.p120)<=gi2.gu9.p171))) * (!(E(TRUE U !((gi1.gu13.p73<=(((((gi0.gu1.p1+gi0.gu0.p34)+gi4.gu14.p122)+gi1.gu13.p89)+gu15.p131)+gi1.gu13.p188))))) + (!(E(TRUE U !(((((((((((gu17.p140+gu17.p80)+gu17.p190)+gu17.p87)+gu17.p88)+gi0.gu1.p156)+gu17.p161)+gu17.p109)+gu17.p81)+gu17.p60)<=(((((((((gu17.p159+gu17.p161)+gu17.p136)+gu17.p185)+gu17.p192)+gu17.p40)+gu17.p31)+gu17.p189)+gu17.p3)+gu17.p13))))) * ((gi5.gu18.p143==0)||(gu17.p13==1))))))))) * ((((((((gi0.gu1.p11+gi3.gu10.p56)+gi3.gu7.p75)+gi3.gu10.p116)+gi2.gu20.p134)>41)||(((((gu17.p88+gu17.p40)+gu17.p178)+gu17.p189)+gi5.gu21.p176)>47))&&((((gi0.gu19.p125+gi3.gu7.p196)+gu17.p60)+gi0.gu19.p17)<=(gi5.gu21.p163+gi0.gu1.p198)))||((((((((((((gu17.p140+gi2.gu9.p5)+gi2.gu9.p171)+gi2.gu9.p91)+gi4.gu14.p130)+gi2.gu9.p166)+gi2.gu9.p65)+gi2.gu9.p45)+gi2.gu9.p52)+gi2.gu9.p10)>4)&&((gi2.gu9.p10+gi2.gu9.p49)>gu17.p88))&&(((((gi0.gu8.p153+gi0.gu8.p48)+gi0.gu8.p193)+gi0.gu8.p195)+gi0.gu1.p47)<15))))] != FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 6,0,1164.29,8501324,1,0,1242,5.43753e+07,43,756,4231,5.6123e+07,764
FORMULA BusinessProcesses-PT-01-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EX(EF(EX(((((((((((gu17.p150+gu17.p42)+gi1.gu13.p108)+gu17.p110)+gu15.p127)+gu15.p102)+gi1.gu13.p35)+gi5.gu21.p19)+gi0.gu1.p76)+gi0.gu0.p34)<=((gu17.p60+gu17.p98)+gu17.p26))))) + AX((((((((((gi2.gu20.p86+gi2.gu9.p61)+gu17.p161)+gi1.gu13.p100)+gi2.gu20.p194)+gu17.p109)+gi1.gu13.p113)+gi0.gu1.p148)+gi2.gu20.p69)<=(gu17.p159+gi2.gu20.p134))))
=> equivalent forward existential formula: [(EY((Init * !(EX(E(TRUE U EX(((((((((((gu17.p150+gu17.p42)+gi1.gu13.p108)+gu17.p110)+gu15.p127)+gu15.p102)+gi1.gu13.p35)+gi5.gu21.p19)+gi0.gu1.p76)+gi0.gu0.p34)<=((gu17.p60+gu17.p98)+gu17.p26)))))))) * !((((((((((gi2.gu20.p86+gi2.gu9.p61)+gu17.p161)+gi1.gu13.p100)+gi2.gu20.p194)+gu17.p109)+gi1.gu13.p113)+gi0.gu1.p148)+gi2.gu20.p69)<=(gu17.p159+gi2.gu20.p134))))] = FALSE
(forward)formula 7,1,1184.3,8501324,1,0,1242,5.43753e+07,46,756,4638,5.6123e+07,803
FORMULA BusinessProcesses-PT-01-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1620763289710

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-01"
export BK_EXAMINATION="CTLCardinality"
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-01, examination is CTLCardinality"
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-162038143700321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;