fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406400076
Last Updated
Jun 28, 2021

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
423.771 8873.00 17273.00 130.40 FFFFFFFFFTFFFTFF 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.r121-tall-162075406400076.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HexagonalGrid-PT-110, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406400076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 11:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 11:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 20:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 20:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-00
FORMULA_NAME HexagonalGrid-PT-110-01
FORMULA_NAME HexagonalGrid-PT-110-02
FORMULA_NAME HexagonalGrid-PT-110-03
FORMULA_NAME HexagonalGrid-PT-110-04
FORMULA_NAME HexagonalGrid-PT-110-05
FORMULA_NAME HexagonalGrid-PT-110-06
FORMULA_NAME HexagonalGrid-PT-110-07
FORMULA_NAME HexagonalGrid-PT-110-08
FORMULA_NAME HexagonalGrid-PT-110-09
FORMULA_NAME HexagonalGrid-PT-110-10
FORMULA_NAME HexagonalGrid-PT-110-11
FORMULA_NAME HexagonalGrid-PT-110-12
FORMULA_NAME HexagonalGrid-PT-110-13
FORMULA_NAME HexagonalGrid-PT-110-14
FORMULA_NAME HexagonalGrid-PT-110-15

=== Now, execution of the tool begins

BK_START 1620784086153

