Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599600668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 SharedMemory-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599600668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 22K Apr 30 10:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 30 10:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 53K Apr 30 10:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 238K Apr 30 10:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 104K 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 SharedMemory-PT-000010-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652982232079

Running Version 202205111006
[2022-05-19 17:43:53] [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-19 17:43:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:43:53] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-19 17:43:53] [INFO ] Transformed 131 places.
[2022-05-19 17:43:53] [INFO ] Transformed 210 transitions.
[2022-05-19 17:43:53] [INFO ] Found NUPN structural information;
[2022-05-19 17:43:53] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_10_6, Ext_Mem_Acc_8_7]
[2022-05-19 17:43:53] [INFO ] Parsed PT model containing 131 places and 210 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:53] [INFO ] Computed 21 place invariants in 18 ms
[2022-05-19 17:43:53] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:53] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-19 17:43:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:54] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:43:54] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2022-05-19 17:43:54] [INFO ] Flatten gal took : 42 ms
[2022-05-19 17:43:54] [INFO ] Flatten gal took : 21 ms
[2022-05-19 17:43:54] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:54] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:43:54] [INFO ] After 34ms 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 1 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 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' '!(X((G(p1)||p0)))'
Support contains 20 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:55] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:43:55] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:55] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:43:55] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:55] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:43:55] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (EQ s96 0) (EQ s127 0)) (OR (EQ s100 0) (EQ s117 0)) (OR (EQ s97 0) (EQ s126 0)) (OR (EQ s99 0) (EQ s118 0)) (OR (EQ s98 0) (EQ s125 0)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 3 steps with 0 reset in 2 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-00 finished in 722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:56] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:43:56] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:56] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:43:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:56] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:43:56] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s85 1) (EQ s97 1) (EQ s109 1)) (AND (EQ s85 1) (EQ s88 1) (EQ s121 1)) (AND (EQ s85 1) (EQ s97 1) (EQ s111 1)) (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][false, false]]
Product exploration explored 100000 steps with 32095 reset in 586 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-01 finished in 922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:56] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-19 17:43:57] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:57] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-19 17:43:57] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:57] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-19 17:43:57] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s115 1) (EQ s101 1) (EQ s103 1) (EQ s116 1) (EQ s102 1) (EQ s106 1) (EQ s107 1) (EQ s104 1) (EQ s105 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 216 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000010-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000010-LTLFireability-02 finished in 932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((true U !p0)&&F(p1)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 20 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:57] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:43:57] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:57] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:43:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-19 17:43:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:58] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-19 17:43:58] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 134 ms :[p0, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s115 1) (EQ s101 1) (EQ s116 1) (EQ s103 1) (EQ s102 1) (EQ s106 1) (EQ s104 1) (EQ s107 1) (EQ s105 1) (EQ s108 1)), p1:(OR (EQ s115 1) (EQ s1...], 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]]
Product exploration explored 100000 steps with 3299 reset in 245 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-03 finished in 663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||F(p2)))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:58] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:43:58] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:58] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:43:58] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:58] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:43:58] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s115 0) (EQ s101 0) (EQ s116 0) (EQ s103 0) (EQ s102 0) (EQ s106 0) (EQ s104 0) (EQ s107 0) (EQ s105 0) (EQ s108 0)), p1:(OR (AND (EQ s96 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 3304 reset in 269 ms.
Stack based approach found an accepted trace after 132 steps with 5 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-04 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:59] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:43:59] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:59] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:43:59] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:43:59] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:43:59] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(OR (EQ s115 1) (EQ s101 1) (EQ s103 1) (EQ s116 1) (EQ s102 1) (EQ s106 1) (EQ s107 1) (EQ s104 1) (EQ s105 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 206 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000010-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000010-LTLFireability-05 finished in 995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G((!p0 U p1)) U G((p2 U X(p0)))))'
Support contains 121 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:00] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:00] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:00] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:44:00] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:00] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:00] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), p1]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=p2, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (EQ s85 1) (EQ s97 1) (EQ s109 1)) (AND (EQ s85 1) (EQ s88 1) (EQ s121 1)) (AND (EQ s85 1) (EQ s97 1) (EQ s111 1)) (AND (EQ s85 1) (EQ s98 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 19130 reset in 1134 ms.
Stack based approach found an accepted trace after 120 steps with 25 reset with depth 18 and stack size 18 in 2 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-06 finished in 1603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 13 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:01] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:01] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:01] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:01] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-05-19 17:44:01] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:01] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:02] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s96 1) (EQ s127 1)) (AND (EQ s100 1) (EQ s117 1)) (AND (EQ s97 1) (EQ s126 1)) (AND (EQ s99 1) (EQ s118 1)) (AND (EQ s98 1) (EQ s125 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5742 reset in 338 ms.
Stack based approach found an accepted trace after 7051 steps with 351 reset with depth 74 and stack size 70 in 26 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-07 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X(X(p0))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:02] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:44:02] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:02] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-19 17:44:02] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:02] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:02] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s105 1), p0:(AND (EQ s88 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-08 finished in 567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))&&(!(p2 U p3)||p1)))))'
Support contains 8 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 13 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:03] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:03] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:03] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:44:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-19 17:44:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:03] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:03] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) p3)), (NOT p0), (AND (NOT p1) p3)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s98 0) (EQ s125 0)), p1:(OR (EQ s85 0) (EQ s94 0) (EQ s122 0)), p3:(EQ s104 1), p2:(AND (EQ s85 1) (EQ s100 1) (EQ s112 1))], nbAcceptance=1, 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 2583 reset in 306 ms.
Stack based approach found an accepted trace after 521 steps with 10 reset with depth 8 and stack size 8 in 3 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-09 finished in 722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(F(p1)||G(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:03] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:03] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:03] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:03] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:03] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:04] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s52 1), p0:(EQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 432 reset in 317 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-10 finished in 736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:04] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:04] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:04] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:44:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2022-05-19 17:44:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:04] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:44:04] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s85 0) (EQ s97 0) (EQ s113 0))], 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 2613 reset in 268 ms.
Stack based approach found an accepted trace after 14068 steps with 393 reset with depth 8 and stack size 8 in 39 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-11 finished in 652 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&(p0 U X((F(G(p2))||p2)))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:05] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:05] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:05] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:44:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:05] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 17:44:05] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s85 1) (EQ s87 1) (EQ s109 1))) (EQ s116 1)), p0:(AND (EQ s85 1) (EQ s87 1) (EQ s109 1)), p2:(EQ s116 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 24 reset in 330 ms.
Stack based approach found an accepted trace after 38 steps with 10 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-12 finished in 832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(!p0 U F(!p1))))'
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:44:06] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:44:06] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-05-19 17:44:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:06] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (AND (EQ s85 1) (EQ s88 1) (EQ s112 1)) (AND (EQ s95 1) (EQ s128 1))) (NEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 358 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-13 finished in 687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||p1)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:06] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 17:44:06] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 17:44:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 17:44:07] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s116 1), p0:(OR (EQ s85 0) (EQ s97 0) (EQ s109 0))], 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 47 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-14 finished in 436 ms.
All properties solved by simple procedures.
Total runtime 13830 ms.

BK_STOP 1652982247267

--------------------
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="SharedMemory-PT-000010"
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 SharedMemory-PT-000010, 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 r204-oct2-165281599600668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;