Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 35K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 30K May 5 16:51 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-PT-02-00
FORMULA_NAME DatabaseWithMutex-PT-02-01
FORMULA_NAME DatabaseWithMutex-PT-02-02
FORMULA_NAME DatabaseWithMutex-PT-02-03
FORMULA_NAME DatabaseWithMutex-PT-02-04
FORMULA_NAME DatabaseWithMutex-PT-02-05
FORMULA_NAME DatabaseWithMutex-PT-02-06
FORMULA_NAME DatabaseWithMutex-PT-02-07
FORMULA_NAME DatabaseWithMutex-PT-02-08
FORMULA_NAME DatabaseWithMutex-PT-02-09
FORMULA_NAME DatabaseWithMutex-PT-02-10
FORMULA_NAME DatabaseWithMutex-PT-02-11
FORMULA_NAME DatabaseWithMutex-PT-02-12
FORMULA_NAME DatabaseWithMutex-PT-02-13
FORMULA_NAME DatabaseWithMutex-PT-02-14
FORMULA_NAME DatabaseWithMutex-PT-02-15

=== Now, execution of the tool begins

BK_START 1620561850294

Running Version 0
[2021-05-09 12:04:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 12:04:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:04:12] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-09 12:04:12] [INFO ] Transformed 38 places.
[2021-05-09 12:04:12] [INFO ] Transformed 32 transitions.
[2021-05-09 12:04:12] [INFO ] Found NUPN structural information;
[2021-05-09 12:04:12] [INFO ] Parsed PT model containing 38 places and 32 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:04:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 12:04:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 12:04:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 12:04:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 12:04:12] [INFO ] Initial state test concluded for 3 properties.
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 7 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:12] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-09 12:04:12] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 12:04:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:12] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-09 12:04:12] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 32/32 transitions.
[2021-05-09 12:04:12] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 12:04:12] [INFO ] Flatten gal took : 21 ms
FORMULA DatabaseWithMutex-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:04:12] [INFO ] Flatten gal took : 6 ms
[2021-05-09 12:04:12] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 23) seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:13] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 12:04:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 12:04:13] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(G(p0)))&&(X(F(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Implicit Places using invariants in 27 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:13] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:13] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-PT-02-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s15 1) (EQ s16 1) (EQ s18 1) (EQ s25 1)), p2:(OR (EQ s1 1) (EQ s3 1) (EQ s8 1) (EQ s26 1)), p0:(AND (EQ s1 0) (EQ s3 0) (EQ s8 0) (EQ s26 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 4 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-00 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(F(p1)&&X(!p0))))], workingDir=/home/mcc/execution]
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:13] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 12:04:13] [INFO ] Implicit Places using invariants in 23 ms returned [3, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 12:04:13] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 12:04:13] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), p0, (NOT p1), false, (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (NEQ s31 1) (NEQ s0 1) (NEQ s33 1) (NEQ s6 1)), p1:(OR (AND (EQ s15 1) (EQ s19 1)) (AND (EQ s12 1) (EQ s13 1)) (AND (EQ s22 1) (EQ s25 1)) (AND (EQ s27 1) (EQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-02 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Implicit Places using invariants in 18 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:13] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : DatabaseWithMutex-PT-02-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s27 0) (EQ s0 0) (EQ s29 0) (EQ s6 0)), p1:(AND (OR (NEQ s9 1) (NEQ s21 1)) (OR (NEQ s7 1) (NEQ s21 1)) (OR (NEQ s2 1) (NEQ s23 1)) (OR (NEQ s23 1) (NEQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-03 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(X(p0))||F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:13] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 12:04:13] [INFO ] Implicit Places using invariants in 19 ms returned [3, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 12:04:13] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 12:04:13] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:04:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-02-04 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(OR (AND (EQ s15 1) (EQ s19 1)) (AND (EQ s12 1) (EQ s13 1)) (AND (EQ s22 1) (EQ s25 1)) (AND (EQ s27 1) (EQ s29 1))), p0:(OR (AND (NEQ s35 1) (NEQ s34 1) (NEQ s4 1) (NEQ s10 1)) (AND (OR (NEQ s9 1) (NEQ s23 1)) (OR (NEQ s7 1) (NEQ s23 1)) (OR (NEQ s2 1) (NEQ s26 1)) (OR (NEQ s26 1) (NEQ s32 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 133 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Support contains 18 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 36/36 places, 32/32 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 32
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 36 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 36 transition count 32
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 35 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 35 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 9 ms. Remains 35 /36 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-09 12:04:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 35 cols
[2021-05-09 12:04:15] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-09 12:04:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/36 places, 31/32 transitions.
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Product exploration explored 100000 steps with 33333 reset in 116 ms.
[2021-05-09 12:04:15] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:04:15] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:04:15] [INFO ] Time to serialize gal into /tmp/LTL4136983564261469526.gal : 1 ms
[2021-05-09 12:04:15] [INFO ] Time to serialize properties into /tmp/LTL14263334896565037611.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4136983564261469526.gal, -t, CGAL, -LTL, /tmp/LTL14263334896565037611.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4136983564261469526.gal -t CGAL -LTL /tmp/LTL14263334896565037611.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X("(((((Message_1_1==0)&&(Message_2_1==0))&&(Message_2_2==0))&&(Message_1_2==0))||(((((WaitMutex_1_2==0)||(Mutex_2==0))&&((WaitMutex_2_2==0)||(Mutex_2==0)))&&((WaitMutex_1_1==0)||(Mutex_1==0)))&&((Mutex_1==0)||(WaitMutex_2_1==0))))")))||(F("(((((Active_2_2==0)||(Acknowledge_1_2==0))&&((Acknowledge_2_2==0)||(Active_1_2==0)))&&((Acknowledge_2_1==0)||(Active_1_1==0)))&&((Acknowledge_1_1==0)||(Active_2_1==0)))"))))))
Formula 0 simplified : !XX(XX"(((((Message_1_1==0)&&(Message_2_1==0))&&(Message_2_2==0))&&(Message_1_2==0))||(((((WaitMutex_1_2==0)||(Mutex_2==0))&&((WaitMutex_2_2==0)||(Mutex_2==0)))&&((WaitMutex_1_1==0)||(Mutex_1==0)))&&((Mutex_1==0)||(WaitMutex_2_1==0))))" | F"(((((Active_2_2==0)||(Acknowledge_1_2==0))&&((Acknowledge_2_2==0)||(Active_1_2==0)))&&((Acknowledge_2_1==0)||(Active_1_1==0)))&&((Acknowledge_1_1==0)||(Active_2_1==0)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 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,0.024447,16648,1,0,7,2151,14,0,789,568,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-02-04 finished in 1489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:04:15] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 12:04:15] [INFO ] Implicit Places using invariants in 31 ms returned [3, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 12:04:15] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-09 12:04:15] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2021-05-09 12:04:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:04:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s31 1) (EQ s0 1) (EQ s33 1) (EQ s6 1) (AND (EQ s15 1) (EQ s19 1)) (AND (EQ s12 1) (EQ s13 1)) (AND (EQ s22 1) (EQ s25 1)) (AND (EQ s27 1) (EQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10824 reset in 93 ms.
Product exploration explored 100000 steps with 10876 reset in 227 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10809 reset in 83 ms.
Product exploration explored 100000 steps with 10814 reset in 150 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 36/36 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 36 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 36 transition count 32
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 32 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 32 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 4 ms. Remains 32 /36 variables (removed 4) and now considering 28/32 (removed 4) transitions.
[2021-05-09 12:04:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 32 cols
[2021-05-09 12:04:16] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-09 12:04:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/36 places, 28/32 transitions.
Product exploration explored 100000 steps with 15396 reset in 287 ms.
Product exploration explored 100000 steps with 15396 reset in 248 ms.
[2021-05-09 12:04:16] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:04:16] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:04:16] [INFO ] Time to serialize gal into /tmp/LTL7646413924320485750.gal : 1 ms
[2021-05-09 12:04:16] [INFO ] Time to serialize properties into /tmp/LTL2760418746213793380.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7646413924320485750.gal, -t, CGAL, -LTL, /tmp/LTL2760418746213793380.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7646413924320485750.gal -t CGAL -LTL /tmp/LTL2760418746213793380.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((MesBuffReply_2_2==1)||(MesBuffReply_2_1==1))||(MesBuffReply_1_1==1))||(MesBuffReply_1_2==1))||((Active_2_2==1)&&(Acknowledge_1_2==1)))||((Acknowledge_2_2==1)&&(Active_1_2==1)))||((Acknowledge_2_1==1)&&(Active_1_1==1)))||((Acknowledge_1_1==1)&&(Active_2_1==1)))"))))
Formula 0 simplified : !XF"((((((((MesBuffReply_2_2==1)||(MesBuffReply_2_1==1))||(MesBuffReply_1_1==1))||(MesBuffReply_1_2==1))||((Active_2_2==1)&&(Acknowledge_1_2==1)))||((Acknowledge_2_2==1)&&(Active_1_2==1)))||((Acknowledge_2_1==1)&&(Active_1_1==1)))||((Acknowledge_1_1==1)&&(Active_2_1==1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 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,0.029712,16844,1,0,49,4489,20,11,803,3859,106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-02-05 finished in 1554 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:04:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:20] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:04:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:04:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-02-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (EQ s20 0) (EQ s30 0)) (OR (EQ s3 0) (EQ s23 0)) (OR (EQ s14 0) (EQ s30 0)) (OR (EQ s3 0) (EQ s15 0))), p0:(OR (EQ s6 1) (EQ s12 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 8 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 34/34 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 34 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 34 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-09 12:04:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:04:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 32/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
[2021-05-09 12:04:22] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:04:22] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:04:22] [INFO ] Time to serialize gal into /tmp/LTL5122080996285013563.gal : 1 ms
[2021-05-09 12:04:22] [INFO ] Time to serialize properties into /tmp/LTL3438325320911073895.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5122080996285013563.gal, -t, CGAL, -LTL, /tmp/LTL3438325320911073895.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5122080996285013563.gal -t CGAL -LTL /tmp/LTL3438325320911073895.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("((all_active_1==1)||(all_active_2==1))"))&&(F("(((((RecBuff_1_2==0)||(all_passive_1==0))&&((all_passive_2==0)||(RecBuff_2_2==0)))&&((RecBuff_1_1==0)||(all_passive_1==0)))&&((all_passive_2==0)||(RecBuff_2_1==0)))")))))
Formula 0 simplified : !F(X"((all_active_1==1)||(all_active_2==1))" & F"(((((RecBuff_1_2==0)||(all_passive_1==0))&&((all_passive_2==0)||(RecBuff_2_2==0)))&&((RecBuff_1_1==0)||(all_passive_1==0)))&&((all_passive_2==0)||(RecBuff_2_1==0)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 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,0.021858,17056,1,0,6,3092,22,0,764,876,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-02-06 finished in 5253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 34 transition count 18
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 19 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 42 place count 15 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 13 transition count 12
Applied a total of 45 rules in 4 ms. Remains 13 /38 variables (removed 25) and now considering 12/32 (removed 20) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-09 12:04:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 12 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-09 12:04:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 12/38 places, 12/32 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 10
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 6 edges and 9 vertex of which 4 / 9 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 7 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 7 transition count 8
Applied a total of 8 rules in 3 ms. Remains 7 /12 variables (removed 5) and now considering 8/12 (removed 4) transitions.
[2021-05-09 12:04:22] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-09 12:04:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 12:04:22] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-09 12:04:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/38 places, 8/32 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-08 finished in 86 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 34 transition count 20
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 21 transition count 16
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 15 transition count 14
Applied a total of 41 rules in 2 ms. Remains 15 /38 variables (removed 23) and now considering 14/32 (removed 18) transitions.
// Phase 1: matrix 14 rows 15 cols
[2021-05-09 12:04:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 13 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-09 12:04:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 14/38 places, 14/32 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 12
Applied a total of 4 rules in 0 ms. Remains 12 /14 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 12 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/38 places, 12/32 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-02-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s5 1), p1:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4749 reset in 103 ms.
Stack based approach found an accepted trace after 882 steps with 48 reset with depth 9 and stack size 9 in 1 ms.
FORMULA DatabaseWithMutex-PT-02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-09 finished in 237 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1||G(p0))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 34 transition count 24
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 25 transition count 20
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 33 place count 21 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 37 place count 17 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 37 place count 17 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 16 transition count 15
Applied a total of 39 rules in 2 ms. Remains 16 /38 variables (removed 22) and now considering 15/32 (removed 17) transitions.
// Phase 1: matrix 15 rows 16 cols
[2021-05-09 12:04:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 15 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-09 12:04:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 15/38 places, 15/32 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 14
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 13 transition count 13
Applied a total of 4 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 13 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 13/38 places, 13/32 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), true, (NOT p2), (AND p2 (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-02-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s9 1)), p1:(AND (NEQ s0 1) (NEQ s2 0)), p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 68 steps with 15 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-10 finished in 158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0)) U G((X(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 15 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s23 1) (NEQ s28 1)), p2:(OR (NEQ s23 1) (NEQ s28 1)), p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3328 reset in 77 ms.
Stack based approach found an accepted trace after 137 steps with 3 reset with depth 66 and stack size 50 in 0 ms.
FORMULA DatabaseWithMutex-PT-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-11 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 35 transition count 32
Applied a total of 3 rules in 1 ms. Remains 35 /38 variables (removed 3) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 35 cols
[2021-05-09 12:04:22] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Implicit Places using invariants in 19 ms returned [3, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 33 cols
[2021-05-09 12:04:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 33/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 33 cols
[2021-05-09 12:04:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 33/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-02-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s6 1), p1:(AND (NEQ s14 0) (NEQ s18 0)), p2:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 33/33 places, 32/32 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 33 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 12 place count 33 transition count 32
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 33 transition count 32
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 25 place count 24 transition count 23
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 34 place count 24 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 24 transition count 23
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 18 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 18 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 49 rules in 4 ms. Remains 18 /33 variables (removed 15) and now considering 17/32 (removed 15) transitions.
[2021-05-09 12:04:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 18 cols
[2021-05-09 12:04:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:23] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/33 places, 17/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
[2021-05-09 12:04:24] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:04:24] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:04:24] [INFO ] Time to serialize gal into /tmp/LTL2538187898285568859.gal : 0 ms
[2021-05-09 12:04:24] [INFO ] Time to serialize properties into /tmp/LTL4085519018375823358.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2538187898285568859.gal, -t, CGAL, -LTL, /tmp/LTL4085519018375823358.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2538187898285568859.gal -t CGAL -LTL /tmp/LTL4085519018375823358.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(MesBuffReply_1_2==0)")||(F(("((Active_2_2==1)&&(Acknowledge_1_2==1))")||(G("(Message_1_2==0)")))))))
Formula 0 simplified : !X("(MesBuffReply_1_2==0)" | F("((Active_2_2==1)&&(Acknowledge_1_2==1))" | G"(Message_1_2==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 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,0.016513,16952,1,0,6,1798,18,0,706,497,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DatabaseWithMutex-PT-02-12 finished in 1218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U (G(p1)||(p1&&G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 34 transition count 20
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 21 transition count 17
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 15 transition count 14
Applied a total of 41 rules in 4 ms. Remains 15 /38 variables (removed 23) and now considering 14/32 (removed 18) transitions.
// Phase 1: matrix 14 rows 15 cols
[2021-05-09 12:04:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:04:24] [INFO ] Implicit Places using invariants in 13 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-09 12:04:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 12:04:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:04:24] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 14/38 places, 14/32 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 12
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 6 edges and 11 vertex of which 4 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 9 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 9 transition count 10
Applied a total of 8 rules in 1 ms. Remains 9 /14 variables (removed 5) and now considering 10/14 (removed 4) transitions.
[2021-05-09 12:04:24] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-09 12:04:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:04:24] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 12:04:24] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-09 12:04:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:04:24] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/38 places, 10/32 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s8 1), p1:(NEQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 18 in 0 ms.
FORMULA DatabaseWithMutex-PT-02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-14 finished in 387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((!p0 U !p1))||X(G((F(!p1) U !p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:04:24] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:04:24] [INFO ] Implicit Places using invariants in 16 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:04:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:04:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:04:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p2), p2, (AND p1 p2), p1, p2, (AND p1 p2)]
Running random walk in product with property : DatabaseWithMutex-PT-02-15 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s6 1), p0:(NEQ s31 1), p2:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3437 reset in 164 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA DatabaseWithMutex-PT-02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-15 finished in 400 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620561865821

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-02"
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-PT-02, 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 r064-tall-162038397600717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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