About the Execution of ITS-Tools for UtilityControlRoom-PT-Z2T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 368.703 | 36670.00 | 64673.00 | 406.10 | TTTFFFFFFFTFFFTF | normal |
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.r276-smll-165307353000172.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 UtilityControlRoom-PT-Z2T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353000172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 28K Apr 29 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 29 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 29 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 29 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 116K 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 UtilityControlRoom-PT-Z2T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653146782090
Running Version 202205111006
[2022-05-21 15:26:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-21 15:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 15:26:24] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-05-21 15:26:24] [INFO ] Transformed 174 places.
[2022-05-21 15:26:24] [INFO ] Transformed 270 transitions.
[2022-05-21 15:26:24] [INFO ] Parsed PT model containing 174 places and 270 transitions in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2022-05-21 15:26:24] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 135 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 18 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 15:26:24] [INFO ] Computed 23 place invariants in 22 ms
[2022-05-21 15:26:24] [INFO ] Implicit Places using invariants in 282 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 173/174 places, 230/230 transitions.
Support contains 135 out of 173 places after structural reductions.
[2022-05-21 15:26:25] [INFO ] Flatten gal took : 72 ms
[2022-05-21 15:26:25] [INFO ] Flatten gal took : 37 ms
[2022-05-21 15:26:25] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 126 out of 173 places (down from 135) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 15:26:25] [INFO ] Computed 22 place invariants in 9 ms
[2022-05-21 15:26:25] [INFO ] After 67ms 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.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(p1)))'
Support contains 53 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 21 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:26] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:26] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:26] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 15:26:26] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:26] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:26] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s87 1) (LT s120 1)) (OR (LT s84 1) (LT s119 1)) (OR (LT s72 1) (LT s113 1)) (OR (LT s82 1) (LT s118 1)) (OR (LT s74 1) (LT s114 1)) (OR (L...], 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]]
Product exploration explored 100000 steps with 50000 reset in 862 ms.
Product exploration explored 100000 steps with 50000 reset in 788 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-00 finished in 2650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 15:26:28] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-21 15:26:29] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 15:26:29] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 15:26:29] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 15:26:29] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 15:26:29] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 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 (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s77 1) (LT...], 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]]
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Product exploration explored 100000 steps with 33333 reset in 285 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 51 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-01 finished in 1320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 53 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 15 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:30] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-21 15:26:30] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:30] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 15:26:30] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:30] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 15:26:30] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s27 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ ...], 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]]
Product exploration explored 100000 steps with 18890 reset in 613 ms.
Product exploration explored 100000 steps with 18931 reset in 713 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 350 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 363 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:33] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:33] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2022-05-21 15:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:26:33] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-05-21 15:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:26:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2022-05-21 15:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:26:34] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-21 15:26:34] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-21 15:26:34] [INFO ] Added : 110 causal constraints over 22 iterations in 528 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 23 out of 153 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 : 153/153 places, 210/210 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 133 transition count 190
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 133 transition count 170
Applied a total of 60 rules in 31 ms. Remains 133 /153 variables (removed 20) and now considering 170/210 (removed 40) transitions.
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 15:26:34] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:34] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 15:26:34] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:35] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-21 15:26:35] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 15:26:35] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:35] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/153 places, 170/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/153 places, 170/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 15:26:35] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:35] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2022-05-21 15:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:26:35] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-21 15:26:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:26:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2022-05-21 15:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:26:36] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2022-05-21 15:26:36] [INFO ] Computed and/alt/rep : 160/250/160 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-21 15:26:36] [INFO ] Added : 104 causal constraints over 21 iterations in 378 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18993 reset in 503 ms.
Product exploration explored 100000 steps with 19014 reset in 519 ms.
Built C files in :
/tmp/ltsmin12728879347011922474
[2022-05-21 15:26:37] [INFO ] Computing symmetric may disable matrix : 170 transitions.
[2022-05-21 15:26:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:26:37] [INFO ] Computing symmetric may enable matrix : 170 transitions.
[2022-05-21 15:26:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:26:37] [INFO ] Computing Do-Not-Accords matrix : 170 transitions.
[2022-05-21 15:26:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:26:37] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12728879347011922474
Running compilation step : cd /tmp/ltsmin12728879347011922474;'/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 670 ms.
Running link step : cd /tmp/ltsmin12728879347011922474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin12728879347011922474;'/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/stateBased5539703424004108563.hoa' '--buchi-type=spotba'
LTSmin run took 2289 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-02 finished in 10698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((X(p0)||!p0))&&X(p1)))))'
Support contains 43 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 143 transition count 200
Applied a total of 60 rules in 25 ms. Remains 143 /173 variables (removed 30) and now considering 200/230 (removed 30) transitions.
// Phase 1: matrix 200 rows 143 cols
[2022-05-21 15:26:40] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:41] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 200 rows 143 cols
[2022-05-21 15:26:41] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-21 15:26:41] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-05-21 15:26:41] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 200 rows 143 cols
[2022-05-21 15:26:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:41] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/173 places, 200/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/173 places, 200/230 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s29 1) (GEQ s28 1) (GEQ s31 1) (GEQ s30 1) (GEQ s33 1) (GEQ s32 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 9021 reset in 387 ms.
Product exploration explored 100000 steps with 8947 reset in 417 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 347 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 396 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 43 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 200/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 143 /143 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 143 cols
[2022-05-21 15:26:43] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:43] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 200 rows 143 cols
[2022-05-21 15:26:43] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:43] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2022-05-21 15:26:43] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 200 rows 143 cols
[2022-05-21 15:26:43] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:44] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 394 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), false, (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9054 reset in 390 ms.
Product exploration explored 100000 steps with 8913 reset in 409 ms.
Built C files in :
/tmp/ltsmin18326983466804542613
[2022-05-21 15:26:46] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2022-05-21 15:26:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:26:46] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2022-05-21 15:26:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:26:46] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2022-05-21 15:26:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:26:46] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18326983466804542613
Running compilation step : cd /tmp/ltsmin18326983466804542613;'/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 587 ms.
Running link step : cd /tmp/ltsmin18326983466804542613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18326983466804542613;'/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/stateBased627483847407816861.hoa' '--buchi-type=spotba'
LTSmin run took 333 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-03 finished in 6325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 183 place count 91 transition count 110
Applied a total of 183 rules in 25 ms. Remains 91 /173 variables (removed 82) and now considering 110/230 (removed 120) transitions.
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 15:26:47] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 15:26:47] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 15:26:47] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-21 15:26:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-05-21 15:26:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 15:26:47] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 15:26:47] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/173 places, 110/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/173 places, 110/230 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s59 1) (GEQ s85 1)) (AND (GEQ s64 1) (GEQ s87 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s69 1) (GEQ s90 1)) (AND (GEQ s57 1) (GEQ s84 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5329 reset in 490 ms.
Stack based approach found an accepted trace after 8189 steps with 438 reset with depth 17 and stack size 17 in 41 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-04 finished in 936 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((p0 U X(p0))) U !X(F(p1)))))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 6 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:48] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:48] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:48] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:48] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 354 ms :[p1, p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p1)), true, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 7}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s72 1) (GEQ s113 1)), p0:(AND (GEQ s0 1) (GEQ s20 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 642 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-08 finished in 806 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F((G(p0) U !G(p0)))))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 6 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:49] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:49] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-21 15:26:49] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:49] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=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 (GEQ s74 1) (GEQ s114 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]]
Product exploration explored 100000 steps with 33333 reset in 204 ms.
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-10 finished in 1064 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||p1) U p2)))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Applied a total of 38 rules in 4 ms. Remains 154 /173 variables (removed 19) and now considering 211/230 (removed 19) transitions.
// Phase 1: matrix 211 rows 154 cols
[2022-05-21 15:26:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:50] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 211 rows 154 cols
[2022-05-21 15:26:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:50] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
// Phase 1: matrix 211 rows 154 cols
[2022-05-21 15:26:50] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 15:26:50] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 211/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/173 places, 211/230 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LT s116 1), p1:(GEQ s3 1), p0:(GEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 10 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-11 finished in 924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(p1)||p0))&&X(X(!p1)))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 3 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:51] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:51] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:51] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:51] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:51] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, false, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s28 1) (LT s102 1)), p1:(LT s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1114 reset in 219 ms.
Product exploration explored 100000 steps with 1115 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 385 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 215 ms :[p1, (AND (NOT p0) (NOT p1)), p1, false, p1]
Finished random walk after 3943 steps, including 1 resets, run visited all 3 properties in 48 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 472 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[p1, (AND (NOT p0) (NOT p1)), p1, false, p1]
Stuttering acceptance computed with spot in 192 ms :[p1, (AND (NOT p0) (NOT p1)), p1, false, p1]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:54] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:54] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned unsat
Proved EG p1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-12 finished in 3479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&G(X(p1))&&p2)))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Applied a total of 38 rules in 10 ms. Remains 154 /173 variables (removed 19) and now considering 211/230 (removed 19) transitions.
// Phase 1: matrix 211 rows 154 cols
[2022-05-21 15:26:54] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:54] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 211 rows 154 cols
[2022-05-21 15:26:54] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:54] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 211 rows 154 cols
[2022-05-21 15:26:54] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:55] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 211/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/173 places, 211/230 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(LT s105 1), p0:(AND (GEQ s89 1) (GEQ s132 1)), p1:(LT s68 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-13 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(G(p1)&&p2))))'
Support contains 7 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 5 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:55] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:55] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:55] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:55] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 15:26:55] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:55] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s20 1) (LT s102 1)), p1:(LT s96 1), p0:(OR (LT s0 1) (LT s12 1) (LT s102 1) (AND (GEQ s0 1) (GEQ s29 1) (GEQ s102 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Product exploration explored 100000 steps with 50000 reset in 416 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0)
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-14 finished in 2031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||p1)))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 178 place count 94 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 93 transition count 130
Applied a total of 180 rules in 31 ms. Remains 93 /173 variables (removed 80) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 93 cols
[2022-05-21 15:26:57] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:57] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 130 rows 93 cols
[2022-05-21 15:26:57] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 15:26:57] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2022-05-21 15:26:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 93 cols
[2022-05-21 15:26:57] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 15:26:58] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/173 places, 130/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/173 places, 130/230 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s52 1)), p0:(GEQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6485 reset in 386 ms.
Stack based approach found an accepted trace after 972 steps with 76 reset with depth 5 and stack size 5 in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLFireability-15 finished in 1339 ms.
All properties solved by simple procedures.
Total runtime 34679 ms.
BK_STOP 1653146818760
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="UtilityControlRoom-PT-Z2T3N10"
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-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T3N10, 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 r276-smll-165307353000172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N10.tgz
mv UtilityControlRoom-PT-Z2T3N10 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 ;