Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.6K Apr 29 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 469K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652909461840

Running Version 202205111006
[2022-05-18 21:31:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 21:31:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:31:03] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-18 21:31:03] [INFO ] Transformed 81 places.
[2022-05-18 21:31:03] [INFO ] Transformed 1632 transitions.
[2022-05-18 21:31:03] [INFO ] Parsed PT model containing 81 places and 1632 transitions in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 366 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 20 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:03] [INFO ] Computed 1 place invariants in 35 ms
[2022-05-18 21:31:03] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:03] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-18 21:31:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:04] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-18 21:31:04] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Support contains 27 out of 81 places after structural reductions.
[2022-05-18 21:31:04] [INFO ] Flatten gal took : 98 ms
[2022-05-18 21:31:04] [INFO ] Flatten gal took : 60 ms
[2022-05-18 21:31:05] [INFO ] Input system was already deterministic with 1632 transitions.
Support contains 25 out of 81 places (down from 27) after GAL structural reductions.
Finished random walk after 619 steps, including 0 resets, run visited all 25 properties in 93 ms. (steps per millisecond=6 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((G(p1) U !(G(p2)||p3)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1468 edges and 81 vertex of which 77 / 81 are part of one of the 1 SCC in 3 ms
Free SCC test removed 76 places
Ensure Unique test removed 1623 transitions
Reduce isomorphic transitions removed 1623 transitions.
Applied a total of 1 rules in 11 ms. Remains 5 /81 variables (removed 76) and now considering 9/1632 (removed 1623) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-18 21:31:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:31:05] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-18 21:31:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:31:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-18 21:31:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-18 21:31:05] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-18 21:31:05] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/81 places, 9/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/81 places, 9/1632 transitions.
Stuttering acceptance computed with spot in 558 ms :[(OR p2 p3), true, p2, (NOT p1), (OR p3 p2), (OR p2 p3), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p3 p2), (OR (AND (NOT p1) p2) (AND (NOT p1) p3))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND p1 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND p3 p1 p0), acceptance={1} source=0 dest: 6}, { cond=(AND p3 p1 p0), acceptance={0, 1} source=0 dest: 7}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND p3 p1), acceptance={} source=4 dest: 3}, { cond=(AND p3 p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p1), acceptance={} source=5 dest: 3}, { cond=(AND p3 p1), acceptance={} source=5 dest: 4}, { cond=(OR (NOT p3) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=6 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND p3 p1 p0), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND p3 (NOT p1) p0), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 2}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p3 p1 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p3 p1 p0), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p3 p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(GEQ s0 1), p0:(OR (GEQ s3 1) (GEQ s1 1)), p1:(GEQ s2 1), p2:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 10 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-00 finished in 715 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(F(p1)||p2))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1542 edges and 81 vertex of which 78 / 81 are part of one of the 1 SCC in 4 ms
Free SCC test removed 77 places
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 1625 transitions.
Applied a total of 1 rules in 12 ms. Remains 4 /81 variables (removed 77) and now considering 7/1632 (removed 1625) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-18 21:31:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:31:06] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-18 21:31:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:31:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-18 21:31:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-18 21:31:06] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:31:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/81 places, 7/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/81 places, 7/1632 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s0 1), p2:(GEQ s2 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-01 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(X(G(p1)))&&X(p2)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:06] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-18 21:31:06] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:06] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-18 21:31:06] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:06] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:31:07] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s50 1), p2:(OR (LT s14 1) (LT s4 1)), p1:(GEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3445 ms.
Product exploration explored 100000 steps with 50000 reset in 3319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-03 finished in 10976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((F(p1)||!p0)))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 11 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:17] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-18 21:31:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:17] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-18 21:31:17] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:17] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:31:18] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 174 ms :[false, (AND (NOT p1) p0), false, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(GEQ s11 1), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24091 reset in 5406 ms.
Stack based approach found an accepted trace after 38479 steps with 9268 reset with depth 1323 and stack size 1323 in 2019 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-04 finished in 8339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(F(p1))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:25] [INFO ] Computed 1 place invariants in 12 ms
[2022-05-18 21:31:25] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:25] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-18 21:31:26] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:26] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:31:26] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), 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 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s38 1), p1:(GEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 179 steps with 0 reset in 13 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-05 finished in 845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(X(p0)))))))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1612 edges and 81 vertex of which 80 / 81 are part of one of the 1 SCC in 3 ms
Free SCC test removed 79 places
Ensure Unique test removed 1629 transitions
Reduce isomorphic transitions removed 1629 transitions.
Applied a total of 1 rules in 9 ms. Remains 2 /81 variables (removed 79) and now considering 3/1632 (removed 1629) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:31:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:31:26] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:31:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:31:26] [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.
[2022-05-18 21:31:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:31:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:31:26] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/81 places, 3/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/81 places, 3/1632 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-06 finished in 148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(p0)))||X(p1)||p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:26] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-18 21:31:26] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:26] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-18 21:31:27] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:27] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:31:27] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s34 1), p1:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2860 steps with 0 reset in 218 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-07 finished in 1053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)&&p1))&&p2)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:27] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-18 21:31:27] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:27] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-18 21:31:28] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:28] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-18 21:31:28] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s46 1), p1:(GEQ s49 1), p2:(GEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 6 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-09 finished in 869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X(p1)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:28] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-18 21:31:28] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:28] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-18 21:31:29] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:29] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-18 21:31:29] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 123 ms :[p1, true, p1, p1]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GEQ s20 1), p1:(GEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 164 steps with 0 reset in 17 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-12 finished in 858 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(G((p0 U !X(p1))))&&p2)))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:29] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-18 21:31:29] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:29] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-18 21:31:29] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:29] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:31:30] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s27 1), p0:(GEQ s18 1), p1:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16461 reset in 5653 ms.
Product exploration explored 100000 steps with 16485 reset in 5668 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 7 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Finished random walk after 3797 steps, including 1 resets, run visited all 10 properties in 63 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND p2 p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 p2)), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 1 factoid took 329 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 7 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:46] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:31:46] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:46] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-18 21:31:46] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:31:46] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-18 21:31:47] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 7 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Finished random walk after 512 steps, including 0 resets, run visited all 10 properties in 30 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p2 p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 p2)), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 1 factoid took 251 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 7 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, p1, p1]
Product exploration explored 100000 steps with 16358 reset in 5617 ms.
Product exploration explored 100000 steps with 16252 reset in 5680 ms.
Built C files in :
/tmp/ltsmin14806749195996926612
[2022-05-18 21:32:03] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14806749195996926612
Running compilation step : cd /tmp/ltsmin14806749195996926612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2254 ms.
Running link step : cd /tmp/ltsmin14806749195996926612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14806749195996926612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4372316332975267573.hoa' '--buchi-type=spotba'
LTSmin run took 3388 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-13 finished in 39254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1))||G(p2)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1490 edges and 81 vertex of which 78 / 81 are part of one of the 1 SCC in 3 ms
Free SCC test removed 77 places
Ensure Unique test removed 1621 transitions
Reduce isomorphic transitions removed 1621 transitions.
Applied a total of 1 rules in 8 ms. Remains 4 /81 variables (removed 77) and now considering 11/1632 (removed 1621) transitions.
// Phase 1: matrix 11 rows 4 cols
[2022-05-18 21:32:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:32:08] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 4 cols
[2022-05-18 21:32:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:32:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-18 21:32:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 4 cols
[2022-05-18 21:32:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:32:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/81 places, 11/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/81 places, 11/1632 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND p1 (NOT p2)), p1]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p2:(GEQ s0 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-14 finished in 209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !p0)))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1582 edges and 81 vertex of which 80 / 81 are part of one of the 1 SCC in 3 ms
Free SCC test removed 79 places
Ensure Unique test removed 1629 transitions
Reduce isomorphic transitions removed 1629 transitions.
Applied a total of 1 rules in 17 ms. Remains 2 /81 variables (removed 79) and now considering 3/1632 (removed 1629) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:32:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:32:09] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:32:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:32:09] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-18 21:32:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:32:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:32:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/81 places, 3/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/81 places, 3/1632 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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-d4n3m2c23-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLFireability-15 finished in 158 ms.
All properties solved by simple procedures.
Total runtime 66329 ms.

BK_STOP 1652909529376

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

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

Sequence of Actions to be Executed by the VM

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

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

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