Running Version 0
[2021-05-12 01:48:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 01:48:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 01:48:08] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-12 01:48:08] [INFO ] Transformed 31 places.
[2021-05-12 01:48:08] [INFO ] Transformed 42 transitions.
[2021-05-12 01:48:08] [INFO ] Parsed PT model containing 31 places and 42 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 01:48:08] [INFO ] Initial state test concluded for 1 properties.
FORMULA HexagonalGrid-PT-110-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:08] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-12 01:48:08] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:08] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-12 01:48:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:08] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-12 01:48:08] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
[2021-05-12 01:48:08] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-12 01:48:08] [INFO ] Flatten gal took : 39 ms
FORMULA HexagonalGrid-PT-110-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 01:48:08] [INFO ] Flatten gal took : 7 ms
[2021-05-12 01:48:08] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=264 ) properties (out of 21) seen :17
Running SMT prover for 4 properties.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned unsat
[2021-05-12 01:48:09] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned unsat
[2021-05-12 01:48:09] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2021-05-12 01:48:09] [INFO ] Initial state test concluded for 1 properties.
FORMULA HexagonalGrid-PT-110-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants in 42 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
[2021-05-12 01:48:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:09] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 42/42 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 30 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 18 transition count 36
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 18 place count 18 transition count 31
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 33 place count 8 transition count 31
Graph (trivial) has 25 edges and 8 vertex of which 5 / 8 are part of one of the 1 SCC in 5 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 15 ms. Remains 4 /30 variables (removed 26) and now considering 4/42 (removed 38) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 01:48:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 01:48:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/31 places, 4/42 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-00 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:(LEQ 1 s3)], 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 1 ms.
FORMULA HexagonalGrid-PT-110-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-00 finished in 346 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants in 65 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
[2021-05-12 01:48:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:09] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 15 place count 20 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 27 place count 12 transition count 33
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 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 16 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 5 transition count 31
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 57 place count 5 transition count 8
Applied a total of 57 rules in 4 ms. Remains 5 /30 variables (removed 25) and now considering 8/42 (removed 34) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 01:48:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 01:48:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/31 places, 8/42 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-110-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 s4), p1:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-01 finished in 245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 01:48:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants in 31 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
[2021-05-12 01:48:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:09] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, 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
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 36 place count 6 transition count 30
Graph (trivial) has 20 edges and 6 vertex of which 5 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 2 transition count 30
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 64 place count 2 transition count 3
Applied a total of 64 rules in 8 ms. Remains 2 /30 variables (removed 28) and now considering 3/42 (removed 39) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-12 01:48:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-12 01:48:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 01:48:09] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/31 places, 3/42 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-04 finished in 150 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((p0||G(F(p1)))))&&G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:10] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Implicit Places using invariants in 39 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:10] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:10] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 01:48:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-110-06 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (LEQ 1 s15) (LEQ s10 s4)), p0:(LEQ s21 s10), p1:(GT s10 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-06 finished in 229 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0)) U (p1||G(F(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 01:48:10] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Implicit Places using invariants in 45 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:10] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:10] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 108 ms :[false, false, false, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : HexagonalGrid-PT-110-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s11), p0:(GT 2 s2)], 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 17627 reset in 301 ms.
Stack based approach found an accepted trace after 1537 steps with 300 reset with depth 168 and stack size 161 in 4 ms.
FORMULA HexagonalGrid-PT-110-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-07 finished in 528 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:10] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Implicit Places using invariants in 57 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:10] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 01:48:10] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:10] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s7 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 171 ms.
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 123 ms.
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 42/42 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 30 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 30 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 30 transition count 74
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 10 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 74/42 (removed -32) transitions.
[2021-05-12 01:48:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 30 cols
[2021-05-12 01:48:11] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 74/42 transitions.
Product exploration explored 100000 steps with 25000 reset in 290 ms.
Product exploration explored 100000 steps with 25000 reset in 286 ms.
[2021-05-12 01:48:12] [INFO ] Flatten gal took : 12 ms
[2021-05-12 01:48:12] [INFO ] Flatten gal took : 3 ms
[2021-05-12 01:48:12] [INFO ] Time to serialize gal into /tmp/LTL9702986628115456025.gal : 101 ms
[2021-05-12 01:48:12] [INFO ] Time to serialize properties into /tmp/LTL12653976224745523506.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/LTL9702986628115456025.gal, -t, CGAL, -LTL, /tmp/LTL12653976224745523506.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/LTL9702986628115456025.gal -t CGAL -LTL /tmp/LTL12653976224745523506.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(pi2_1_1<=pil3_1_1)"))))))
Formula 0 simplified : !XXXF"(pi2_1_1<=pil3_1_1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
4 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.057752,17332,1,0,8,7032,20,0,806,5448,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HexagonalGrid-PT-110-09 finished in 2039 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:12] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-12 01:48:12] [INFO ] Implicit Places using invariants in 33 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:12] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 01:48:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:12] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 01:48:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-10 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s7 s10)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-10 finished in 177 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:12] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:13] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:13] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 01:48:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-110-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s2), p1:(GT s6 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Stack based approach found an accepted trace after 183 steps with 1 reset with depth 181 and stack size 181 in 1 ms.
FORMULA HexagonalGrid-PT-110-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-11 finished in 412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)&&X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2021-05-12 01:48:13] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants in 27 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:13] [INFO ] Computed 13 place invariants in 8 ms
[2021-05-12 01:48:13] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:13] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-110-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s4 s12), p0:(GT s11 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7 reset in 189 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA HexagonalGrid-PT-110-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-12 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 01:48:13] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants in 63 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
[2021-05-12 01:48:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:13] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, 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 25 edges and 8 vertex of which 5 / 8 are part of one of the 1 SCC in 0 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 3 ms. Remains 4 /30 variables (removed 26) and now considering 4/42 (removed 38) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 01:48:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 01:48:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/31 places, 4/42 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-14 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 01:48:13] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-12 01:48:13] [INFO ] Implicit Places using invariants in 29 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
[2021-05-12 01:48:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2021-05-12 01:48:14] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-12 01:48:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 15 place count 20 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 27 place count 12 transition count 33
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 30 place count 10 transition count 32
Graph (trivial) has 20 edges and 10 vertex of which 4 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 7 transition count 32
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 54 place count 7 transition count 9
Applied a total of 54 rules in 3 ms. Remains 7 /30 variables (removed 23) and now considering 9/42 (removed 33) transitions.
// Phase 1: matrix 9 rows 7 cols
[2021-05-12 01:48:14] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 01:48:14] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2021-05-12 01:48:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 01:48:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/31 places, 9/42 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s4)], 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 57 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-15 finished in 129 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620784095026

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HexagonalGrid-PT-110"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HexagonalGrid-PT-110, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406400076"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;