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.r258-tall-165303546000659.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 TriangularGrid-PT-1500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546000659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 9.7K Apr 29 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 29 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 11:32 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 4.0K May 9 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 9.7K 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 TriangularGrid-PT-1500-LTLCardinality-00
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-01
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-02
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-03
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-04
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-05
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-06
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-07
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-08
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-09
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-10
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-11
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-12
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-13
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-14
FORMULA_NAME TriangularGrid-PT-1500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653170048569

Running Version 202205111006
[2022-05-21 21:54:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 21:54:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 21:54:09] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-05-21 21:54:09] [INFO ] Transformed 16 places.
[2022-05-21 21:54:09] [INFO ] Transformed 12 transitions.
[2022-05-21 21:54:09] [INFO ] Parsed PT model containing 16 places and 12 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TriangularGrid-PT-1500-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:10] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-21 21:54:10] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:10] [INFO ] Computed 8 place invariants in 10 ms
[2022-05-21 21:54:10] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:10] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 21:54:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 12/12 transitions.
Support contains 14 out of 16 places after structural reductions.
[2022-05-21 21:54:10] [INFO ] Flatten gal took : 14 ms
[2022-05-21 21:54:10] [INFO ] Flatten gal took : 5 ms
[2022-05-21 21:54:10] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:11] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-21 21:54:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-21 21:54:11] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 21:54:11] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-21 21:54:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-21 21:54:11] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 21:54:11] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 5 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TriangularGrid-PT-1500-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA TriangularGrid-PT-1500-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X((X((G(X(p1)) U p2))&&(p1 U p2)&&p0)))'
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:11] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:11] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:11] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 21:54:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:11] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 21:54:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ s3 s14), p0:(AND (LEQ s3 s14) (LEQ s2 s13)), p2:(LEQ s9 s11)], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-00 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X((false U p0))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:11] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:11] [INFO ] Implicit Places using invariants in 27 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s13 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 149 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 : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA TriangularGrid-PT-1500-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TriangularGrid-PT-1500-LTLCardinality-01 finished in 620 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:12] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:12] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s6)], 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 6 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-02 finished in 162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p0))&&p0)) U (X(X((F(p1)&&p1)))&&p1)))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:12] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 21:54:12] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:12] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:12] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:12] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 555 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(NOT p1), acceptance={} source=4 dest: 10}, { cond=p1, acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={} source=5 dest: 12}, { cond=p0, acceptance={} source=5 dest: 13}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 7}], [{ cond=(NOT p1), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 2}], [{ cond=(NOT p1), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s7), p0:(LEQ s2 s3)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 203 ms.
Stack based approach found an accepted trace after 36 steps with 2 reset with depth 31 and stack size 31 in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-04 finished in 866 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(((!(p1 U p2)||p3) U X(p4)))))'
Support contains 8 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:13] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 21:54:13] [INFO ] Implicit Places using invariants in 29 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 836 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (NOT p4), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (NOT p4), (AND p2 (NOT p4)), (AND (NOT p4) p0), (OR (AND (NOT p2) (NOT p4)) (AND p3 (NOT p4)) (AND p0 (NOT p4))), (AND p0 p2 (NOT p4)), true, (AND p0 (NOT p4)), (NOT p0), p2, (AND (NOT p0) p2), (AND p2 (NOT p4)), (AND (NOT p0) p2 p3 (NOT p4)), (AND p2 (NOT p4)), (AND p0 p2 (NOT p4)), (AND p0 p2 (NOT p4))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR p3 (NOT p2)), acceptance={0, 1} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=0 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={1} source=0 dest: 5}], [{ cond=(AND (NOT p3) p2 (NOT p4) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(OR (AND p3 (NOT p4) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p0))), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=(OR (AND p3 (NOT p4)) (AND (NOT p2) (NOT p4))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p4)) (AND (NOT p2) (NOT p4))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4)), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(NOT p0), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p4) p0), acceptance={0} source=4 dest: 0}, { cond=(OR (AND p3 (NOT p4) p0) (AND (NOT p2) (NOT p4) p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p4) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4) p0), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p4) p0), acceptance={} source=4 dest: 11}], [{ cond=(AND p2 (NOT p4) p0), acceptance={0} source=5 dest: 0}, { cond=(AND p3 p2 (NOT p4) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p4) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4)), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p4) (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND p2 (NOT p4) p0), acceptance={} source=5 dest: 11}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND p1 (NOT p2) (NOT p4) p0), acceptance={} source=5 dest: 13}, { cond=(AND p1 (NOT p2) (NOT p4)), acceptance={} source=5 dest: 14}, { cond=(AND p3 p1 (NOT p2) (NOT p4)), acceptance={1} source=5 dest: 16}], [{ cond=(AND (NOT p4) p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 (NOT p4)) (AND (NOT p2) (NOT p4))), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4)), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 (NOT p4) p0), acceptance={} source=8 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p4) p0), acceptance={} source=8 dest: 12}], [{ cond=true, acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=10 dest: 6}, { cond=(OR (AND p3 p0) (AND (NOT p2) p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=10 dest: 8}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 9}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=p2, acceptance={} source=12 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 12}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=13 dest: 9}, { cond=(AND p2 p0), acceptance={} source=13 dest: 11}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=13 dest: 12}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=13 dest: 13}], [{ cond=p2, acceptance={0} source=14 dest: 0}, { cond=(AND p3 p2), acceptance={0, 1} source=14 dest: 2}, { cond=p2, acceptance={} source=14 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=14 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={1} source=14 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=14 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=14 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=14 dest: 14}, { cond=(AND p3 p1 (NOT p2)), acceptance={1} source=14 dest: 16}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=14 dest: 17}], [{ cond=(AND (NOT p3) p2 (NOT p4) (NOT p0)), acceptance={} source=15 dest: 6}, { cond=(AND p3 p2 (NOT p4) (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=15 dest: 8}, { cond=(AND p3 p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=15 dest: 18}], [{ cond=(AND p3 p2 (NOT p4)), acceptance={} source=16 dest: 1}, { cond=(AND p3 p2 (NOT p4)), acceptance={0, 1} source=16 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={0, 1} source=16 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4)), acceptance={1} source=16 dest: 5}, { cond=(AND p3 p1 (NOT p2) (NOT p4)), acceptance={} source=16 dest: 15}, { cond=(AND p3 p1 (NOT p2) (NOT p4)), acceptance={1} source=16 dest: 16}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=17 dest: 6}, { cond=(AND p3 p2 p0), acceptance={} source=17 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=17 dest: 8}, { cond=(AND p2 p0), acceptance={} source=17 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p3) p2 (NOT p4) p0), acceptance={} source=18 dest: 6}, { cond=(AND p3 p2 (NOT p4) p0), acceptance={} source=18 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p4) p0), acceptance={} source=18 dest: 8}, { cond=(AND p3 p1 (NOT p2) (NOT p4) p0), acceptance={} source=18 dest: 18}]], initial=0, aps=[p3:(LEQ s9 s10), p2:(LEQ s8 s5), p1:(GT s3 s11), p4:(LEQ 1 s10), p0:(LEQ s2 s12)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 333 steps with 73 reset in 1 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-07 finished in 922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:14] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s3 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-08 finished in 129 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:14] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants in 29 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 7 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 5 transition count 7
Graph (trivial) has 4 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 4 transition count 7
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 4 transition count 4
Applied a total of 19 rules in 10 ms. Remains 4 /15 variables (removed 11) and now considering 4/12 (removed 8) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-21 21:54:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-21 21:54:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/16 places, 4/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/16 places, 4/12 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s2)], 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 3 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-11 finished in 177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(p0 U (X(F(G(F(p1))))&&X(X(F(p0))))))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:14] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants in 30 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 7 transition count 8
Applied a total of 12 rules in 3 ms. Remains 7 /15 variables (removed 8) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 7 cols
[2022-05-21 21:54:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2022-05-21 21:54:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 21:54:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/16 places, 8/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/16 places, 8/12 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p1 p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s4 s3), p0:(LEQ s1 s6)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Stack based approach found an accepted trace after 205 steps with 0 reset with depth 206 and stack size 175 in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-14 finished in 305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||!p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-21 21:54:15] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 21:54:15] [INFO ] Implicit Places using invariants in 30 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLCardinality-15 finished in 164 ms.
All properties solved by simple procedures.
Total runtime 5510 ms.

BK_STOP 1653170055297

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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="TriangularGrid-PT-1500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TriangularGrid-PT-1500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303546000659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-1500.tgz
mv TriangularGrid-PT-1500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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