fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477400212
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HexagonalGrid-PT-110

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
315.995 19535.00 33878.00 316.10 FTFFFFFFFFFTFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.4K Apr 29 11:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 11:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 29K May 10 09:34 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 HexagonalGrid-PT-110-LTLFireability-00
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-01
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-02
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-03
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-04
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-05
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-06
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-07
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-08
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-09
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-10
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-11
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-12
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-13
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-14
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652702975674

Running Version 202205111006
[2022-05-16 12:09:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 12:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 12:09:38] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-16 12:09:38] [INFO ] Transformed 31 places.
[2022-05-16 12:09:38] [INFO ] Transformed 42 transitions.
[2022-05-16 12:09:38] [INFO ] Parsed PT model containing 31 places and 42 transitions in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HexagonalGrid-PT-110-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 19 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:39] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-16 12:09:39] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:39] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-16 12:09:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:39] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 12:09:39] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Support contains 23 out of 31 places after structural reductions.
[2022-05-16 12:09:39] [INFO ] Flatten gal took : 48 ms
[2022-05-16 12:09:39] [INFO ] Flatten gal took : 26 ms
[2022-05-16 12:09:39] [INFO ] Input system was already deterministic with 42 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 16 properties in 39 ms. (steps per millisecond=0 )
FORMULA HexagonalGrid-PT-110-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HexagonalGrid-PT-110-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HexagonalGrid-PT-110-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 11 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:40] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:40] [INFO ] Implicit Places using invariants in 126 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 30 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 20 transition count 37
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 15 place count 20 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 10 transition count 32
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 8 transition count 31
Graph (trivial) has 20 edges and 8 vertex of which 5 / 8 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 4 transition count 31
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 61 place count 4 transition count 4
Applied a total of 61 rules in 20 ms. Remains 4 /30 variables (removed 26) and now considering 4/42 (removed 38) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 12:09:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 12:09:40] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 12:09:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 12:09:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/31 places, 4/42 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/31 places, 4/42 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s3 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 0 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-00 finished in 575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F((!(p0 U p1)||G(p0))))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:41] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:41] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:41] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 12:09:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-16 12:09:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:41] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 12:09:41] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s12 1)), p1:(OR (AND (GEQ s13 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5627 reset in 750 ms.
Stack based approach found an accepted trace after 259 steps with 17 reset with depth 12 and stack size 12 in 2 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-03 finished in 1108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(X(!(p0 U !p1))))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:42] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:42] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2022-05-16 12:09:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s11 1)), p0:(AND (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6961 reset in 287 ms.
Stack based approach found an accepted trace after 244 steps with 13 reset with depth 20 and stack size 20 in 2 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-04 finished in 788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U X(!F(X(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:43] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:43] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:43] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(AND (GEQ s6 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7606 reset in 246 ms.
Stack based approach found an accepted trace after 632 steps with 49 reset with depth 35 and stack size 35 in 2 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-05 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(X(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:43] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:43] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s10 1)), p1:(AND (GEQ s6 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7693 reset in 331 ms.
Stack based approach found an accepted trace after 859 steps with 68 reset with depth 9 and stack size 9 in 3 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-06 finished in 654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:44] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:44] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:44] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 12:09:44] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:44] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-16 12:09:44] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-07 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:44] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 12:09:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:44] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 12:09:44] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-05-16 12:09:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:44] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:45] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7609 reset in 317 ms.
Stack based approach found an accepted trace after 84 steps with 7 reset with depth 15 and stack size 15 in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-10 finished in 1303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X((F(p2)||p1))||p0))||X(p3)))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:45] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:45] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:45] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:45] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p3:(AND (GEQ s5 1) (GEQ s30 1)), p0:(OR (LT s1 1) (LT s26 1)), p2:(OR (LT s6 1) (LT s10 1)), p1:(OR (LT s1 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 46145 reset in 285 ms.
Product exploration explored 100000 steps with 46159 reset in 287 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 4 AP to 4 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p3 (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 4 states, 4 edges and 4 AP to 4 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:47] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:47] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:47] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 12:09:48] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:48] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 12:09:48] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p2 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 4 states, 4 edges and 4 AP to 4 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 109 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p3 p2 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 281 ms. Reduced automaton from 4 states, 4 edges and 4 AP to 4 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 46205 reset in 415 ms.
Product exploration explored 100000 steps with 46109 reset in 345 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2022-05-16 12:09:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:51] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Product exploration explored 100000 steps with 46073 reset in 487 ms.
Product exploration explored 100000 steps with 46149 reset in 410 ms.
Built C files in :
/tmp/ltsmin6758580649534081494
[2022-05-16 12:09:52] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6758580649534081494
Running compilation step : cd /tmp/ltsmin6758580649534081494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 404 ms.
Running link step : cd /tmp/ltsmin6758580649534081494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin6758580649534081494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4451898054291496867.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-110-LTLFireability-11 finished in 6943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(!p1))||(G(F(p1))&&X(p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:52] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:52] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 12:09:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:53] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 525 ms :[false, (NOT p1), false, false, true, (NOT p1), (NOT p1), p1, p1, false, false]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 p0), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=p1, acceptance={} source=10 dest: 5}, { cond=(NOT p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(AND (GEQ s17 1) (GEQ s23 1)), p0:(AND (GEQ s6 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-12 finished in 808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U F(!X(F(!p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:53] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:53] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:53] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-16 12:09:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:53] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 12:09:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s9 1) (NOT (AND (GEQ s6 1) (GEQ s10 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-13 finished in 703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||X(p1))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:54] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:54] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:54] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 12:09:54] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-14 automaton TGBA Formula[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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s6 1) (GEQ s10 1)), p1:(AND (GEQ s3 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 3 reset in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-14 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:54] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 12:09:54] [INFO ] Implicit Places using invariants in 74 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 32918 reset in 135 ms.
Stack based approach found an accepted trace after 1215 steps with 394 reset with depth 14 and stack size 14 in 4 ms.
FORMULA HexagonalGrid-PT-110-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLFireability-15 finished in 326 ms.
All properties solved by simple procedures.
Total runtime 16935 ms.

BK_STOP 1652702995209

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HexagonalGrid-PT-110"
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 HexagonalGrid-PT-110, 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 r114-smll-165264477400212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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