Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098204400005.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-COL-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204400005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 11:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 12K May 5 16:52 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-COL-000005-00
FORMULA_NAME SharedMemory-COL-000005-01
FORMULA_NAME SharedMemory-COL-000005-02
FORMULA_NAME SharedMemory-COL-000005-03
FORMULA_NAME SharedMemory-COL-000005-04
FORMULA_NAME SharedMemory-COL-000005-05
FORMULA_NAME SharedMemory-COL-000005-06
FORMULA_NAME SharedMemory-COL-000005-07
FORMULA_NAME SharedMemory-COL-000005-08
FORMULA_NAME SharedMemory-COL-000005-09
FORMULA_NAME SharedMemory-COL-000005-10
FORMULA_NAME SharedMemory-COL-000005-11
FORMULA_NAME SharedMemory-COL-000005-12
FORMULA_NAME SharedMemory-COL-000005-13
FORMULA_NAME SharedMemory-COL-000005-14
FORMULA_NAME SharedMemory-COL-000005-15

=== Now, execution of the tool begins

BK_START 1621019187265

Running Version 0
[2021-05-14 19:06:28] [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]
[2021-05-14 19:06:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:06:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 19:06:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 19:06:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2021-05-14 19:06:29] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 46 PT places and 85.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 19:06:29] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions in 4 ms.
[2021-05-14 19:06:29] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13410071696856202885.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-14 19:06:29] [INFO ] Flatten gal took : 14 ms
[2021-05-14 19:06:29] [INFO ] Flatten gal took : 1 ms
[2021-05-14 19:06:29] [INFO ] Unfolded HLPN to a Petri net with 46 places and 60 transitions in 7 ms.
[2021-05-14 19:06:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2631710798528075758.dot
[2021-05-14 19:06:29] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 5 transitions.
FORMULA SharedMemory-COL-000005-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 29 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:29] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-14 19:06:29] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:29] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:06:29] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:29] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 19:06:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
[2021-05-14 19:06:29] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 19:06:29] [INFO ] Flatten gal took : 16 ms
FORMULA SharedMemory-COL-000005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 19:06:29] [INFO ] Flatten gal took : 11 ms
[2021-05-14 19:06:29] [INFO ] Input system was already deterministic with 55 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 10 properties in 2 ms. (steps per millisecond=7 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 25 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:29] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-14 19:06:29] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:30] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 19:06:30] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000005-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1)), p1:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7786 reset in 433 ms.
Stack based approach found an accepted trace after 25 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SharedMemory-COL-000005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-00 finished in 879 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:30] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:30] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:30] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:30] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000005-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1) (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s37 1) (LT s36 1) (LT s39 1) (LT s38 1)), p1:(AND (OR (LT s6 1) (LT s14 1) (LT s40 1)) (OR (LT s5 1) (LT s12 1) (LT s40 1)) (OR (LT s7 1) (LT s11 1) (LT s40 1)) (OR (LT s8 1) (LT s11 1) (LT s40 1)) (OR (LT s9 1) (LT s13 1) (LT s40 1)) (OR (LT s7 1) (LT s14 1) (LT s40 1)) (OR (LT s8 1) (LT s10 1) (LT s40 1)) (OR (LT s9 1) (LT s11 1) (LT s40 1)) (OR (LT s5 1) (LT s11 1) (LT s40 1)) (OR (LT s8 1) (LT s14 1) (LT s40 1)) (OR (LT s7 1) (LT s10 1) (LT s40 1)) (OR (LT s5 1) (LT s13 1) (LT s40 1)) (OR (LT s6 1) (LT s13 1) (LT s40 1)) (OR (LT s8 1) (LT s12 1) (LT s40 1)) (OR (LT s6 1) (LT s10 1) (LT s40 1)) (OR (LT s7 1) (LT s13 1) (LT s40 1)) (OR (LT s6 1) (LT s12 1) (LT s40 1)) (OR (LT s9 1) (LT s12 1) (LT s40 1)) (OR (LT s5 1) (LT s14 1) (LT s40 1)) (OR (LT s9 1) (LT s10 1) (LT s40 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA SharedMemory-COL-000005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-01 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 10 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:31] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-14 19:06:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000005-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 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 236 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SharedMemory-COL-000005-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-02 finished in 387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((X((!p0 U p2))||p1)))))], workingDir=/home/mcc/execution]
Support contains 16 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:31] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:06:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000005-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s10 1)) (OR (LT s1 1) (LT s11 1)) (OR (LT s2 1) (LT s12 1)) (OR (LT s3 1) (LT s13 1)) (OR (LT s4 1) (LT s14 1))), p1:(OR (AND (GEQ s6 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s40 1))), p2:(AND (OR (AND (GEQ s6 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s40 1))) (OR (AND (GEQ s0 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s12 1)) (AND (GEQ s3 1) (GEQ s13 1)) (AND (GEQ s4 1) (GEQ s14 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14732 reset in 317 ms.
Stack based approach found an accepted trace after 25 steps with 3 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SharedMemory-COL-000005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-03 finished in 494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 19:06:31] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-14 19:06:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000005-04 automaton TGBA [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 (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 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 15716 reset in 200 ms.
Stack based approach found an accepted trace after 175 steps with 25 reset with depth 8 and stack size 8 in 1 ms.
FORMULA SharedMemory-COL-000005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-04 finished in 366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, p0, p0]
Running random walk in product with property : SharedMemory-COL-000005-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s6 1) (LT s14 1) (LT s40 1)) (OR (LT s5 1) (LT s12 1) (LT s40 1)) (OR (LT s7 1) (LT s11 1) (LT s40 1)) (OR (LT s8 1) (LT s11 1) (LT s40 1)) (OR (LT s9 1) (LT s13 1) (LT s40 1)) (OR (LT s7 1) (LT s14 1) (LT s40 1)) (OR (LT s8 1) (LT s10 1) (LT s40 1)) (OR (LT s9 1) (LT s11 1) (LT s40 1)) (OR (LT s5 1) (LT s11 1) (LT s40 1)) (OR (LT s8 1) (LT s14 1) (LT s40 1)) (OR (LT s7 1) (LT s10 1) (LT s40 1)) (OR (LT s5 1) (LT s13 1) (LT s40 1)) (OR (LT s6 1) (LT s13 1) (LT s40 1)) (OR (LT s8 1) (LT s12 1) (LT s40 1)) (OR (LT s6 1) (LT s10 1) (LT s40 1)) (OR (LT s7 1) (LT s13 1) (LT s40 1)) (OR (LT s6 1) (LT s12 1) (LT s40 1)) (OR (LT s9 1) (LT s12 1) (LT s40 1)) (OR (LT s5 1) (LT s14 1) (LT s40 1)) (OR (LT s9 1) (LT s10 1) (LT s40 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000005-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-05 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)||(G(!p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 36 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), true, p0, p1, (NOT p2), (AND p0 p1)]
Running random walk in product with property : SharedMemory-COL-000005-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s6 1) (LT s14 1) (LT s40 1)) (OR (LT s5 1) (LT s12 1) (LT s40 1)) (OR (LT s7 1) (LT s11 1) (LT s40 1)) (OR (LT s8 1) (LT s11 1) (LT s40 1)) (OR (LT s9 1) (LT s13 1) (LT s40 1)) (OR (LT s7 1) (LT s14 1) (LT s40 1)) (OR (LT s8 1) (LT s10 1) (LT s40 1)) (OR (LT s9 1) (LT s11 1) (LT s40 1)) (OR (LT s5 1) (LT s11 1) (LT s40 1)) (OR (LT s8 1) (LT s14 1) (LT s40 1)) (OR (LT s7 1) (LT s10 1) (LT s40 1)) (OR (LT s5 1) (LT s13 1) (LT s40 1)) (OR (LT s6 1) (LT s13 1) (LT s40 1)) (OR (LT s8 1) (LT s12 1) (LT s40 1)) (OR (LT s6 1) (LT s10 1) (LT s40 1)) (OR (LT s7 1) (LT s13 1) (LT s40 1)) (OR (LT s6 1) (LT s12 1) (LT s40 1)) (OR (LT s9 1) (LT s12 1) (LT s40 1)) (OR (LT s5 1) (LT s14 1) (LT s40 1)) (OR (LT s9 1) (LT s10 1) (LT s40 1))), p2:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1)), p1:(AND (OR (LT s0 1) (LT s10 1)) (OR (LT s1 1) (LT s11 1)) (OR (LT s2 1) (LT s12 1)) (OR (LT s3 1) (LT s13 1)) (OR (LT s4 1) (LT s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000005-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-06 finished in 216 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G((F(!p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 35 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:32] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-14 19:06:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:32] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000005-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1)), p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1)), p0:(AND (OR (LT s0 1) (LT s10 1)) (OR (LT s1 1) (LT s11 1)) (OR (LT s2 1) (LT s12 1)) (OR (LT s3 1) (LT s13 1)) (OR (LT s4 1) (LT s14 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15675 reset in 283 ms.
Stack based approach found an accepted trace after 272 steps with 44 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SharedMemory-COL-000005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-07 finished in 487 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-14 19:06:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0]
Running random walk in product with property : SharedMemory-COL-000005-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 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 190 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA SharedMemory-COL-000005-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-08 finished in 432 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000005-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-10 finished in 132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 16 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000005-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s15 1)) (OR (AND (GEQ s6 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s40 1)))), p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 30940 reset in 172 ms.
Stack based approach found an accepted trace after 45 steps with 15 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SharedMemory-COL-000005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-13 finished in 280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((((p1 U G(!p2)) U X(G(!p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:06:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 21 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : SharedMemory-COL-000005-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s40 1))), p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null][false]]
Product exploration explored 100000 steps with 30398 reset in 235 ms.
Stack based approach found an accepted trace after 55 steps with 13 reset with depth 14 and stack size 13 in 0 ms.
FORMULA SharedMemory-COL-000005-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-14 finished in 336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 16 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:34] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-14 19:06:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2021-05-14 19:06:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:06:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000005-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s15 1) (AND (GEQ s6 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s40 1)) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s40 1))), p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000005-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000005-15 finished in 138 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621019195592

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-COL-000005"
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-COL-000005, 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 r216-tall-162098204400005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000005.tgz
mv SharedMemory-COL-000005 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 ;