fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331000005
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FlexibleBarrier-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
348.567 18463.00 38310.00 342.60 FFFFFFTFFFTFFFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.3K Mar 28 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:22 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 23K 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-04a-00
FORMULA_NAME FlexibleBarrier-PT-04a-01
FORMULA_NAME FlexibleBarrier-PT-04a-02
FORMULA_NAME FlexibleBarrier-PT-04a-03
FORMULA_NAME FlexibleBarrier-PT-04a-04
FORMULA_NAME FlexibleBarrier-PT-04a-05
FORMULA_NAME FlexibleBarrier-PT-04a-06
FORMULA_NAME FlexibleBarrier-PT-04a-07
FORMULA_NAME FlexibleBarrier-PT-04a-08
FORMULA_NAME FlexibleBarrier-PT-04a-09
FORMULA_NAME FlexibleBarrier-PT-04a-10
FORMULA_NAME FlexibleBarrier-PT-04a-11
FORMULA_NAME FlexibleBarrier-PT-04a-12
FORMULA_NAME FlexibleBarrier-PT-04a-13
FORMULA_NAME FlexibleBarrier-PT-04a-14
FORMULA_NAME FlexibleBarrier-PT-04a-15

=== Now, execution of the tool begins

BK_START 1621112903171

Running Version 0
[2021-05-15 21:08:26] [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 21:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 21:08:26] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-15 21:08:26] [INFO ] Transformed 51 places.
[2021-05-15 21:08:26] [INFO ] Transformed 88 transitions.
[2021-05-15 21:08:26] [INFO ] Found NUPN structural information;
[2021-05-15 21:08:26] [INFO ] Parsed PT model containing 51 places and 88 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 21:08:26] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Support contains 27 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:27] [INFO ] Computed 6 place invariants in 11 ms
[2021-05-15 21:08:27] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:27] [INFO ] Computed 6 place invariants in 11 ms
[2021-05-15 21:08:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-15 21:08:27] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:27] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 21:08:27] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 74/78 transitions.
[2021-05-15 21:08:27] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-15 21:08:27] [INFO ] Flatten gal took : 60 ms
FORMULA FlexibleBarrier-PT-04a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 21:08:28] [INFO ] Flatten gal took : 22 ms
[2021-05-15 21:08:28] [INFO ] Input system was already deterministic with 74 transitions.
Finished random walk after 304 steps, including 0 resets, run visited all 24 properties in 15 ms. (steps per millisecond=20 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F((F(G(p1))&&p0))&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:28] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 21:08:28] [INFO ] Implicit Places using invariants in 126 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:28] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:28] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:28] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 501 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s30 1) (EQ s49 1)), p2:(AND (EQ s24 1) (EQ s35 1) (EQ s49 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 454 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-00 finished in 1429 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((X(G(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:29] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:29] [INFO ] Implicit Places using invariants in 73 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:29] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:29] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s22 1), p1:(AND (EQ s11 1) (EQ s36 1) (EQ s49 1)), p2:(AND (EQ s12 1) (EQ s23 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-01 finished in 771 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X(G(p0))&&(p1||X(p1))))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:30] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:30] [INFO ] Implicit Places using invariants in 73 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:30] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:30] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:30] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-15 21:08:30] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p1) p0), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s47 1), p1:(EQ s13 1), p0:(AND (EQ s24 1) (EQ s35 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 3 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-02 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(F((p0&&F(!p0))))))||((p0||X(F((p0&&F(!p0)))))&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:31] [INFO ] Implicit Places using invariants in 74 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:31] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 21:08:31] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:31] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
[2021-05-15 21:08:31] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), true, (AND (NOT p0) (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s17 1), p1:(OR (NEQ s2 1) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1015 reset in 476 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-03 finished in 1139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X((p1||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:32] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 21:08:32] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:32] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-15 21:08:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-15 21:08:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:32] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:32] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04a-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s9 1) (EQ s50 1)), p1:(AND (EQ s24 1) (EQ s35 1) (EQ s49 1)), p2:(OR (NEQ s30 1) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 111 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-05 finished in 519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 6 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 35 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 35 transition count 57
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 35 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 34 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 34 transition count 56
Applied a total of 29 rules in 48 ms. Remains 34 /51 variables (removed 17) and now considering 56/74 (removed 18) transitions.
[2021-05-15 21:08:32] [INFO ] Flow matrix only has 46 transitions (discarded 10 similar events)
// Phase 1: matrix 46 rows 34 cols
[2021-05-15 21:08:32] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:32] [INFO ] Implicit Places using invariants in 60 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
[2021-05-15 21:08:32] [INFO ] Redundant transitions in 34 ms returned [23, 24, 27, 28, 29, 30]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions :[30, 29, 28, 27, 24, 23]
[2021-05-15 21:08:32] [INFO ] Flow matrix only has 45 transitions (discarded 5 similar events)
// Phase 1: matrix 45 rows 33 cols
[2021-05-15 21:08:32] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:32] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 33/51 places, 50/74 transitions.
Graph (trivial) has 38 edges and 33 vertex of which 6 / 33 are part of one of the 2 SCC in 5 ms
Free SCC test removed 4 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 38
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 25 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 25 transition count 34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 21 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 29 place count 15 transition count 28
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 15 transition count 25
Applied a total of 32 rules in 28 ms. Remains 15 /33 variables (removed 18) and now considering 25/50 (removed 25) transitions.
[2021-05-15 21:08:32] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 15 cols
[2021-05-15 21:08:32] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 21:08:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-15 21:08:33] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 15 cols
[2021-05-15 21:08:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-15 21:08:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/51 places, 25/74 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s11 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-07 finished in 522 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 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 36 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 33 transition count 53
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 33 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 33 transition count 47
Applied a total of 28 rules in 35 ms. Remains 33 /51 variables (removed 18) and now considering 47/74 (removed 27) transitions.
[2021-05-15 21:08:33] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 33 cols
[2021-05-15 21:08:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:33] [INFO ] Implicit Places using invariants in 51 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
[2021-05-15 21:08:33] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 21:08:33] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 32 cols
[2021-05-15 21:08:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:33] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 32/51 places, 47/74 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 32 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 28 transition count 43
Applied a total of 8 rules in 7 ms. Remains 28 /32 variables (removed 4) and now considering 43/47 (removed 4) transitions.
[2021-05-15 21:08:33] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 28 cols
[2021-05-15 21:08:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-15 21:08:33] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 28 cols
[2021-05-15 21:08:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-15 21:08:33] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 28/51 places, 43/74 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s1 0), p1:(AND (EQ s11 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-08 finished in 452 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))||X((G(!p0)&&(p2 U (G(p2)||p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:33] [INFO ] Implicit Places using invariants in 87 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:33] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:33] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), p0, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), true, (OR p0 (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Running random walk in product with property : FlexibleBarrier-PT-04a-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 2}, { cond=(OR p0 (AND (NOT p3) (NOT p2))), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=8 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(OR (AND p0 p1) (AND p1 (NOT p3) (NOT p2))), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s49 1)), p1:(AND (EQ s24 1) (EQ s47 1) (EQ s49 1)), p3:(OR (NEQ s24 1) (NEQ s47 1) (NEQ s49 1)), p2:(NEQ s8 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-11 finished in 788 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:34] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:34] [INFO ] Implicit Places using invariants in 89 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:34] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-15 21:08:34] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 49/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2021-05-15 21:08:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-15 21:08:34] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-12 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: 1}]], initial=2, aps=[p0:(EQ s23 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][false, false, false]]
Product exploration explored 100000 steps with 19034 reset in 354 ms.
Stack based approach found an accepted trace after 146 steps with 26 reset with depth 4 and stack size 4 in 1 ms.
FORMULA FlexibleBarrier-PT-04a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-12 finished in 809 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 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:35] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 21:08:35] [INFO ] Implicit Places using invariants in 272 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:35] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:35] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:35] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:35] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-13 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 s38 1) (NEQ s49 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 31 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-13 finished in 723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 33 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 0 with 22 rules applied. Total rules applied 23 place count 36 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 36 transition count 57
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 35 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 35 transition count 56
Applied a total of 27 rules in 22 ms. Remains 35 /51 variables (removed 16) and now considering 56/74 (removed 18) transitions.
[2021-05-15 21:08:35] [INFO ] Flow matrix only has 46 transitions (discarded 10 similar events)
// Phase 1: matrix 46 rows 35 cols
[2021-05-15 21:08:35] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:36] [INFO ] Implicit Places using invariants in 57 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
[2021-05-15 21:08:36] [INFO ] Redundant transitions in 13 ms returned [26, 27, 28, 31, 32]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions :[32, 31, 28, 27, 26]
[2021-05-15 21:08:36] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
// Phase 1: matrix 45 rows 34 cols
[2021-05-15 21:08:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 34/51 places, 51/74 transitions.
Graph (trivial) has 36 edges and 34 vertex of which 3 / 34 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 32 transition count 43
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 28 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 28 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 24 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 29 place count 18 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 18 transition count 31
Applied a total of 31 rules in 21 ms. Remains 18 /34 variables (removed 16) and now considering 31/51 (removed 20) transitions.
[2021-05-15 21:08:36] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 21:08:36] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 21:08:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-15 21:08:36] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 21:08:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-15 21:08:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/51 places, 31/74 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (AND (EQ s12 1) (EQ s15 1) (EQ s17 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 10 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-14 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G((p0 U p1)) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:08:36] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 21:08:36] [INFO ] Implicit Places using invariants in 65 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:36] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2021-05-15 21:08:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:36] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 6}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(OR p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s44 1), p0:(AND (EQ s28 1) (EQ s49 1)), p2:(OR (EQ s28 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 317 ms.
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Knowledge obtained : [(NOT p1), (NOT p0), p2]
Stuttering acceptance computed with spot in 395 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 187 ms.
Product exploration explored 100000 steps with 25000 reset in 218 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 403 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p1)]
Support contains 3 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 50/50 places, 74/74 transitions.
Graph (trivial) has 42 edges and 50 vertex of which 12 / 50 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 42 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 42 transition count 67
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 16 place count 42 transition count 74
Deduced a syphon composed of 15 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 42 transition count 68
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 22 rules in 36 ms. Remains 42 /50 variables (removed 8) and now considering 68/74 (removed 6) transitions.
[2021-05-15 21:08:39] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-15 21:08:39] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
// Phase 1: matrix 61 rows 42 cols
[2021-05-15 21:08:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 21:08:39] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/50 places, 68/74 transitions.
Product exploration explored 100000 steps with 25000 reset in 507 ms.
Product exploration explored 100000 steps with 25000 reset in 402 ms.
[2021-05-15 21:08:40] [INFO ] Flatten gal took : 23 ms
[2021-05-15 21:08:40] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:08:40] [INFO ] Time to serialize gal into /tmp/LTL2604975185333856400.gal : 3 ms
[2021-05-15 21:08:40] [INFO ] Time to serialize properties into /tmp/LTL4369807324095995254.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/LTL2604975185333856400.gal, -t, CGAL, -LTL, /tmp/LTL4369807324095995254.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/LTL2604975185333856400.gal -t CGAL -LTL /tmp/LTL4369807324095995254.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G(("((p28==1)&&(p50==1))")U("(p44==1)")))U(X("((p28==0)||(p50==0))"))))))
Formula 0 simplified : !XX(G("((p28==1)&&(p50==1))" U "(p44==1)") U X"((p28==0)||(p50==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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.072821,19092,1,0,8,3943,38,0,1240,1228,21
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-04a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-04a-15 finished in 4203 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621112921634

--------------------
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-04a"
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-04a, 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-162075331000005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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