Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 7.5K Apr 30 05:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 05:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 21K May 10 09:33 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 DatabaseWithMutex-COL-04-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652612409580

Running Version 202205111006
[2022-05-15 11:00:10] [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-15 11:00:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 11:00:10] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 11:00:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 11:00:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 539 ms
[2022-05-15 11:00:11] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-15 11:00:11] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 9 ms.
[2022-05-15 11:00:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 48 steps, including 0 resets, run visited all 8 properties in 10 ms. (steps per millisecond=4 )
[2022-05-15 11:00:11] [INFO ] Flatten gal took : 15 ms
[2022-05-15 11:00:11] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2022-05-15 11:00:11] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 12 ms.
[2022-05-15 11:00:11] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2022-05-15 11:00:11] [INFO ] Reduced 12 identical enabling conditions.
[2022-05-15 11:00:11] [INFO ] Reduced 12 identical enabling conditions.
[2022-05-15 11:00:11] [INFO ] Reduced 12 identical enabling conditions.
[2022-05-15 11:00:11] [INFO ] Reduced 12 identical enabling conditions.
[2022-05-15 11:00:11] [INFO ] Reduced 12 identical enabling conditions.
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:11] [INFO ] Computed 28 place invariants in 21 ms
[2022-05-15 11:00:11] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:11] [INFO ] Computed 28 place invariants in 9 ms
[2022-05-15 11:00:11] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:11] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 11:00:12] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2022-05-15 11:00:12] [INFO ] Flatten gal took : 18 ms
[2022-05-15 11:00:12] [INFO ] Flatten gal took : 17 ms
[2022-05-15 11:00:12] [INFO ] Input system was already deterministic with 128 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 12 properties in 10 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(X(F(X(F(!p0))))) U p1)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:12] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 11:00:12] [INFO ] Implicit Places using invariants in 95 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 97 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 626 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1)), p0:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s51 1) (GEQ s50 1) (GEQ s53 1) (GEQ s52 1) (GEQ s55 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Stack based approach found an accepted trace after 3688 steps with 0 reset with depth 3689 and stack size 3689 in 22 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-00 finished in 1203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p1)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:13] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-15 11:00:13] [INFO ] Implicit Places using invariants in 103 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 107 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1)), p0:(AND (LT s49 1) (LT s48 1) (LT s51 1) (LT s50 1) (LT s53 1) (LT s52 1) (LT s55 1) (LT s54 1) (LT ...], 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 5 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-01 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 29 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2022-05-15 11:00:13] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-15 11:00:13] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 80 rows 88 cols
[2022-05-15 11:00:14] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-15 11:00:14] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-15 11:00:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 88 cols
[2022-05-15 11:00:14] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-15 11:00:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s61 1) (LT s65 1) (LT s69 1)) (OR (LT s11 1) (LT s59 1) (LT s67 1) (LT s71 1)) (OR (LT s17 1) (LT s57 1) (LT s61 1) (LT s65 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 251 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-02 finished in 487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&p0)))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:14] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 11:00:14] [INFO ] Implicit Places using invariants in 92 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 93 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s62 1) (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GE...], 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 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-03 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G((F(!p3)||p2))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:14] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 11:00:14] [INFO ] Implicit Places using invariants in 54 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 55 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p2) p3), (AND p1 (NOT p0) (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3 p1 (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p3 p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s25 1) (GEQ s24 1) (GEQ s27 1) (GEQ s26 1) (GEQ s29 1) (GEQ s28 1) (GEQ s31 1) (GEQ s30 1) (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 31795 reset in 556 ms.
Product exploration explored 100000 steps with 31701 reset in 502 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (X (NOT (AND p2 p3 p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1004 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 6 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p2) p3), (AND (NOT p0) p1 (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:17] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 11:00:17] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (X (NOT (AND p2 p3 p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p2) p1 p3))), (G (NOT (AND (NOT p0) p2 (NOT p1) p3)))]
False Knowledge obtained : [(F (AND (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) p3)), (F (AND p2 p3)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p3)), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) p2 p1 p3))]
Knowledge based reduction with 24 factoid took 1559 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:19] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:19] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:19] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 11:00:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-15 11:00:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:19] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 11:00:19] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 515 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Finished random walk after 24 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3))), (F (AND (NOT p0) p3)), (F (AND p2 p3)), (F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p2) p3)), (F (AND (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 13 factoid took 629 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 4919 reset in 372 ms.
Product exploration explored 100000 steps with 4862 reset in 370 ms.
Built C files in :
/tmp/ltsmin2541284356957521819
[2022-05-15 11:00:22] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-15 11:00:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:22] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-15 11:00:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:22] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-15 11:00:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:22] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2541284356957521819
Running compilation step : cd /tmp/ltsmin2541284356957521819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 635 ms.
Running link step : cd /tmp/ltsmin2541284356957521819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2541284356957521819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased860946668636822403.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-06 finished in 8560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:23] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 11:00:23] [INFO ] Implicit Places using invariants in 69 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s62 1) (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-08 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(F(p1)))||X(X(X(p0)))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:23] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 11:00:23] [INFO ] Implicit Places using invariants in 65 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 66 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s94 1) (GEQ s95 1) (GEQ s92 1) (GEQ s93 1) (GEQ s98 1) (GEQ s99 1) (GEQ s96 1) (GEQ s97 1) (GEQ s102 1) (GEQ s103 1) (GEQ s100 1) (GEQ s101 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8095 reset in 159 ms.
Product exploration explored 100000 steps with 8027 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:24] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 11:00:24] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-15 11:00:24] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-15 11:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:24] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-15 11:00:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:00:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 11:00:25] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-15 11:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:25] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-15 11:00:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2022-05-15 11:00:25] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2022-05-15 11:00:25] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2022-05-15 11:00:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
[2022-05-15 11:00:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 164 ms
[2022-05-15 11:00:25] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-15 11:00:25] [INFO ] Added : 81 causal constraints over 17 iterations in 219 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:25] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:25] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:26] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:26] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 11:00:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-15 11:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:26] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-15 11:00:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:00:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 11:00:26] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-15 11:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:26] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-05-15 11:00:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-15 11:00:26] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2022-05-15 11:00:26] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2022-05-15 11:00:27] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2022-05-15 11:00:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 154 ms
[2022-05-15 11:00:27] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 11:00:27] [INFO ] Added : 81 causal constraints over 17 iterations in 182 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8080 reset in 151 ms.
Product exploration explored 100000 steps with 8077 reset in 163 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 128
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 16 place count 124 transition count 136
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 124 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 124 transition count 136
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 15 ms. Remains 124 /124 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2022-05-15 11:00:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 136 rows 124 cols
[2022-05-15 11:00:28] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:28] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 136/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 136/128 transitions.
Product exploration explored 100000 steps with 9236 reset in 280 ms.
Product exploration explored 100000 steps with 9234 reset in 284 ms.
Built C files in :
/tmp/ltsmin12077864071556577187
[2022-05-15 11:00:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12077864071556577187
Running compilation step : cd /tmp/ltsmin12077864071556577187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin12077864071556577187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12077864071556577187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7099071417852271314.hoa' '--buchi-type=spotba'
LTSmin run took 13037 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-09 finished in 18629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:00:42] [INFO ] Computed 28 place invariants in 8 ms
[2022-05-15 11:00:42] [INFO ] Implicit Places using invariants in 65 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 66 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-10 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 (GEQ s4 1) (GEQ s89 1)) (AND (GEQ s6 1) (GEQ s89 1)) (AND (GEQ s11 1) (GEQ s90 1)) (AND (GEQ s14 1) (GEQ s91 1)) (AND (GEQ s9 1) (GEQ s90 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 10893 reset in 167 ms.
Product exploration explored 100000 steps with 10872 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:00:42] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 11:00:42] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-15 11:00:42] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-15 11:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:42] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 11:00:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:00:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-15 11:00:43] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-15 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:43] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-15 11:00:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-05-15 11:00:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2022-05-15 11:00:43] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2022-05-15 11:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2022-05-15 11:00:43] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-15 11:00:43] [INFO ] Added : 81 causal constraints over 17 iterations in 209 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 112
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 108 transition count 112
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 108 transition count 96
Deduced a syphon composed of 16 places in 9 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 92 transition count 96
Applied a total of 64 rules in 15 ms. Remains 92 /124 variables (removed 32) and now considering 96/128 (removed 32) transitions.
// Phase 1: matrix 96 rows 92 cols
[2022-05-15 11:00:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:43] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 96 rows 92 cols
[2022-05-15 11:00:43] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 11:00:43] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-05-15 11:00:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 92 cols
[2022-05-15 11:00:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:43] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/124 places, 96/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/124 places, 96/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1375 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 96 rows 92 cols
[2022-05-15 11:00:45] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 11:00:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-15 11:00:45] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 11:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:45] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 11:00:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:00:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-15 11:00:45] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 11:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:45] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2022-05-15 11:00:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 210 ms
[2022-05-15 11:00:45] [INFO ] Computed and/alt/rep : 80/144/80 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 11:00:45] [INFO ] Added : 57 causal constraints over 12 iterations in 110 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14291 reset in 201 ms.
Product exploration explored 100000 steps with 14286 reset in 181 ms.
Built C files in :
/tmp/ltsmin4126180817602508589
[2022-05-15 11:00:46] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2022-05-15 11:00:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:46] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2022-05-15 11:00:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:46] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2022-05-15 11:00:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4126180817602508589
Running compilation step : cd /tmp/ltsmin4126180817602508589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin4126180817602508589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4126180817602508589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5110947273777112591.hoa' '--buchi-type=spotba'
LTSmin run took 408 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-10 finished in 4865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 124 transition count 112
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 32 place count 124 transition count 80
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 96 place count 92 transition count 80
Applied a total of 96 rules in 12 ms. Remains 92 /140 variables (removed 48) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 92 cols
[2022-05-15 11:00:46] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 11:00:46] [INFO ] Implicit Places using invariants in 58 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 58 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/140 places, 80/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-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 (GEQ s46 1) (GEQ s47 1) (GEQ s44 1) (GEQ s45 1) (GEQ s50 1) (GEQ s51 1) (GEQ s48 1) (GEQ s49 1) (GEQ s54 1) (GEQ s55 1) (GEQ s52 1) (GEQ s53 1) (GE...], 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 13518 reset in 161 ms.
Product exploration explored 100000 steps with 13622 reset in 179 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:00:47] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-15 11:00:47] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 11:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-15 11:00:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:00:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-15 11:00:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-15 11:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-15 11:00:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2022-05-15 11:00:47] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2022-05-15 11:00:47] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2022-05-15 11:00:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
[2022-05-15 11:00:47] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 11:00:48] [INFO ] Added : 32 causal constraints over 7 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:00:48] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:48] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:00:48] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:48] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-15 11:00:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:00:48] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-15 11:00:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:00:48] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:00:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-15 11:00:48] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 11:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 11:00:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:00:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-15 11:00:48] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 11:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:00:48] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-15 11:00:48] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2022-05-15 11:00:48] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2022-05-15 11:00:48] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2022-05-15 11:00:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 84 ms
[2022-05-15 11:00:48] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-15 11:00:49] [INFO ] Added : 32 causal constraints over 7 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13652 reset in 167 ms.
Product exploration explored 100000 steps with 13622 reset in 178 ms.
Built C files in :
/tmp/ltsmin3614488337366822472
[2022-05-15 11:00:49] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-15 11:00:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:49] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-15 11:00:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:49] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-15 11:00:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:00:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3614488337366822472
Running compilation step : cd /tmp/ltsmin3614488337366822472;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin3614488337366822472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3614488337366822472;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5248475441971016974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 16 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:01:04] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-15 11:01:04] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:01:04] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:01:04] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-05-15 11:01:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 76 cols
[2022-05-15 11:01:04] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:01:04] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin2745387406081483125
[2022-05-15 11:01:04] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-15 11:01:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:01:04] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-15 11:01:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:01:04] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-15 11:01:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:01:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2745387406081483125
Running compilation step : cd /tmp/ltsmin2745387406081483125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin2745387406081483125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2745387406081483125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13256521117222479339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:01:19] [INFO ] Flatten gal took : 6 ms
[2022-05-15 11:01:20] [INFO ] Flatten gal took : 6 ms
[2022-05-15 11:01:20] [INFO ] Time to serialize gal into /tmp/LTL12079581089024778660.gal : 2 ms
[2022-05-15 11:01:20] [INFO ] Time to serialize properties into /tmp/LTL2285171161821021086.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12079581089024778660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2285171161821021086.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1207958...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((updating_2>=1)||(updating_3>=1))||((updating_0>=1)||(updating_1>=1)))||(((updating_6>=1)||(updating_7>=1))||((updating_4>...340
Formula 0 simplified : !GF"(((((updating_2>=1)||(updating_3>=1))||((updating_0>=1)||(updating_1>=1)))||(((updating_6>=1)||(updating_7>=1))||((updating_4>=1...334
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1156 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.5885,336992,1,0,31,1.73036e+06,24,1,2101,690140,79
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-11 finished in 46036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 48 rules applied. Total rules applied 116 place count 88 transition count 64
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 9 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2022-05-15 11:01:32] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-15 11:01:32] [INFO ] Implicit Places using invariants in 55 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2022-05-15 11:01:32] [INFO ] Actually due to overlaps returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 57 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/140 places, 48/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 40/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s21 1) (LT s25 1)) (OR (LT s22 1) (LT s34 1)) (OR (LT s21 1) (LT s29 1)) (OR (LT s22 1) (LT s30 1)) (OR (LT s22 1) (LT s26 1)) (OR (LT s21...], 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 209 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-12 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p2)||p1))||p0) U G((p3 U p2))))'
Support contains 56 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:01:33] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 11:01:33] [INFO ] Implicit Places using invariants in 65 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 67 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(OR (AND p2 (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p3), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 7}, { cond=(OR p2 p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s62 1) (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-14 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(p0))||G(p1)))))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 11:01:33] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 11:01:33] [INFO ] Implicit Places using invariants in 68 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 69 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s25 1) (LT s24 1) (LT s27 1) (LT s26 1) (LT s29 1) (LT s28 1) (LT s31 1) (LT s30 1) (LT s33 1) (LT s32 1) (LT s35 1) (LT s34 1) (LT s37 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9142 reset in 154 ms.
Product exploration explored 100000 steps with 9073 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 32 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:01:34] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:01:34] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:01:34] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:01:34] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 11:01:34] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:01:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 9109 reset in 154 ms.
Product exploration explored 100000 steps with 9074 reset in 157 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 32 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 124 transition count 136
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 124 transition count 136
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 14 ms. Remains 124 /124 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2022-05-15 11:01:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 124 cols
[2022-05-15 11:01:36] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 11:01:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 136/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 136/128 transitions.
Product exploration explored 100000 steps with 9306 reset in 230 ms.
Product exploration explored 100000 steps with 9324 reset in 236 ms.
Built C files in :
/tmp/ltsmin12888726846969860376
[2022-05-15 11:01:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12888726846969860376
Running compilation step : cd /tmp/ltsmin12888726846969860376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin12888726846969860376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin12888726846969860376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10452907248582037470.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-15 finished in 3705 ms.
All properties solved by simple procedures.
Total runtime 86603 ms.

BK_STOP 1652612497423

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DatabaseWithMutex-COL-04"
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 DatabaseWithMutex-COL-04, 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 r060-tall-165254772100524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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