About the Execution of ITS-Tools for IBM319-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 445.096 | 10437.00 | 19257.00 | 341.40 | FTFTTFFFFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856412700076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is IBM319-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856412700076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 16K Feb 26 18:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 18:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 18:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 184K Mar 5 18:22 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-LTLFireability-00
FORMULA_NAME IBM319-PT-none-LTLFireability-01
FORMULA_NAME IBM319-PT-none-LTLFireability-02
FORMULA_NAME IBM319-PT-none-LTLFireability-03
FORMULA_NAME IBM319-PT-none-LTLFireability-04
FORMULA_NAME IBM319-PT-none-LTLFireability-05
FORMULA_NAME IBM319-PT-none-LTLFireability-06
FORMULA_NAME IBM319-PT-none-LTLFireability-07
FORMULA_NAME IBM319-PT-none-LTLFireability-08
FORMULA_NAME IBM319-PT-none-LTLFireability-09
FORMULA_NAME IBM319-PT-none-LTLFireability-10
FORMULA_NAME IBM319-PT-none-LTLFireability-11
FORMULA_NAME IBM319-PT-none-LTLFireability-12
FORMULA_NAME IBM319-PT-none-LTLFireability-13
FORMULA_NAME IBM319-PT-none-LTLFireability-14
FORMULA_NAME IBM319-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679439702928
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-21 23:01:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 23:01:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:01:44] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-21 23:01:44] [INFO ] Transformed 253 places.
[2023-03-21 23:01:44] [INFO ] Transformed 178 transitions.
[2023-03-21 23:01:44] [INFO ] Found NUPN structural information;
[2023-03-21 23:01:44] [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]
[2023-03-21 23:01:44] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBM319-PT-none-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 61 places
Reduce places removed 69 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 183 transition count 178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 175 transition count 170
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 175 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 173 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 173 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 172 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 172 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 171 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 171 transition count 166
Applied a total of 94 rules in 46 ms. Remains 171 /253 variables (removed 82) and now considering 166/178 (removed 12) transitions.
// Phase 1: matrix 166 rows 171 cols
[2023-03-21 23:01:44] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-21 23:01:45] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-21 23:01:45] [INFO ] Invariant cache hit.
[2023-03-21 23:01:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-21 23:01:45] [INFO ] Invariant cache hit.
[2023-03-21 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 171/253 places, 166/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 171/253 places, 166/178 transitions.
Support contains 49 out of 171 places after structural reductions.
[2023-03-21 23:01:45] [INFO ] Flatten gal took : 30 ms
[2023-03-21 23:01:45] [INFO ] Flatten gal took : 11 ms
[2023-03-21 23:01:45] [INFO ] Input system was already deterministic with 166 transitions.
Support contains 45 out of 171 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:01:45] [INFO ] Invariant cache hit.
[2023-03-21 23:01:45] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-21 23:01:45] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM319-PT-none-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 171 stabilizing places and 166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 171 transition count 166
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 157 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 153 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 153 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 153 transition count 161
Applied a total of 23 rules in 15 ms. Remains 153 /171 variables (removed 18) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 153 cols
[2023-03-21 23:01:46] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-21 23:01:46] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-21 23:01:46] [INFO ] Invariant cache hit.
[2023-03-21 23:01:46] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-21 23:01:46] [INFO ] Invariant cache hit.
[2023-03-21 23:01:46] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/171 places, 161/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 153/171 places, 161/166 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s66 1) (EQ s127 1)) (AND (EQ s82 1) (EQ s86 1) (EQ s122 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-00 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Graph (complete) has 204 edges and 171 vertex of which 124 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Discarding 47 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Ensure Unique test removed 12 places
Reduce places removed 13 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 111 transition count 46
Reduce places removed 72 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 81 rules applied. Total rules applied 154 place count 39 transition count 37
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 161 place count 33 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 32 transition count 36
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 162 place count 32 transition count 26
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 184 place count 20 transition count 26
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 186 place count 19 transition count 25
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 189 place count 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 17 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 190 place count 17 transition count 22
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 192 place count 16 transition count 22
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 198 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 199 place count 13 transition count 17
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 201 place count 12 transition count 17
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 204 place count 12 transition count 14
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 209 place count 12 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 210 place count 12 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 211 place count 12 transition count 13
Applied a total of 211 rules in 22 ms. Remains 12 /171 variables (removed 159) and now considering 13/166 (removed 153) transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-03-21 23:01:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 23:01:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-21 23:01:46] [INFO ] Invariant cache hit.
[2023-03-21 23:01:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-21 23:01:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:01:46] [INFO ] Invariant cache hit.
[2023-03-21 23:01:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/171 places, 13/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 12/171 places, 13/166 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-02 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 (AND (EQ s9 1) (EQ s10 1)) (AND (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 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 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-02 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||G(p2)||p0))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 158 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 154 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 154 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 154 transition count 161
Applied a total of 22 rules in 11 ms. Remains 154 /171 variables (removed 17) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 154 cols
[2023-03-21 23:01:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-21 23:01:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-21 23:01:46] [INFO ] Invariant cache hit.
[2023-03-21 23:01:47] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-21 23:01:47] [INFO ] Invariant cache hit.
[2023-03-21 23:01:47] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/171 places, 161/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 154/171 places, 161/166 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s57 0) (EQ s144 0)), p0:(OR (EQ s67 0) (EQ s128 0)), p2:(EQ s33 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 154 stabilizing places and 161 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 154 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 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 286 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM319-PT-none-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-04 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 157 transition count 166
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 154 transition count 163
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 154 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 154 transition count 162
Applied a total of 21 rules in 11 ms. Remains 154 /171 variables (removed 17) and now considering 162/166 (removed 4) transitions.
// Phase 1: matrix 162 rows 154 cols
[2023-03-21 23:01:47] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 23:01:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-21 23:01:47] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/171 places, 162/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 154/171 places, 162/166 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s85 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-05 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 156 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 152 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 152 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 152 transition count 161
Applied a total of 24 rules in 6 ms. Remains 152 /171 variables (removed 19) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 152 cols
[2023-03-21 23:01:48] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/171 places, 161/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 152/171 places, 161/166 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s32 1), p0:(EQ s74 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]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-06 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 157 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 153 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 153 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 153 transition count 161
Applied a total of 23 rules in 3 ms. Remains 153 /171 variables (removed 18) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 153 cols
[2023-03-21 23:01:48] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/171 places, 161/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 153/171 places, 161/166 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s85 1) (EQ s98 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 22 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-07 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1||X((p1&&X(G(p2))))))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Graph (complete) has 204 edges and 171 vertex of which 147 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Ensure Unique test removed 14 places
Reduce places removed 15 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 132 transition count 57
Reduce places removed 87 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 96 rules applied. Total rules applied 185 place count 45 transition count 48
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 192 place count 39 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 193 place count 38 transition count 47
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 193 place count 38 transition count 34
Deduced a syphon composed of 13 places in 1 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 221 place count 23 transition count 34
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 22 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 222 place count 22 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 20 transition count 32
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 20 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 20 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 227 place count 20 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 19 transition count 30
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 6 with 16 rules applied. Total rules applied 245 place count 11 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 248 place count 11 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 252 place count 9 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 255 place count 9 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 257 place count 9 transition count 14
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 260 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 261 place count 9 transition count 13
Applied a total of 261 rules in 16 ms. Remains 9 /171 variables (removed 162) and now considering 13/166 (removed 153) transitions.
// Phase 1: matrix 13 rows 9 cols
[2023-03-21 23:01:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-21 23:01:48] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-21 23:01:48] [INFO ] Invariant cache hit.
[2023-03-21 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/171 places, 13/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 9/171 places, 13/166 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s1 1), p0:(EQ s4 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-08 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Graph (complete) has 204 edges and 171 vertex of which 112 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.1 ms
Discarding 59 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Ensure Unique test removed 12 places
Reduce places removed 13 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 99 transition count 39
Reduce places removed 68 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 77 rules applied. Total rules applied 146 place count 31 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 25 transition count 30
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 152 place count 25 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 170 place count 15 transition count 22
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 3 with 2 rules applied. Total rules applied 172 place count 14 transition count 21
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 175 place count 13 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 12 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 176 place count 12 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 178 place count 11 transition count 18
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 188 place count 6 transition count 11
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 191 place count 6 transition count 8
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 7 with 2 rules applied. Total rules applied 193 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 195 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 196 place count 5 transition count 5
Applied a total of 196 rules in 11 ms. Remains 5 /171 variables (removed 166) and now considering 5/166 (removed 161) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-21 23:01:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 23:01:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 23:01:49] [INFO ] Invariant cache hit.
[2023-03-21 23:01:49] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-21 23:01:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:01:49] [INFO ] Invariant cache hit.
[2023-03-21 23:01:49] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/171 places, 5/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 5/171 places, 5/166 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s0 1), p1:(AND (EQ s2 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-09 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(G(p2))&&(!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 157 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 153 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 153 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 153 transition count 161
Applied a total of 23 rules in 7 ms. Remains 153 /171 variables (removed 18) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 153 cols
[2023-03-21 23:01:49] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-21 23:01:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 23:01:49] [INFO ] Invariant cache hit.
[2023-03-21 23:01:49] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-21 23:01:49] [INFO ] Invariant cache hit.
[2023-03-21 23:01:49] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/171 places, 161/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 153/171 places, 161/166 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s3 1), p1:(AND (NEQ s3 1) (NOT (AND (EQ s85 1) (EQ s103 1)))), p2:(NEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2055 reset in 158 ms.
Product exploration explored 100000 steps with 2025 reset in 109 ms.
Computed a total of 153 stabilizing places and 161 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 153 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 (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 11 factoid took 251 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM319-PT-none-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-11 finished in 996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(G(p1)))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Graph (complete) has 204 edges and 171 vertex of which 115 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Ensure Unique test removed 12 places
Reduce places removed 13 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 102 transition count 41
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 74 rules applied. Total rules applied 143 place count 34 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 30 transition count 35
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 147 place count 30 transition count 26
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 167 place count 19 transition count 26
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 3 with 2 rules applied. Total rules applied 169 place count 18 transition count 25
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 4 with 3 rules applied. Total rules applied 172 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 173 place count 16 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 173 place count 16 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 177 place count 14 transition count 21
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 187 place count 9 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 191 place count 9 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 7 with 2 rules applied. Total rules applied 193 place count 8 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 8 transition count 9
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 196 place count 7 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 197 place count 7 transition count 8
Applied a total of 197 rules in 13 ms. Remains 7 /171 variables (removed 164) and now considering 8/166 (removed 158) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-21 23:01:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:01:50] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-21 23:01:50] [INFO ] Invariant cache hit.
[2023-03-21 23:01:50] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-21 23:01:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:01:50] [INFO ] Invariant cache hit.
[2023-03-21 23:01:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/171 places, 8/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 7/171 places, 8/166 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : IBM319-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s0 1) (EQ s5 1)) (AND (EQ s2 1) (EQ s4 1))), p0:(AND (EQ s2 1) (EQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 27621 reset in 177 ms.
Product exploration explored 100000 steps with 27562 reset in 191 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 8
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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 9 factoid took 409 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM319-PT-none-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-12 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U p1))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Graph (complete) has 204 edges and 171 vertex of which 56 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.2 ms
Discarding 115 places :
Also discarding 117 output transitions
Drop transitions removed 117 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 47 transition count 16
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 15 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 13 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 13 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 10 transition count 10
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 3 with 2 rules applied. Total rules applied 78 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 79 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 7 transition count 8
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 5 with 2 rules applied. Total rules applied 83 place count 6 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 6 transition count 6
Applied a total of 85 rules in 7 ms. Remains 6 /171 variables (removed 165) and now considering 6/166 (removed 160) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-21 23:01:51] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-21 23:01:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/171 places, 6/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 6/171 places, 6/166 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), p0]
Running random walk in product with property : IBM319-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s4 1)), p0:(AND (EQ s0 1) (EQ s5 1))], nbAcceptance=0, 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 5 steps with 1 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-13 finished in 150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 157 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 153 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 153 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 153 transition count 161
Applied a total of 23 rules in 4 ms. Remains 153 /171 variables (removed 18) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 153 cols
[2023-03-21 23:01:51] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/171 places, 161/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 153/171 places, 161/166 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s28 1), p0:(AND (EQ s85 1) (EQ s98 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 20 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-14 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((!p1 U (p2||G(!p1))))&&p0))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 166/166 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 159 transition count 166
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 156 transition count 163
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 156 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 156 transition count 162
Applied a total of 19 rules in 7 ms. Remains 156 /171 variables (removed 15) and now considering 162/166 (removed 4) transitions.
// Phase 1: matrix 162 rows 156 cols
[2023-03-21 23:01:51] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:52] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/171 places, 162/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 156/171 places, 162/166 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s128 1) (OR (NEQ s85 1) (NEQ s89 1))), p2:(AND (NOT (AND (EQ s65 1) (EQ s130 1))) (NOT (AND (EQ s85 1) (EQ s89 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-15 finished in 368 ms.
All properties solved by simple procedures.
Total runtime 7822 ms.
BK_STOP 1679439713365
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is IBM319-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-167856412700076"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;