Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689500595.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 BART-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 124K Apr 29 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 440K Apr 29 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 29 19:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 526K Apr 29 19:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 74K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 87K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 228K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 57K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 534K May 10 09:33 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 BART-PT-002-LTLCardinality-00
FORMULA_NAME BART-PT-002-LTLCardinality-01
FORMULA_NAME BART-PT-002-LTLCardinality-02
FORMULA_NAME BART-PT-002-LTLCardinality-03
FORMULA_NAME BART-PT-002-LTLCardinality-04
FORMULA_NAME BART-PT-002-LTLCardinality-05
FORMULA_NAME BART-PT-002-LTLCardinality-06
FORMULA_NAME BART-PT-002-LTLCardinality-07
FORMULA_NAME BART-PT-002-LTLCardinality-08
FORMULA_NAME BART-PT-002-LTLCardinality-09
FORMULA_NAME BART-PT-002-LTLCardinality-10
FORMULA_NAME BART-PT-002-LTLCardinality-11
FORMULA_NAME BART-PT-002-LTLCardinality-12
FORMULA_NAME BART-PT-002-LTLCardinality-13
FORMULA_NAME BART-PT-002-LTLCardinality-14
FORMULA_NAME BART-PT-002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652667278057

Running Version 202205111006
[2022-05-16 02:14:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:14:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:14:39] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-05-16 02:14:39] [INFO ] Transformed 474 places.
[2022-05-16 02:14:39] [INFO ] Transformed 404 transitions.
[2022-05-16 02:14:39] [INFO ] Found NUPN structural information;
[2022-05-16 02:14:39] [INFO ] Parsed PT model containing 474 places and 404 transitions in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 203 transition count 343
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 203 transition count 343
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 173 place count 152 transition count 292
Iterating global reduction 0 with 51 rules applied. Total rules applied 224 place count 152 transition count 292
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 230 place count 146 transition count 286
Iterating global reduction 0 with 6 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 240 place count 142 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 247 place count 139 transition count 279
Iterating global reduction 0 with 3 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 253 place count 136 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 259 place count 133 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 262 place count 133 transition count 273
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 265 place count 130 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 270 place count 128 transition count 268
Iterating global reduction 0 with 2 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 274 place count 126 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 277 place count 125 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 278 place count 125 transition count 265
Applied a total of 278 rules in 80 ms. Remains 125 /264 variables (removed 139) and now considering 265/404 (removed 139) transitions.
// Phase 1: matrix 265 rows 125 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 22 ms
[2022-05-16 02:14:40] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 265 rows 125 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 18 ms
[2022-05-16 02:14:40] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 265 rows 125 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:40] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/264 places, 265/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/264 places, 265/404 transitions.
Support contains 4 out of 125 places after structural reductions.
[2022-05-16 02:14:40] [INFO ] Flatten gal took : 49 ms
[2022-05-16 02:14:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BART-PT-002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 02:14:40] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:14:40] [INFO ] Input system was already deterministic with 265 transitions.
Finished random walk after 280 steps, including 0 resets, run visited all 4 properties in 27 ms. (steps per millisecond=10 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 265/265 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 263
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 263
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 121 transition count 261
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 121 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 119 transition count 259
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 259
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 117 transition count 257
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 117 transition count 257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 115 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 115 transition count 255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 113 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 113 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 112 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 112 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 111 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 111 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 110 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 110 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 109 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 109 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 108 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 108 transition count 248
Applied a total of 34 rules in 21 ms. Remains 108 /125 variables (removed 17) and now considering 248/265 (removed 17) transitions.
// Phase 1: matrix 248 rows 108 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:40] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 248 rows 108 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 108 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-16 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/125 places, 248/265 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/125 places, 248/265 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLCardinality-08 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(X((G(p0)&&p1)))))))'
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 265/265 transitions.
Graph (trivial) has 261 edges and 125 vertex of which 106 / 125 are part of one of the 2 SCC in 3 ms
Free SCC test removed 104 places
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Reduce places removed 1 places and 0 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 3 place count 20 transition count 35
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 31
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 15 place count 16 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 6 rules applied. Total rules applied 21 place count 14 transition count 23
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 6 rules applied. Total rules applied 27 place count 12 transition count 19
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 31 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 34 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 37 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 39 place count 7 transition count 12
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 43 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 44 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 45 place count 5 transition count 7
Applied a total of 45 rules in 13 ms. Remains 5 /125 variables (removed 120) and now considering 7/265 (removed 258) transitions.
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 02:14:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 02:14:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 02:14:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 02:14:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/125 places, 7/265 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/125 places, 7/265 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s0 1), p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 BART-PT-002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLCardinality-13 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U G(X(!X(F(p0)))))))'
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 265/265 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 122 transition count 262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 122 transition count 262
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 119 transition count 259
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 119 transition count 259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 116 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 110 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 107 transition count 247
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 107 transition count 247
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 105 transition count 245
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 105 transition count 245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 103 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 103 transition count 243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 101 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 101 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 99 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 98 transition count 238
Applied a total of 54 rules in 20 ms. Remains 98 /125 variables (removed 27) and now considering 238/265 (removed 27) transitions.
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/125 places, 238/265 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/125 places, 238/265 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, p0, true, p0, p0]
Running random walk in product with property : BART-PT-002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLCardinality-14 finished in 341 ms.
All properties solved by simple procedures.
Total runtime 2533 ms.

BK_STOP 1652667281973

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BART-PT-002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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