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.r078-tall-165260110400492.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 Eratosthenes-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110400492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Apr 29 16:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 16:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 311K May 10 09:33 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 Eratosthenes-PT-200-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652686260678

Running Version 202205111006
[2022-05-16 07:31:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:31:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:31:02] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-05-16 07:31:02] [INFO ] Transformed 199 places.
[2022-05-16 07:31:02] [INFO ] Transformed 699 transitions.
[2022-05-16 07:31:02] [INFO ] Parsed PT model containing 199 places and 699 transitions in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA Eratosthenes-PT-200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 128 transition count 504
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 128 transition count 504
Drop transitions removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 426 place count 128 transition count 128
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 521 place count 33 transition count 33
Iterating global reduction 0 with 95 rules applied. Total rules applied 616 place count 33 transition count 33
Applied a total of 616 rules in 40 ms. Remains 33 /153 variables (removed 120) and now considering 33/529 (removed 496) transitions.
// Phase 1: matrix 33 rows 33 cols
[2022-05-16 07:31:02] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 07:31:02] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 33 rows 33 cols
[2022-05-16 07:31:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 33 cols
[2022-05-16 07:31:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:02] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33/153 places, 33/529 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/153 places, 33/529 transitions.
Support contains 32 out of 33 places after structural reductions.
[2022-05-16 07:31:02] [INFO ] Flatten gal took : 15 ms
[2022-05-16 07:31:02] [INFO ] Flatten gal took : 4 ms
[2022-05-16 07:31:02] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 25 properties in 16 ms. (steps per millisecond=1 )
FORMULA Eratosthenes-PT-200-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 33 stabilizing places and 33 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 transition count 33
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 0 edges and 33 vertex of which 3 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Applied a total of 1 rules in 4 ms. Remains 3 /33 variables (removed 30) and now considering 3/33 (removed 30) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:03] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:03] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 07:31:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-16 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/33 places, 3/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/33 places, 3/33 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-00 finished in 566 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 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 0 edges and 33 vertex of which 6 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /33 variables (removed 27) and now considering 6/33 (removed 27) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:03] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-16 07:31:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/33 places, 6/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/33 places, 6/33 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1)), p2:(AND (GEQ s4 1) (GEQ s5 1)), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-01 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G((F(p1)&&p0)) U X(p2)) U ((p4 U !p1)&&p3)))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 7 transition count 7
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 7 transition count 7
Applied a total of 52 rules in 3 ms. Remains 7 /33 variables (removed 26) and now considering 7/33 (removed 26) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:03] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:31:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/33 places, 7/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/33 places, 7/33 transitions.
Stuttering acceptance computed with spot in 670 ms :[(OR (NOT p3) p1), (NOT p2), (NOT p2), (AND p1 (NOT p2)), p1, (AND (NOT p0) p1 (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p0)), p1, (AND (NOT p0) p1 p2)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (AND p1 (NOT p4))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND p1 (NOT p4) (NOT p0))), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND p1 (NOT p4) p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p3 p1 p4 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p3 p1 p4), acceptance={0} source=0 dest: 4}, { cond=(AND p3 p1 p4 p0), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 8}], [{ cond=(AND p1 (NOT p4) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p4 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND p1 (NOT p4)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p4) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p4 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p4), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p4 p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND p1 (NOT p4) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p4) p0 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p1 p4 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND p1 p4 p0 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p4)), acceptance={0} source=9 dest: 6}, { cond=(AND p1 p4), acceptance={0} source=9 dest: 9}], [{ cond=(AND p1 (NOT p4) (NOT p0) p2), acceptance={} source=10 dest: 6}, { cond=(AND p1 (NOT p4) p0 p2), acceptance={} source=10 dest: 8}, { cond=(AND p1 p4 (NOT p0) p2), acceptance={} source=10 dest: 9}, { cond=(AND p1 p4 p0 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (GEQ s5 1) (GEQ s6 1)), p1:(AND (GEQ s2 1) (GEQ s5 1)), p4:(GEQ s3 1), p0:(AND (GEQ s1 1) (GEQ s4 1)), p2:(AND (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, 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][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 166 steps with 5 reset in 5 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-04 finished in 792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F(G(F(G(F(X(G(p0)))))))||G(p1))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 0 edges and 33 vertex of which 3 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /33 variables (removed 30) and now considering 3/33 (removed 30) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:04] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-16 07:31:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/33 places, 3/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/33 places, 3/33 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s2 1)), p1:(LT s0 1)], 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 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-05 finished in 1068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 4 transition count 4
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 4 transition count 4
Applied a total of 58 rules in 2 ms. Remains 4 /33 variables (removed 29) and now considering 4/33 (removed 29) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:05] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:05] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/33 places, 4/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/33 places, 4/33 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s2 1) (AND (GEQ s1 1) (GEQ s3 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][false, false, false]]
Product exploration explored 100000 steps with 24631 reset in 98 ms.
Product exploration explored 100000 steps with 24663 reset in 138 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-07 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(!G(p0))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3 transition count 3
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3 transition count 3
Applied a total of 60 rules in 2 ms. Remains 3 /33 variables (removed 30) and now considering 3/33 (removed 30) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:06] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:06] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/33 places, 3/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/33 places, 3/33 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 39969 reset in 113 ms.
Product exploration explored 100000 steps with 39993 reset in 136 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 2 factoid took 595 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-08 finished in 1034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U F(G((G(!p0)||p1)))) U !p2)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 0 edges and 33 vertex of which 5 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /33 variables (removed 28) and now considering 5/33 (removed 28) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:31:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:07] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:31:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-16 07:31:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:31:07] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 07:31:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/33 places, 5/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/33 places, 5/33 transitions.
Stuttering acceptance computed with spot in 151 ms :[p2, (AND p0 (NOT p1)), p2]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s4 1)), p0:(AND (GEQ s0 1) (GEQ s2 1)), p1:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 19463 reset in 145 ms.
Product exploration explored 100000 steps with 19444 reset in 180 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 5 factoid took 583 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-10 finished in 1227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(G(p0))||F(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 4 transition count 4
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 4 transition count 4
Applied a total of 58 rules in 2 ms. Remains 4 /33 variables (removed 29) and now considering 4/33 (removed 29) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/33 places, 4/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/33 places, 4/33 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(LT s3 1), p1:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1273 reset in 38 ms.
Product exploration explored 100000 steps with 1355 reset in 40 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-12 finished in 425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&F(p1)))&&X((X(p2) U p2))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 6 transition count 6
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 6 transition count 6
Applied a total of 54 rules in 2 ms. Remains 6 /33 variables (removed 27) and now considering 6/33 (removed 27) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/33 places, 6/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/33 places, 6/33 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1)), p2:(AND (GEQ s4 1) (GEQ s5 1)), p0:(GEQ s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-13 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2 transition count 2
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2 transition count 2
Applied a total of 62 rules in 2 ms. Remains 2 /33 variables (removed 31) and now considering 2/33 (removed 31) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:09] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/33 places, 2/33 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/33 places, 2/33 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-14 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:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 155 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-14 finished in 140 ms.
All properties solved by simple procedures.
Total runtime 7546 ms.

BK_STOP 1652686269776

--------------------
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="Eratosthenes-PT-200"
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 Eratosthenes-PT-200, 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 r078-tall-165260110400492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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