Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109800043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 8.3K Apr 30 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 30 07:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 07:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 61K 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 DiscoveryGPU-PT-08b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652628971641

Running Version 202205111006
[2022-05-15 15:36:12] [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-15 15:36:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:36:12] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-15 15:36:12] [INFO ] Transformed 240 places.
[2022-05-15 15:36:12] [INFO ] Transformed 254 transitions.
[2022-05-15 15:36:12] [INFO ] Found NUPN structural information;
[2022-05-15 15:36:12] [INFO ] Parsed PT model containing 240 places and 254 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 226 transition count 254
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 53 place count 187 transition count 215
Iterating global reduction 1 with 39 rules applied. Total rules applied 92 place count 187 transition count 215
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 179 transition count 207
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 179 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 174 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 174 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 172 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 172 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 170 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 170 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 169 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 169 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 168 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 168 transition count 194
Applied a total of 130 rules in 76 ms. Remains 168 /240 variables (removed 72) and now considering 194/254 (removed 60) transitions.
// Phase 1: matrix 194 rows 168 cols
[2022-05-15 15:36:13] [INFO ] Computed 3 place invariants in 15 ms
[2022-05-15 15:36:13] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 194 rows 168 cols
[2022-05-15 15:36:13] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-15 15:36:13] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 168 cols
[2022-05-15 15:36:13] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-15 15:36:13] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/240 places, 194/254 transitions.
Finished structural reductions, in 1 iterations. Remains : 168/240 places, 194/254 transitions.
Support contains 28 out of 168 places after structural reductions.
[2022-05-15 15:36:13] [INFO ] Flatten gal took : 41 ms
[2022-05-15 15:36:13] [INFO ] Flatten gal took : 18 ms
[2022-05-15 15:36:14] [INFO ] Input system was already deterministic with 194 transitions.
Finished random walk after 1015 steps, including 3 resets, run visited all 17 properties in 88 ms. (steps per millisecond=11 )
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 329 edges and 168 vertex of which 163 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Graph (complete) has 329 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 164 transition count 166
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 139 transition count 166
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 51 place count 139 transition count 139
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 105 place count 112 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 106 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 106 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 101 transition count 125
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 101 transition count 125
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 96 transition count 118
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 96 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 94 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 94 transition count 116
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 213 place count 58 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 220 place count 51 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 227 place count 51 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 234 place count 44 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 241 place count 44 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 247 place count 38 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 253 place count 38 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 259 place count 32 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 265 place count 32 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 271 place count 26 transition count 29
Iterating global reduction 2 with 6 rules applied. Total rules applied 277 place count 26 transition count 29
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 283 place count 20 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 289 place count 20 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 290 place count 20 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 19 transition count 21
Applied a total of 291 rules in 77 ms. Remains 19 /168 variables (removed 149) and now considering 21/194 (removed 173) transitions.
[2022-05-15 15:36:14] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 19 cols
[2022-05-15 15:36:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-15 15:36:14] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 19 cols
[2022-05-15 15:36:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-15 15:36:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/168 places, 21/194 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 17 transition count 17
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 8 place count 14 transition count 17
Applied a total of 8 rules in 1 ms. Remains 14 /18 variables (removed 4) and now considering 17/21 (removed 4) transitions.
[2022-05-15 15:36:14] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 14 cols
[2022-05-15 15:36:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:36:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 15:36:14] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 14 cols
[2022-05-15 15:36:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 15:36:14] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/168 places, 17/194 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/168 places, 17/194 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3805 reset in 362 ms.
Product exploration explored 100000 steps with 3808 reset in 194 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Graph (complete) has 33 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/14 stabilizing places and 14/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 311 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2022-05-15 15:36:16] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 14 cols
[2022-05-15 15:36:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:36:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-15 15:36:16] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 14 cols
[2022-05-15 15:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 15:36:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-15 15:36:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:16] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 14 cols
[2022-05-15 15:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 17/17 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Graph (complete) has 33 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/14 stabilizing places and 14/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3753 reset in 127 ms.
Product exploration explored 100000 steps with 3818 reset in 113 ms.
Built C files in :
/tmp/ltsmin11653013412764792222
[2022-05-15 15:36:17] [INFO ] Computing symmetric may disable matrix : 17 transitions.
[2022-05-15 15:36:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:36:17] [INFO ] Computing symmetric may enable matrix : 17 transitions.
[2022-05-15 15:36:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:36:17] [INFO ] Computing Do-Not-Accords matrix : 17 transitions.
[2022-05-15 15:36:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:36:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11653013412764792222
Running compilation step : cd /tmp/ltsmin11653013412764792222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin11653013412764792222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11653013412764792222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5981495472681830245.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-01 finished in 3312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 194
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 156 transition count 184
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 156 transition count 184
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 150 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 150 transition count 175
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 145 transition count 170
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 145 transition count 170
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 140 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 140 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 138 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 136 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 135 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 135 transition count 158
Applied a total of 64 rules in 14 ms. Remains 135 /168 variables (removed 33) and now considering 158/194 (removed 36) transitions.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:17] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:17] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:17] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:36:18] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/168 places, 158/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/168 places, 158/194 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s60 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 272 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-02 finished in 821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F((X((X(G(p1))&&F(p2)))&&p3))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 157 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 157 transition count 185
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 152 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 152 transition count 178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 149 transition count 175
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 149 transition count 175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 146 transition count 172
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 146 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 145 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 145 transition count 170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 144 transition count 169
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 144 transition count 169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 143 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 143 transition count 168
Applied a total of 48 rules in 17 ms. Remains 143 /168 variables (removed 25) and now considering 168/194 (removed 26) transitions.
// Phase 1: matrix 168 rows 143 cols
[2022-05-15 15:36:18] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:36:18] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 168 rows 143 cols
[2022-05-15 15:36:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:18] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 143 cols
[2022-05-15 15:36:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:18] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/168 places, 168/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/168 places, 168/194 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s132 0) (EQ s20 1)), p3:(OR (EQ s26 0) (EQ s94 1)), p2:(OR (EQ s20 0) (EQ s132 1)), p1:(AND (EQ s46 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 539 steps with 2 reset in 9 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-06 finished in 591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Graph (complete) has 329 edges and 168 vertex of which 163 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 162 transition count 165
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 137 transition count 165
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 51 place count 137 transition count 138
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 105 place count 110 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 104 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 104 transition count 132
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 99 transition count 124
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 99 transition count 124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 94 transition count 117
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 94 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 92 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 92 transition count 115
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 211 place count 57 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 218 place count 50 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 225 place count 50 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 232 place count 43 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 239 place count 43 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 246 place count 36 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 253 place count 36 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 260 place count 29 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 267 place count 29 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 274 place count 22 transition count 24
Iterating global reduction 2 with 7 rules applied. Total rules applied 281 place count 22 transition count 24
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 286 place count 17 transition count 19
Iterating global reduction 2 with 5 rules applied. Total rules applied 291 place count 17 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 292 place count 17 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 15 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 14 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 5 rules applied. Total rules applied 299 place count 10 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 301 place count 8 transition count 11
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 4 with 2 rules applied. Total rules applied 303 place count 7 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 7 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 305 place count 6 transition count 8
Applied a total of 305 rules in 39 ms. Remains 6 /168 variables (removed 162) and now considering 8/194 (removed 186) transitions.
[2022-05-15 15:36:19] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 15:36:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-15 15:36:19] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 15:36:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:19] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2022-05-15 15:36:19] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:19] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 15:36:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/168 places, 8/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/168 places, 8/194 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, true, p0]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s3 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-07 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U F(p1))||F(X(!p0))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 157 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 157 transition count 185
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 151 transition count 176
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 151 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 147 transition count 172
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 147 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 143 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 143 transition count 167
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 141 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 141 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 139 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 139 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 138 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 138 transition count 161
Applied a total of 58 rules in 24 ms. Remains 138 /168 variables (removed 30) and now considering 161/194 (removed 33) transitions.
// Phase 1: matrix 161 rows 138 cols
[2022-05-15 15:36:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:19] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 161 rows 138 cols
[2022-05-15 15:36:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:19] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 138 cols
[2022-05-15 15:36:19] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 15:36:19] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/168 places, 161/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/168 places, 161/194 transitions.
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s50 0) (EQ s32 1)), p1:(OR (EQ s92 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-08 finished in 684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G((F(p0)&&p1))))||F(p2))))'
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 157 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 157 transition count 185
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 152 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 152 transition count 177
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 147 transition count 172
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 142 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 140 transition count 163
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 140 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 138 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 138 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 137 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 137 transition count 160
Applied a total of 60 rules in 22 ms. Remains 137 /168 variables (removed 31) and now considering 160/194 (removed 34) transitions.
// Phase 1: matrix 160 rows 137 cols
[2022-05-15 15:36:20] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:36:20] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 160 rows 137 cols
[2022-05-15 15:36:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:20] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 137 cols
[2022-05-15 15:36:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:20] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/168 places, 160/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/168 places, 160/194 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s80 0) (EQ s82 1)), p1:(OR (EQ s1 0) (EQ s116 1)), p0:(OR (EQ s95 1) (EQ s1 0) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 275 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-09 finished in 962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Graph (complete) has 329 edges and 168 vertex of which 163 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 162 transition count 165
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 137 transition count 165
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 51 place count 137 transition count 138
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 105 place count 110 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 104 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 100 transition count 126
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 100 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 96 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 96 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 94 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 94 transition count 118
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 211 place count 57 transition count 81
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 217 place count 51 transition count 69
Iterating global reduction 2 with 6 rules applied. Total rules applied 223 place count 51 transition count 69
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 229 place count 45 transition count 63
Iterating global reduction 2 with 6 rules applied. Total rules applied 235 place count 45 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 241 place count 39 transition count 51
Iterating global reduction 2 with 6 rules applied. Total rules applied 247 place count 39 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 253 place count 33 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 259 place count 33 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 265 place count 27 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 271 place count 27 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 277 place count 21 transition count 27
Iterating global reduction 2 with 6 rules applied. Total rules applied 283 place count 21 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 293 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 298 place count 10 transition count 16
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 4 with 4 rules applied. Total rules applied 302 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 6 transition count 11
Applied a total of 305 rules in 31 ms. Remains 6 /168 variables (removed 162) and now considering 11/194 (removed 183) transitions.
[2022-05-15 15:36:21] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 15:36:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:21] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:36:21] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 15:36:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-15 15:36:21] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:21] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 15:36:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/168 places, 11/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/168 places, 11/194 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-12 finished in 145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(p0) U X(G(!F(p1))))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 159 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 159 transition count 186
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 155 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 155 transition count 180
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 152 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 152 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 149 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 149 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 148 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 148 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 147 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 147 transition count 171
Applied a total of 41 rules in 8 ms. Remains 147 /168 variables (removed 21) and now considering 171/194 (removed 23) transitions.
// Phase 1: matrix 171 rows 147 cols
[2022-05-15 15:36:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:21] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 171 rows 147 cols
[2022-05-15 15:36:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:21] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 147 cols
[2022-05-15 15:36:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:21] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/168 places, 171/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/168 places, 171/194 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s60 1), p1:(OR (EQ s102 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 294 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-14 finished in 704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!F(p0))) U !(!p1 U p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 194/194 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 159 transition count 187
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 159 transition count 187
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 155 transition count 181
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 155 transition count 181
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 152 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 152 transition count 178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 149 transition count 175
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 149 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 148 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 148 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 147 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 147 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 146 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 146 transition count 171
Applied a total of 42 rules in 10 ms. Remains 146 /168 variables (removed 22) and now considering 171/194 (removed 23) transitions.
// Phase 1: matrix 171 rows 146 cols
[2022-05-15 15:36:21] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:21] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 171 rows 146 cols
[2022-05-15 15:36:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:22] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 146 cols
[2022-05-15 15:36:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:22] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/168 places, 171/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/168 places, 171/194 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, p1, p0]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s28 0) (EQ s52 1)), p0:(OR (EQ s99 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 259 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-15 finished in 362 ms.
All properties solved by simple procedures.
Total runtime 9496 ms.

BK_STOP 1652628982356

--------------------
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="DiscoveryGPU-PT-08b"
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 DiscoveryGPU-PT-08b, 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 r078-tall-165260109800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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