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.r132-tall-165271820400075.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 IBM319-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 11K Apr 29 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 16:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 184K May 10 09:34 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 IBM319-PT-none-LTLCardinality-00
FORMULA_NAME IBM319-PT-none-LTLCardinality-01
FORMULA_NAME IBM319-PT-none-LTLCardinality-02
FORMULA_NAME IBM319-PT-none-LTLCardinality-03
FORMULA_NAME IBM319-PT-none-LTLCardinality-04
FORMULA_NAME IBM319-PT-none-LTLCardinality-05
FORMULA_NAME IBM319-PT-none-LTLCardinality-06
FORMULA_NAME IBM319-PT-none-LTLCardinality-07
FORMULA_NAME IBM319-PT-none-LTLCardinality-08
FORMULA_NAME IBM319-PT-none-LTLCardinality-09
FORMULA_NAME IBM319-PT-none-LTLCardinality-10
FORMULA_NAME IBM319-PT-none-LTLCardinality-11
FORMULA_NAME IBM319-PT-none-LTLCardinality-12
FORMULA_NAME IBM319-PT-none-LTLCardinality-13
FORMULA_NAME IBM319-PT-none-LTLCardinality-14
FORMULA_NAME IBM319-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652744985676

Running Version 202205111006
[2022-05-16 23:49:46] [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 23:49:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:49:47] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-05-16 23:49:47] [INFO ] Transformed 253 places.
[2022-05-16 23:49:47] [INFO ] Transformed 178 transitions.
[2022-05-16 23:49:47] [INFO ] Found NUPN structural information;
[2022-05-16 23:49:47] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2022-05-16 23:49:47] [INFO ] Parsed PT model containing 253 places and 178 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IBM319-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 76 places
Reduce places removed 84 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 168 transition count 178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 96 place count 157 transition count 167
Iterating global reduction 1 with 11 rules applied. Total rules applied 107 place count 157 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 157 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 156 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 156 transition count 165
Applied a total of 110 rules in 46 ms. Remains 156 /253 variables (removed 97) and now considering 165/178 (removed 13) transitions.
// Phase 1: matrix 165 rows 156 cols
[2022-05-16 23:49:47] [INFO ] Computed 3 place invariants in 12 ms
[2022-05-16 23:49:47] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 165 rows 156 cols
[2022-05-16 23:49:47] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-16 23:49:47] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 156 cols
[2022-05-16 23:49:47] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-16 23:49:47] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/253 places, 165/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/253 places, 165/178 transitions.
Support contains 22 out of 156 places after structural reductions.
[2022-05-16 23:49:47] [INFO ] Flatten gal took : 46 ms
[2022-05-16 23:49:47] [INFO ] Flatten gal took : 14 ms
[2022-05-16 23:49:48] [INFO ] Input system was already deterministic with 165 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 165 rows 156 cols
[2022-05-16 23:49:48] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 23:49:48] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 23:49:48] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 23:49:48] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA IBM319-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 156 stabilizing places and 165 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 165
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 165/165 transitions.
Graph (complete) has 173 edges and 156 vertex of which 127 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.4 ms
Discarding 29 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 126 transition count 53
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 181 place count 41 transition count 44
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 188 place count 35 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 34 transition count 43
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 189 place count 34 transition count 30
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 217 place count 19 transition count 30
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 18 transition count 29
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 5 with 3 rules applied. Total rules applied 222 place count 17 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 16 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 223 place count 16 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 225 place count 15 transition count 26
Performed 8 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 241 place count 7 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 245 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 247 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 248 place count 6 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 249 place count 6 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 249 place count 6 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 251 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 252 place count 5 transition count 7
Applied a total of 252 rules in 20 ms. Remains 5 /156 variables (removed 151) and now considering 7/165 (removed 158) transitions.
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:49:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:49:49] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:49:49] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:49:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-16 23:49:49] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:49:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:49:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/156 places, 7/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/156 places, 7/165 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s3 0) (NEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLCardinality-05 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X((G(p1)||(p1 U p0)))&&p1)))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 165/165 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 154 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 154 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 152 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 152 transition count 161
Applied a total of 8 rules in 24 ms. Remains 152 /156 variables (removed 4) and now considering 161/165 (removed 4) transitions.
// Phase 1: matrix 161 rows 152 cols
[2022-05-16 23:49:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:49:49] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2022-05-16 23:49:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:49:49] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2022-05-16 23:49:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:49:49] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/156 places, 161/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/156 places, 161/165 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IBM319-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s137 0) (EQ s87 1)), p0:(OR (EQ s9 0) (EQ s30 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 152 stabilizing places and 161 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 152 transition count 161
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 14 factoid took 236 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM319-PT-none-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLCardinality-06 finished in 1230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(X(F(p0))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 165/165 transitions.
Graph (complete) has 173 edges and 156 vertex of which 74 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.1 ms
Discarding 82 places :
Also discarding 86 output transitions
Drop transitions removed 86 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 73 transition count 31
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 55 rules applied. Total rules applied 103 place count 27 transition count 22
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 21 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 20 transition count 21
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 111 place count 20 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 127 place count 11 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 10 transition count 13
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 5 with 3 rules applied. Total rules applied 132 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 133 place count 8 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 133 place count 8 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 135 place count 7 transition count 10
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 7 with 4 rules applied. Total rules applied 139 place count 5 transition count 7
Applied a total of 139 rules in 15 ms. Remains 5 /156 variables (removed 151) and now considering 7/165 (removed 158) transitions.
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:49:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:49:50] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:49:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:49:50] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 23:49:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 23:49:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:49:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/156 places, 7/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/156 places, 7/165 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLCardinality-07 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:(AND (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLCardinality-07 finished in 190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 165/165 transitions.
Graph (complete) has 173 edges and 156 vertex of which 116 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 115 transition count 53
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 44 transition count 44
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 160 place count 38 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 36 transition count 42
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 162 place count 36 transition count 29
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 190 place count 21 transition count 29
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 192 place count 20 transition count 28
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 5 with 3 rules applied. Total rules applied 195 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 196 place count 18 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 196 place count 18 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 198 place count 17 transition count 25
Performed 6 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 210 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 211 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 213 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 214 place count 10 transition count 14
Applied a total of 214 rules in 15 ms. Remains 10 /156 variables (removed 146) and now considering 14/165 (removed 151) transitions.
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 23:49:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:49:50] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 23:49:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:49:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 23:49:50] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 23:49:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:49:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/156 places, 14/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/156 places, 14/165 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s9 1)), p0:(OR (EQ s5 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25936 reset in 142 ms.
Product exploration explored 100000 steps with 25777 reset in 112 ms.
Computed a total of 10 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 7 factoid took 662 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 18 steps, including 5 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 23:49:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:49:52] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 23:49:52] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 23:49:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 23:49:52] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 23:49:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:49:52] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 14/14 transitions.
Computed a total of 10 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 10 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 404 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25922 reset in 62 ms.
Product exploration explored 100000 steps with 25881 reset in 117 ms.
Built C files in :
/tmp/ltsmin15337544740683471291
[2022-05-16 23:49:53] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2022-05-16 23:49:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:53] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2022-05-16 23:49:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:53] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2022-05-16 23:49:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15337544740683471291
Running compilation step : cd /tmp/ltsmin15337544740683471291;'/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 274 ms.
Running link step : cd /tmp/ltsmin15337544740683471291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15337544740683471291;'/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/stateBased118491982321943860.hoa' '--buchi-type=spotba'
LTSmin run took 63 ms.
FORMULA IBM319-PT-none-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM319-PT-none-LTLCardinality-08 finished in 3480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G(p0))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 165/165 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 154 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 154 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 152 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 152 transition count 161
Applied a total of 8 rules in 18 ms. Remains 152 /156 variables (removed 4) and now considering 161/165 (removed 4) transitions.
// Phase 1: matrix 161 rows 152 cols
[2022-05-16 23:49:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:49:54] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2022-05-16 23:49:54] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 23:49:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2022-05-16 23:49:54] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-16 23:49:54] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/156 places, 161/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/156 places, 161/165 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s142 0) (EQ s117 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLCardinality-13 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))&&p1&&(!(p1 U p2)||p3))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 165/165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 154 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 154 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 162
Applied a total of 6 rules in 19 ms. Remains 153 /156 variables (removed 3) and now considering 162/165 (removed 3) transitions.
// Phase 1: matrix 162 rows 153 cols
[2022-05-16 23:49:54] [INFO ] Computed 3 place invariants in 21 ms
[2022-05-16 23:49:54] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 162 rows 153 cols
[2022-05-16 23:49:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:49:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 153 cols
[2022-05-16 23:49:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:49:55] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/156 places, 162/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/156 places, 162/165 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, p2, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 p3) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s37 0) (EQ s10 1)), p3:(AND (EQ s63 0) (EQ s84 1)), p2:(OR (EQ s138 0) (EQ s92 1)), p0:(OR (EQ s84 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLCardinality-15 finished in 522 ms.
All properties solved by simple procedures.
Total runtime 8513 ms.

BK_STOP 1652744995753

--------------------
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="IBM319-PT-none"
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 IBM319-PT-none, 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 r132-tall-165271820400075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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