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.r102-smll-162075331000021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 FlexibleBarrier-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 41K 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 FlexibleBarrier-PT-06a-00
FORMULA_NAME FlexibleBarrier-PT-06a-01
FORMULA_NAME FlexibleBarrier-PT-06a-02
FORMULA_NAME FlexibleBarrier-PT-06a-03
FORMULA_NAME FlexibleBarrier-PT-06a-04
FORMULA_NAME FlexibleBarrier-PT-06a-05
FORMULA_NAME FlexibleBarrier-PT-06a-06
FORMULA_NAME FlexibleBarrier-PT-06a-07
FORMULA_NAME FlexibleBarrier-PT-06a-08
FORMULA_NAME FlexibleBarrier-PT-06a-09
FORMULA_NAME FlexibleBarrier-PT-06a-10
FORMULA_NAME FlexibleBarrier-PT-06a-11
FORMULA_NAME FlexibleBarrier-PT-06a-12
FORMULA_NAME FlexibleBarrier-PT-06a-13
FORMULA_NAME FlexibleBarrier-PT-06a-14
FORMULA_NAME FlexibleBarrier-PT-06a-15

=== Now, execution of the tool begins

BK_START 1621116423795

Running Version 0
[2021-05-15 22:07:07] [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-15 22:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 22:07:07] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2021-05-15 22:07:07] [INFO ] Transformed 75 places.
[2021-05-15 22:07:07] [INFO ] Transformed 154 transitions.
[2021-05-15 22:07:07] [INFO ] Found NUPN structural information;
[2021-05-15 22:07:07] [INFO ] Parsed PT model containing 75 places and 154 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 22:07:07] [INFO ] Initial state test concluded for 6 properties.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA FlexibleBarrier-PT-06a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 128/128 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 75 transition count 122
Applied a total of 6 rules in 40 ms. Remains 75 /75 variables (removed 0) and now considering 122/128 (removed 6) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:08] [INFO ] Computed 8 place invariants in 23 ms
[2021-05-15 22:07:08] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:08] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-15 22:07:08] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-15 22:07:08] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:08] [INFO ] Computed 8 place invariants in 13 ms
[2021-05-15 22:07:08] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 122/128 transitions.
[2021-05-15 22:07:08] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 22:07:08] [INFO ] Flatten gal took : 57 ms
FORMULA FlexibleBarrier-PT-06a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 22:07:08] [INFO ] Flatten gal took : 34 ms
[2021-05-15 22:07:09] [INFO ] Input system was already deterministic with 122 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 27) seen :26
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:09] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-15 22:07:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-15 22:07:09] [INFO ] Initial state test concluded for 1 properties.
FORMULA FlexibleBarrier-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((p0&&F(p1))))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:09] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 22:07:09] [INFO ] Implicit Places using invariants in 122 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:09] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-15 22:07:09] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Starting structural reductions, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:09] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-15 22:07:09] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 524 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s41 0) (EQ s73 0) (EQ s60 0)), p0:(EQ s68 1), p2:(AND (EQ s68 1) (EQ s41 1) (EQ s73 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 1470 reset in 517 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 2 ms.
FORMULA FlexibleBarrier-PT-06a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-00 finished in 1551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 56 edges and 75 vertex of which 18 / 75 are part of one of the 6 SCC in 4 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 78 edges and 60 vertex of which 53 / 60 are part of one of the 7 SCC in 1 ms
Free SCC test removed 46 places
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 4 rules applied. Total rules applied 5 place count 14 transition count 98
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 91 place count 9 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 8 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 95 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 7 transition count 13
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 102 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 102 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 104 place count 5 transition count 7
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 6 with 2 rules applied. Total rules applied 106 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 107 place count 4 transition count 5
Applied a total of 107 rules in 32 ms. Remains 4 /75 variables (removed 71) and now considering 5/122 (removed 117) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-15 22:07:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-15 22:07:11] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-15 22:07:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-15 22:07:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2021-05-15 22:07:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-15 22:07:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-15 22:07:11] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/75 places, 5/122 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s2 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-02 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 56 edges and 75 vertex of which 15 / 75 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 48 transition count 85
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 48 transition count 75
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 48 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 48 place count 47 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 47 transition count 74
Applied a total of 49 rules in 35 ms. Remains 47 /75 variables (removed 28) and now considering 74/122 (removed 48) transitions.
[2021-05-15 22:07:11] [INFO ] Flow matrix only has 60 transitions (discarded 14 similar events)
// Phase 1: matrix 60 rows 47 cols
[2021-05-15 22:07:11] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:11] [INFO ] Implicit Places using invariants in 75 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
[2021-05-15 22:07:11] [INFO ] Redundant transitions in 24 ms returned [34, 35, 36, 37, 38]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions :[38, 37, 36, 35, 34]
[2021-05-15 22:07:11] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 46 cols
[2021-05-15 22:07:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:11] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 46/75 places, 69/122 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 46 transition count 63
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 40 transition count 63
Applied a total of 12 rules in 12 ms. Remains 40 /46 variables (removed 6) and now considering 63/69 (removed 6) transitions.
[2021-05-15 22:07:11] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-15 22:07:11] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 22:07:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-15 22:07:11] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-15 22:07:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-15 22:07:11] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 40/75 places, 63/122 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06a-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s37 1), p0:(AND (EQ s20 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-04 finished in 593 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(G(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 48 edges and 75 vertex of which 3 / 75 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 54 transition count 101
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 54 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 43 place count 52 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 52 transition count 99
Applied a total of 45 rules in 21 ms. Remains 52 /75 variables (removed 23) and now considering 99/122 (removed 23) transitions.
[2021-05-15 22:07:11] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 52 cols
[2021-05-15 22:07:11] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 22:07:11] [INFO ] Implicit Places using invariants in 111 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
[2021-05-15 22:07:12] [INFO ] Redundant transitions in 50 ms returned [35, 36, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51, 56, 57, 58, 59]
Found 17 redundant transitions using SMT.
Drop transitions removed 17 transitions
Redundant transitions reduction (with SMT) removed 17 transitions :[59, 58, 57, 56, 51, 50, 49, 48, 47, 46, 45, 44, 39, 38, 37, 36, 35]
[2021-05-15 22:07:12] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
// Phase 1: matrix 76 rows 51 cols
[2021-05-15 22:07:12] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-15 22:07:12] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 51/75 places, 82/122 transitions.
Graph (trivial) has 54 edges and 51 vertex of which 3 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 72
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 43 transition count 72
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 13 place count 43 transition count 66
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 25 place count 37 transition count 66
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 26 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 26 transition count 52
Applied a total of 50 rules in 12 ms. Remains 26 /51 variables (removed 25) and now considering 52/82 (removed 30) transitions.
[2021-05-15 22:07:12] [INFO ] Flow matrix only has 42 transitions (discarded 10 similar events)
// Phase 1: matrix 42 rows 26 cols
[2021-05-15 22:07:12] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2021-05-15 22:07:12] [INFO ] Flow matrix only has 42 transitions (discarded 10 similar events)
// Phase 1: matrix 42 rows 26 cols
[2021-05-15 22:07:12] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-15 22:07:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-15 22:07:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/75 places, 52/122 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s9 1) (EQ s25 1)), p0:(AND (EQ s3 1) (EQ s9 1) (EQ s25 1) (OR (EQ s12 0) (EQ s20 0) (EQ s25 0))), p2:(OR (NEQ s9 1) (NEQ s23 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-05 finished in 556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:12] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:12] [INFO ] Implicit Places using invariants in 73 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:12] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:12] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:12] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s24 0) (EQ s35 0) (EQ s73 0)), p0:(OR (EQ s32 1) (AND (EQ s24 1) (EQ s35 1) (EQ s73 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-06 finished in 496 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X((G(p0)||F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 13 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:12] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:13] [INFO ] Implicit Places using invariants in 159 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:13] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:13] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:13] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:13] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s10 1), p1:(AND (NEQ s35 0) (NEQ s60 0) (NEQ s73 0))], 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 3709 reset in 499 ms.
Stack based approach found an accepted trace after 437 steps with 18 reset with depth 19 and stack size 19 in 4 ms.
FORMULA FlexibleBarrier-PT-06a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-07 finished in 1257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 57 edges and 75 vertex of which 15 / 75 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 48 transition count 89
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 48 transition count 79
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 48 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 47 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 47 transition count 78
Applied a total of 48 rules in 29 ms. Remains 47 /75 variables (removed 28) and now considering 78/122 (removed 44) transitions.
[2021-05-15 22:07:14] [INFO ] Flow matrix only has 60 transitions (discarded 18 similar events)
// Phase 1: matrix 60 rows 47 cols
[2021-05-15 22:07:14] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:14] [INFO ] Implicit Places using invariants in 86 ms returned [45, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
[2021-05-15 22:07:14] [INFO ] Redundant transitions in 15 ms returned [33, 34, 39, 40, 41]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions :[41, 40, 39, 34, 33]
[2021-05-15 22:07:14] [INFO ] Flow matrix only has 60 transitions (discarded 13 similar events)
// Phase 1: matrix 60 rows 45 cols
[2021-05-15 22:07:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:07:14] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 45/75 places, 73/122 transitions.
Graph (trivial) has 66 edges and 45 vertex of which 38 / 45 are part of one of the 6 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 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 2 place count 13 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 20
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 9 transition count 14
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 9 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 11 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 8 transition count 11
Applied a total of 13 rules in 8 ms. Remains 8 /45 variables (removed 37) and now considering 11/73 (removed 62) transitions.
[2021-05-15 22:07:14] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-15 22:07:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-15 22:07:14] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-15 22:07:14] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-15 22:07:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-15 22:07:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-15 22:07:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/75 places, 11/122 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
[2021-05-15 22:07:15] [INFO ] Flatten gal took : 3 ms
[2021-05-15 22:07:15] [INFO ] Flatten gal took : 1 ms
[2021-05-15 22:07:15] [INFO ] Time to serialize gal into /tmp/LTL13439770239914079428.gal : 77 ms
[2021-05-15 22:07:15] [INFO ] Time to serialize properties into /tmp/LTL2612479856558550298.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/LTL13439770239914079428.gal, -t, CGAL, -LTL, /tmp/LTL2612479856558550298.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/LTL13439770239914079428.gal -t CGAL -LTL /tmp/LTL2612479856558550298.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p48==1)")))
Formula 0 simplified : !F"(p48==1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.055807,15992,1,0,7,126,20,2,156,71,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-06a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-06a-09 finished in 1395 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 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 58 edges and 75 vertex of which 18 / 75 are part of one of the 6 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 81 edges and 60 vertex of which 55 / 60 are part of one of the 7 SCC in 0 ms
Free SCC test removed 48 places
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 4 rules applied. Total rules applied 5 place count 12 transition count 98
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 98 place count 6 transition count 11
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 2 with 2 rules applied. Total rules applied 100 place count 5 transition count 10
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 5 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 4 transition count 6
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 3 transition count 5
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 108 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 2 transition count 3
Applied a total of 110 rules in 7 ms. Remains 2 /75 variables (removed 73) and now considering 3/122 (removed 119) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 22:07:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-15 22:07:15] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 22:07:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-15 22:07:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-15 22:07:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 22:07:15] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-15 22:07:15] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/75 places, 3/122 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s0 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 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-10 finished in 180 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(((p1&&G(F(p2)))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:15] [INFO ] Implicit Places using invariants in 99 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:15] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:15] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:15] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-15 22:07:16] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06a-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s22 1), p1:(OR (NEQ s12 1) (NEQ s47 1) (NEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-13 finished in 522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0||X((p1 U p2))) U (X(G(!p0))&&p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:16] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:16] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:16] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-15 22:07:16] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-15 22:07:16] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:16] [INFO ] Computed 8 place invariants in 13 ms
[2021-05-15 22:07:16] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p3) p0), (NOT p2), (OR (NOT p3) p0), p0, (AND p0 (NOT p2)), true, (OR (AND p0 p1) (AND p0 p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p3 p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s14 1) (EQ s74 1)), p0:(EQ s58 1), p2:(AND (EQ s12 1) (EQ s71 1) (EQ s73 1) (EQ s58 1)), p1:(AND (EQ s12 1) (EQ s71 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-14 finished in 615 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U X(p1)) U X(X((p2&&X((F(p1)||G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2021-05-15 22:07:16] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 22:07:16] [INFO ] Implicit Places using invariants in 85 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:16] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:17] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Starting structural reductions, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 74 cols
[2021-05-15 22:07:17] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 22:07:17] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 867 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 6}, { cond=true, acceptance={} source=2 dest: 7}, { cond=(NOT p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 11}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=p2, acceptance={} source=7 dest: 15}, { cond=p2, acceptance={} source=7 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 11}], [{ cond=(NOT p2), acceptance={} source=9 dest: 10}, { cond=p2, acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p1), acceptance={0} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 14}], [{ cond=(NOT p1), acceptance={} source=15 dest: 11}], [{ cond=(NOT p1), acceptance={} source=16 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={} source=16 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=16 dest: 17}], [{ cond=(NOT p1), acceptance={} source=17 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={0} source=17 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=17 dest: 17}]], initial=0, aps=[p0:(EQ s32 1), p1:(EQ s36 1), p2:(OR (NEQ s23 1) (NEQ s48 1) (NEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 7 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-15 finished in 1295 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621116439198

--------------------
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="FlexibleBarrier-PT-06a"
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 FlexibleBarrier-PT-06a, 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 r102-smll-162075331000021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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