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-162075331100068.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-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331100068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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.0K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 11:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 11:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 19:29 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 128K 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-12a-00
FORMULA_NAME FlexibleBarrier-PT-12a-01
FORMULA_NAME FlexibleBarrier-PT-12a-02
FORMULA_NAME FlexibleBarrier-PT-12a-03
FORMULA_NAME FlexibleBarrier-PT-12a-04
FORMULA_NAME FlexibleBarrier-PT-12a-05
FORMULA_NAME FlexibleBarrier-PT-12a-06
FORMULA_NAME FlexibleBarrier-PT-12a-07
FORMULA_NAME FlexibleBarrier-PT-12a-08
FORMULA_NAME FlexibleBarrier-PT-12a-09
FORMULA_NAME FlexibleBarrier-PT-12a-10
FORMULA_NAME FlexibleBarrier-PT-12a-11
FORMULA_NAME FlexibleBarrier-PT-12a-12
FORMULA_NAME FlexibleBarrier-PT-12a-13
FORMULA_NAME FlexibleBarrier-PT-12a-14
FORMULA_NAME FlexibleBarrier-PT-12a-15

=== Now, execution of the tool begins

BK_START 1621135573925

Running Version 0
[2021-05-16 03:26:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-16 03:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 03:26:17] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2021-05-16 03:26:17] [INFO ] Transformed 147 places.
[2021-05-16 03:26:17] [INFO ] Transformed 448 transitions.
[2021-05-16 03:26:17] [INFO ] Found NUPN structural information;
[2021-05-16 03:26:17] [INFO ] Parsed PT model containing 147 places and 448 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 03:26:17] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA FlexibleBarrier-PT-12a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 326/326 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 314
Applied a total of 12 rules in 32 ms. Remains 147 /147 variables (removed 0) and now considering 314/326 (removed 12) transitions.
// Phase 1: matrix 314 rows 147 cols
[2021-05-16 03:26:17] [INFO ] Computed 14 place invariants in 16 ms
[2021-05-16 03:26:17] [INFO ] Implicit Places using invariants in 560 ms returned [145, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 606 ms to find 2 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:17] [INFO ] Computed 12 place invariants in 8 ms
[2021-05-16 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 448 ms returned []
Starting structural reductions, iteration 1 : 145/147 places, 314/326 transitions.
Applied a total of 0 rules in 13 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:18] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-16 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 461 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/147 places, 314/326 transitions.
[2021-05-16 03:26:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 03:26:19] [INFO ] Flatten gal took : 124 ms
FORMULA FlexibleBarrier-PT-12a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 03:26:19] [INFO ] Flatten gal took : 52 ms
[2021-05-16 03:26:19] [INFO ] Input system was already deterministic with 314 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 15) seen :14
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:20] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 03:26:20] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-16 03:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 03:26:20] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-16 03:26:20] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-16 03:26:20] [INFO ] Initial state test concluded for 1 properties.
FORMULA FlexibleBarrier-PT-12a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 189 edges and 145 vertex of which 142 / 145 are part of one of the 12 SCC in 6 ms
Free SCC test removed 130 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 3 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 2 transition count 4
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 2 transition count 3
Applied a total of 93 rules in 29 ms. Remains 2 /145 variables (removed 143) and now considering 3/314 (removed 311) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 03:26:20] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 03:26:20] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 03:26:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 03:26:20] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-16 03:26:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 03:26:20] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 03:26:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 3/314 transitions.
Stuttering acceptance computed with spot in 341 ms :[false, p0, true]
Running random walk in product with property : FlexibleBarrier-PT-12a-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-12a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-01 finished in 542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Applied a total of 0 rules in 12 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:21] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 03:26:21] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:21] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:21] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:21] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 03:26:21] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 314/314 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s57 0) (NEQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 252 steps with 0 reset in 13 ms.
FORMULA FlexibleBarrier-PT-12a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-02 finished in 908 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 186 edges and 145 vertex of which 136 / 145 are part of one of the 14 SCC in 2 ms
Free SCC test removed 122 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 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 86 rules applied. Total rules applied 87 place count 12 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 9 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 8 transition count 15
Iterating global reduction 3 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 3 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 4 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 5 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 5 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 6 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 7 with 1 Pre rules applied. Total rules applied 102 place count 6 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 5 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 105 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 106 place count 4 transition count 6
Iterating global reduction 7 with 1 rules applied. Total rules applied 107 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 108 place count 4 transition count 5
Applied a total of 108 rules in 23 ms. Remains 4 /145 variables (removed 141) and now considering 5/314 (removed 309) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 03:26:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 03:26:21] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 03:26:21] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-16 03:26:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-16 03:26:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 03:26:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 03:26:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/145 places, 5/314 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s3 0) (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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-04 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Applied a total of 0 rules in 12 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:22] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 03:26:22] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:22] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:22] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:22] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 03:26:22] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 314/314 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s21 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 50000 reset in 975 ms.
Product exploration explored 100000 steps with 50000 reset in 613 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 190 edges and 145 vertex of which 140 / 145 are part of one of the 14 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 18 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 18 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 18 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 18 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 17 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 17 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 2 with 66 rules applied. Total rules applied 75 place count 17 transition count 19
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 7 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 7 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 95 rules in 26 ms. Remains 7 /145 variables (removed 138) and now considering 9/314 (removed 305) transitions.
[2021-05-16 03:26:25] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 03:26:25] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 03:26:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 03:26:25] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/145 places, 9/314 transitions.
Product exploration explored 100000 steps with 50000 reset in 517 ms.
Product exploration explored 100000 steps with 50000 reset in 287 ms.
[2021-05-16 03:26:26] [INFO ] Flatten gal took : 23 ms
[2021-05-16 03:26:26] [INFO ] Flatten gal took : 20 ms
[2021-05-16 03:26:26] [INFO ] Time to serialize gal into /tmp/LTL2398515042785908701.gal : 18 ms
[2021-05-16 03:26:26] [INFO ] Time to serialize properties into /tmp/LTL16950394154017156127.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/LTL2398515042785908701.gal, -t, CGAL, -LTL, /tmp/LTL16950394154017156127.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/LTL2398515042785908701.gal -t CGAL -LTL /tmp/LTL16950394154017156127.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p21==0)"))))
Formula 0 simplified : !XF"(p21==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
152 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,1.58387,55772,1,0,6,258894,20,0,4188,30127,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-12a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-12a-06 finished in 6583 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 182 edges and 145 vertex of which 133 / 145 are part of one of the 15 SCC in 2 ms
Free SCC test removed 118 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 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 77 rules applied. Total rules applied 78 place count 18 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 16 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 15 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 15 transition count 31
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 84 place count 15 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 14 transition count 29
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 87 place count 13 transition count 28
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 99 place count 13 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 12 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 101 place count 12 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 105 place count 10 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 109 place count 8 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 111 place count 8 transition count 9
Applied a total of 111 rules in 16 ms. Remains 8 /145 variables (removed 137) and now considering 9/314 (removed 305) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 03:26:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 03:26:28] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 03:26:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 03:26:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2021-05-16 03:26:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 03:26:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 03:26:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/145 places, 9/314 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-12a-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s4 0) (NEQ s6 1)), p1:(AND (NEQ s0 0) (NEQ s2 1))], nbAcceptance=2, 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 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-07 finished in 183 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 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 189 edges and 145 vertex of which 140 / 145 are part of one of the 12 SCC in 1 ms
Free SCC test removed 128 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 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 88 rules applied. Total rules applied 89 place count 5 transition count 7
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 91 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 3 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 2 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 2 transition count 3
Applied a total of 97 rules in 7 ms. Remains 2 /145 variables (removed 143) and now considering 3/314 (removed 311) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 03:26:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 03:26:28] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 03:26:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 03:26:28] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-16 03:26:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 03:26:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 03:26:28] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 3/314 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-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 s1 0)], 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 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-08 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:28] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 03:26:29] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:29] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 03:26:29] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:29] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:29] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 314/314 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s18 0) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 689 ms.
Product exploration explored 100000 steps with 25000 reset in 435 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 520 ms.
Product exploration explored 100000 steps with 25000 reset in 532 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 188 edges and 145 vertex of which 136 / 145 are part of one of the 12 SCC in 1 ms
Free SCC test removed 124 places
Ensure Unique test removed 223 transitions
Reduce isomorphic transitions removed 223 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 21 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 93
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 1 with 68 rules applied. Total rules applied 73 place count 21 transition count 25
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 10 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 10 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 95 rules in 9 ms. Remains 10 /145 variables (removed 135) and now considering 14/314 (removed 300) transitions.
[2021-05-16 03:26:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 03:26:32] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
// Phase 1: matrix 12 rows 10 cols
[2021-05-16 03:26:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 03:26:32] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/145 places, 14/314 transitions.
Product exploration explored 100000 steps with 25000 reset in 649 ms.
Product exploration explored 100000 steps with 25000 reset in 466 ms.
[2021-05-16 03:26:33] [INFO ] Flatten gal took : 29 ms
[2021-05-16 03:26:33] [INFO ] Flatten gal took : 28 ms
[2021-05-16 03:26:33] [INFO ] Time to serialize gal into /tmp/LTL9186535952301228020.gal : 5 ms
[2021-05-16 03:26:33] [INFO ] Time to serialize properties into /tmp/LTL12472121976673208490.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/LTL9186535952301228020.gal, -t, CGAL, -LTL, /tmp/LTL12472121976673208490.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/LTL9186535952301228020.gal -t CGAL -LTL /tmp/LTL12472121976673208490.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p18==0)||(p126==1))"))))))
Formula 0 simplified : !XXXF"((p18==0)||(p126==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
173 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,1.78346,55880,1,0,8,259638,20,0,4197,30449,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-12a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-12a-09 finished in 6565 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:35] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:35] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:35] [INFO ] Computed 12 place invariants in 11 ms
[2021-05-16 03:26:35] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:35] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 03:26:35] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 314/314 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12a-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s111 0) (EQ s53 1)), p1:(AND (NEQ s135 0) (NEQ s115 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]]
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 791 ms.
Product exploration explored 100000 steps with 50000 reset in 499 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Graph (trivial) has 180 edges and 145 vertex of which 129 / 145 are part of one of the 15 SCC in 0 ms
Free SCC test removed 114 places
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 31 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 31 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 31 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 31 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 30 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 30 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 1 with 66 rules applied. Total rules applied 75 place count 30 transition count 41
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 22 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 22 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 91 rules in 11 ms. Remains 22 /145 variables (removed 123) and now considering 33/314 (removed 281) transitions.
[2021-05-16 03:26:39] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-16 03:26:39] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
// Phase 1: matrix 27 rows 22 cols
[2021-05-16 03:26:39] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 03:26:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/145 places, 33/314 transitions.
Product exploration explored 100000 steps with 50000 reset in 686 ms.
Product exploration explored 100000 steps with 50000 reset in 523 ms.
[2021-05-16 03:26:40] [INFO ] Flatten gal took : 30 ms
[2021-05-16 03:26:40] [INFO ] Flatten gal took : 31 ms
[2021-05-16 03:26:40] [INFO ] Time to serialize gal into /tmp/LTL6709656179106271133.gal : 4 ms
[2021-05-16 03:26:40] [INFO ] Time to serialize properties into /tmp/LTL11463487361308841830.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/LTL6709656179106271133.gal, -t, CGAL, -LTL, /tmp/LTL11463487361308841830.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/LTL6709656179106271133.gal -t CGAL -LTL /tmp/LTL11463487361308841830.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p111==0)||(p53==1))")||(X(G("((p135==1)&&(p115==0))"))))))
Formula 0 simplified : !X("((p111==0)||(p53==1))" | XG"((p135==1)&&(p115==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
143 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,1.48,55800,1,0,6,258894,14,0,4192,30128,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-12a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-12a-12 finished in 6619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:42] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:42] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:42] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:42] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:42] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:43] [INFO ] Dead Transitions using invariants and state equation in 520 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 314/314 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-12a-13 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 0) (EQ s23 1)), p0:(OR (EQ s23 0) (EQ s8 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15019 reset in 874 ms.
Stack based approach found an accepted trace after 55 steps with 10 reset with depth 5 and stack size 5 in 1 ms.
FORMULA FlexibleBarrier-PT-12a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-13 finished in 2090 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0||G(F(p0))||(X(p2)&&p1))) U (!p2&&X((p0||G(F(p0))||(X(p2)&&p3)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:44] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 03:26:44] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:44] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 03:26:44] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 145 cols
[2021-05-16 03:26:44] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 03:26:44] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 314/314 transitions.
Stuttering acceptance computed with spot in 1053 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-12a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=3 dest: 10}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 12}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 13}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 15}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 15}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=9 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 15}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) (NOT p0) p3)), acceptance={} source=11 dest: 7}], [{ cond=p2, acceptance={} source=12 dest: 2}, { cond=(NOT p2), acceptance={} source=12 dest: 3}, { cond=p2, acceptance={} source=12 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={} source=12 dest: 13}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=12 dest: 15}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=13 dest: 13}, { cond=(AND p2 (NOT p0)), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=13 dest: 15}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=13 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 7}], [{ cond=(AND p2 (NOT p0) p3), acceptance={0} source=15 dest: 8}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=15 dest: 9}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={0} source=15 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=15 dest: 11}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=15 dest: 13}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=15 dest: 15}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=16 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3)), acceptance={} source=16 dest: 7}]], initial=0, aps=[p2:(NEQ s86 1), p0:(AND (NEQ s136 0) (NEQ s86 1)), p1:(AND (NEQ s136 0) (NEQ s86 1)), p3:(AND (NEQ s136 0) (NEQ s86 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][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 171 reset in 458 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA FlexibleBarrier-PT-12a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-15 finished in 2115 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621135607208

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-12a"
export BK_EXAMINATION="LTLCardinality"
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-12a, examination is LTLCardinality"
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-162075331100068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;