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.r140-tall-162089127300109.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 NeighborGrid-PT-d5n4m1t35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127300109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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.8K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 59M 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 NeighborGrid-PT-d5n4m1t35-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-15

=== Now, execution of the tool begins

BK_START 1620931059428

Running Version 0
[2021-05-13 18:37:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 18:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:37:42] [INFO ] Load time of PNML (sax parser for PT used): 1792 ms
[2021-05-13 18:37:42] [INFO ] Transformed 1024 places.
[2021-05-13 18:37:43] [INFO ] Transformed 196608 transitions.
[2021-05-13 18:37:43] [INFO ] Parsed PT model containing 1024 places and 196608 transitions in 2175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 72 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 18:37:43] [INFO ] Initial state test concluded for 4 properties.
FORMULA NeighborGrid-PT-d5n4m1t35-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 11053 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:37:59] [INFO ] Computed 1 place invariants in 3883 ms
[2021-05-13 18:37:59] [INFO ] Implicit Places using invariants in 4384 ms returned []
Implicit Place search using SMT only with invariants took 4859 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:38:03] [INFO ] Computed 1 place invariants in 3547 ms
[2021-05-13 18:38:33] [INFO ] Performed 98758/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:39:02] [INFO ] Dead Transitions using invariants and state equation in 62615 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
[2021-05-13 18:39:05] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 18:39:05] [INFO ] Flatten gal took : 3197 ms
FORMULA NeighborGrid-PT-d5n4m1t35-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:39:08] [INFO ] Flatten gal took : 2623 ms
[2021-05-13 18:39:15] [INFO ] Input system was already deterministic with 196608 transitions.
Finished random walk after 3446 steps, including 0 resets, run visited all 29 properties in 29213 ms. (steps per millisecond=0 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 140 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 315 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 18:39:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:39:45] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 18:39:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:39:45] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-13 18:39:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 18:39:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:39:45] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/1024 places, 5/196608 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-01 finished in 648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8375 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:39:57] [INFO ] Computed 1 place invariants in 3403 ms
[2021-05-13 18:39:57] [INFO ] Implicit Places using invariants in 3575 ms returned []
Implicit Place search using SMT only with invariants took 3584 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:40:00] [INFO ] Computed 1 place invariants in 3166 ms
[2021-05-13 18:40:30] [INFO ] Performed 98817/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:40:59] [INFO ] Dead Transitions using invariants and state equation in 61890 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s408 1), p0:(GEQ s795 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 282 steps with 0 reset in 3671 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-02 finished in 77832 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&(p0||(p1 U X(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5711 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:41:11] [INFO ] Computed 1 place invariants in 2541 ms
[2021-05-13 18:41:11] [INFO ] Implicit Places using invariants in 2704 ms returned []
Implicit Place search using SMT only with invariants took 2705 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:41:14] [INFO ] Computed 1 place invariants in 2969 ms
[2021-05-13 18:41:44] [INFO ] Performed 106279/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:42:10] [INFO ] Dead Transitions using invariants and state equation in 58493 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s456 1), p1:(OR (GEQ s456 1) (GEQ s78 1)), p2:(GEQ s783 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 770 steps with 0 reset in 10016 ms.
Product exploration timeout after 840 steps with 3 reset in 10066 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p2), true]
Product exploration timeout after 830 steps with 8 reset in 10019 ms.
Product exploration timeout after 830 steps with 2 reset in 10113 ms.
Applying partial POR strategy [false, true, true, false, true]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p2), true]
Support contains 3 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195458 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 28 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196599 transitions
Reduce isomorphic transitions removed 196599 transitions.
Applied a total of 1 rules in 271 ms. Remains 4 /1024 variables (removed 1020) and now considering 9/196608 (removed 196599) transitions.
[2021-05-13 18:42:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 4 cols
[2021-05-13 18:42:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:42:51] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1024 places, 9/196608 transitions.
Stuttering criterion allowed to conclude after 5 steps with 2 reset in 38 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-03 finished in 108483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6065 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:43:00] [INFO ] Computed 1 place invariants in 2534 ms
[2021-05-13 18:43:00] [INFO ] Implicit Places using invariants in 2703 ms returned []
Implicit Place search using SMT only with invariants took 2704 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:43:03] [INFO ] Computed 1 place invariants in 2794 ms
[2021-05-13 18:43:33] [INFO ] Performed 105530/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:43:59] [INFO ] Dead Transitions using invariants and state equation in 58628 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(LT s293 1), p0:(LT s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 870 steps with 1 reset in 10120 ms.
Product exploration timeout after 810 steps with 1 reset in 10111 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration timeout after 810 steps with 0 reset in 10023 ms.
Product exploration timeout after 890 steps with 2 reset in 10093 ms.
Applying partial POR strategy [true, true, true, true, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 28 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 150 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
[2021-05-13 18:44:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 18:44:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:44:40] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/1024 places, 5/196608 transitions.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 14 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-05 finished in 108836 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(X((p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6224 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:44:49] [INFO ] Computed 1 place invariants in 2580 ms
[2021-05-13 18:44:49] [INFO ] Implicit Places using invariants in 2858 ms returned []
Implicit Place search using SMT only with invariants took 2858 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:44:52] [INFO ] Computed 1 place invariants in 2586 ms
[2021-05-13 18:45:22] [INFO ] Performed 104096/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:45:49] [INFO ] Dead Transitions using invariants and state equation in 59640 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GEQ s997 1), p2:(AND (LT s247 1) (OR (GEQ s530 1) (GEQ s247 1))), p1:(OR (GEQ s530 1) (GEQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 1720 steps with 860 reset in 10003 ms.
Product exploration timeout after 1730 steps with 865 reset in 10035 ms.
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration timeout after 1650 steps with 784 reset in 10049 ms.
Product exploration timeout after 1720 steps with 860 reset in 10050 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195458 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 40 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196599 transitions
Reduce isomorphic transitions removed 196599 transitions.
Applied a total of 1 rules in 174 ms. Remains 4 /1024 variables (removed 1020) and now considering 9/196608 (removed 196599) transitions.
[2021-05-13 18:46:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 4 cols
[2021-05-13 18:46:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:46:30] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1024 places, 9/196608 transitions.
Entered a terminal (fully accepting) state of product in 809 steps with 396 reset in 4626 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-06 finished in 114567 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6014 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:46:43] [INFO ] Computed 1 place invariants in 2530 ms
[2021-05-13 18:46:43] [INFO ] Implicit Places using invariants in 2691 ms returned []
Implicit Place search using SMT only with invariants took 2692 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:46:46] [INFO ] Computed 1 place invariants in 2513 ms
[2021-05-13 18:47:16] [INFO ] Performed 103237/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:47:43] [INFO ] Dead Transitions using invariants and state equation in 59455 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s299 1) (GEQ s849 1)), p0:(GEQ s371 1), p2:(GEQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 740 steps with 0 reset in 10065 ms.
Product exploration timeout after 740 steps with 0 reset in 10031 ms.
Knowledge obtained : [p1, p0, p2]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 54 ms :[true, (AND p1 (NOT p0)), (NOT p0)]
Support contains 3 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6723 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:48:13] [INFO ] Computed 1 place invariants in 3070 ms
[2021-05-13 18:48:13] [INFO ] Implicit Places using invariants in 3234 ms returned []
Implicit Place search using SMT only with invariants took 3236 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:48:16] [INFO ] Computed 1 place invariants in 2560 ms
[2021-05-13 18:48:46] [INFO ] Performed 102014/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:49:14] [INFO ] Dead Transitions using invariants and state equation in 60267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (AND p1 (NOT p0)), (NOT p0)]
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 1336 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-07 finished in 160628 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G(p0))||(X(X(p1))&&F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6449 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:49:25] [INFO ] Computed 1 place invariants in 3037 ms
[2021-05-13 18:49:25] [INFO ] Implicit Places using invariants in 3200 ms returned []
Implicit Place search using SMT only with invariants took 3200 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:49:27] [INFO ] Computed 1 place invariants in 2562 ms
[2021-05-13 18:49:58] [INFO ] Performed 105044/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:50:24] [INFO ] Dead Transitions using invariants and state equation in 58752 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-08 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(LT s130 1), p1:(GEQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 770 steps with 0 reset in 10074 ms.
Product exploration timeout after 810 steps with 0 reset in 10044 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Product exploration timeout after 770 steps with 0 reset in 10076 ms.
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 397 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-08 finished in 99614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6572 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:51:04] [INFO ] Computed 1 place invariants in 2572 ms
[2021-05-13 18:51:04] [INFO ] Implicit Places using invariants in 2855 ms returned []
Implicit Place search using SMT only with invariants took 2855 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:51:07] [INFO ] Computed 1 place invariants in 2483 ms
[2021-05-13 18:51:37] [INFO ] Performed 104210/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:52:04] [INFO ] Dead Transitions using invariants and state equation in 59686 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 1670 steps with 835 reset in 10042 ms.
Product exploration timeout after 1080 steps with 270 reset in 10043 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 1010 steps with 193 reset in 10023 ms.
Product exploration timeout after 1430 steps with 587 reset in 10044 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 196224 edges and 1024 vertex of which 1023 / 1024 are part of one of the 1 SCC in 27 ms
Free SCC test removed 1022 places
Ensure Unique test removed 196605 transitions
Reduce isomorphic transitions removed 196605 transitions.
Applied a total of 1 rules in 147 ms. Remains 2 /1024 variables (removed 1022) and now considering 3/196608 (removed 196605) transitions.
[2021-05-13 18:52:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:52:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:52:45] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1024 places, 3/196608 transitions.
Stuttering criterion allowed to conclude after 4303 steps with 2151 reset in 1048 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-09 finished in 111129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (X((p1&&G(p2)))||(p3 U (p4||G(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6239 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:52:55] [INFO ] Computed 1 place invariants in 2642 ms
[2021-05-13 18:52:55] [INFO ] Implicit Places using invariants in 2807 ms returned []
Implicit Place search using SMT only with invariants took 2808 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:52:58] [INFO ] Computed 1 place invariants in 2850 ms
[2021-05-13 18:53:28] [INFO ] Performed 105902/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:53:54] [INFO ] Dead Transitions using invariants and state equation in 59065 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p4) (NOT p3))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-10 automaton TGBA [mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p4) (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p4) p3 (NOT p1)) (AND (NOT p4) p3 (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p4) p3 (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p4) (NOT p3) p1 p2), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p4) p3 p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1 p2), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))), acceptance={} source=2 dest: 7}, { cond=(OR (AND (NOT p4) p3 (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p2))), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND p4 (NOT p0) p1 p2) (AND p3 (NOT p0) p1 p2)), acceptance={} source=3 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p4) p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p4:(AND (LT s284 1) (LT s844 1)), p3:(LT s844 1), p0:(GEQ s992 1), p1:(GEQ s614 1), p2:(GEQ s284 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 790 steps with 0 reset in 10051 ms.
Product exploration timeout after 790 steps with 0 reset in 10082 ms.
Knowledge obtained : [(NOT p4), (NOT p3), p0, p1, p2]
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p4) (NOT p3))]
Product exploration timeout after 780 steps with 0 reset in 10036 ms.
Product exploration timeout after 780 steps with 0 reset in 10027 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p4) (NOT p3))]
Support contains 4 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195072 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 26 ms
Free SCC test removed 1019 places
Ensure Unique test removed 196599 transitions
Reduce isomorphic transitions removed 196599 transitions.
Applied a total of 1 rules in 147 ms. Remains 5 /1024 variables (removed 1019) and now considering 9/196608 (removed 196599) transitions.
[2021-05-13 18:54:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-13 18:54:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 18:54:36] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/1024 places, 9/196608 transitions.
Stuttering criterion allowed to conclude after 248 steps with 0 reset in 2706 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-10 finished in 112732 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 196224 edges and 1024 vertex of which 1023 / 1024 are part of one of the 1 SCC in 26 ms
Free SCC test removed 1022 places
Ensure Unique test removed 196605 transitions
Reduce isomorphic transitions removed 196605 transitions.
Applied a total of 1 rules in 147 ms. Remains 2 /1024 variables (removed 1022) and now considering 3/196608 (removed 196605) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:54:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:54:39] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:54:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:54:39] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-13 18:54:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:54:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:54:39] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1024 places, 3/196608 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-12 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G((p1||(p2&&X(p3))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6057 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:54:48] [INFO ] Computed 1 place invariants in 3264 ms
[2021-05-13 18:54:48] [INFO ] Implicit Places using invariants in 3428 ms returned []
Implicit Place search using SMT only with invariants took 3428 ms to find 0 implicit places.
// Phase 1: matrix 196608 rows 1024 cols
[2021-05-13 18:54:51] [INFO ] Computed 1 place invariants in 2583 ms
[2021-05-13 18:55:21] [INFO ] Performed 105908/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 18:55:47] [INFO ] Dead Transitions using invariants and state equation in 58531 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), true]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(LT s500 1), p2:(GEQ s626 1), p0:(LT s251 1), p3:(LT s533 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 50 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-13 finished in 68389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1024 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 196224 edges and 1024 vertex of which 1023 / 1024 are part of one of the 1 SCC in 26 ms
Free SCC test removed 1022 places
Ensure Unique test removed 196605 transitions
Reduce isomorphic transitions removed 196605 transitions.
Applied a total of 1 rules in 146 ms. Remains 2 /1024 variables (removed 1022) and now considering 3/196608 (removed 196605) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:55:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:55:47] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:55:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 18:55:47] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-13 18:55:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 18:55:47] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 18:55:47] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1024 places, 3/196608 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-15 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:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-15 finished in 279 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620932149091

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d5n4m1t35"
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 NeighborGrid-PT-d5n4m1t35, 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 r140-tall-162089127300109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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