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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.4K Apr 29 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 16:02 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.7K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1006K 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-500-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652686310765

Running Version 202205111006
[2022-05-16 07:31:52] [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:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:31:52] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-05-16 07:31:52] [INFO ] Transformed 499 places.
[2022-05-16 07:31:52] [INFO ] Transformed 2191 transitions.
[2022-05-16 07:31:52] [INFO ] Parsed PT model containing 499 places and 2191 transitions in 287 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 2 formulas.
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 509 transitions
Reduce redundant transitions removed 509 transitions.
FORMULA Eratosthenes-PT-500-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1682/1682 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 334 transition count 1612
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 334 transition count 1612
Drop transitions removed 1278 transitions
Redundant transition composition rules discarded 1278 transitions
Iterating global reduction 0 with 1278 rules applied. Total rules applied 1418 place count 334 transition count 334
Discarding 294 places :
Symmetric choice reduction at 0 with 294 rule applications. Total rules 1712 place count 40 transition count 40
Iterating global reduction 0 with 294 rules applied. Total rules applied 2006 place count 40 transition count 40
Applied a total of 2006 rules in 64 ms. Remains 40 /404 variables (removed 364) and now considering 40/1682 (removed 1642) transitions.
// Phase 1: matrix 40 rows 40 cols
[2022-05-16 07:31:52] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-16 07:31:52] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2022-05-16 07:31:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:52] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 40 cols
[2022-05-16 07:31:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/404 places, 40/1682 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/404 places, 40/1682 transitions.
Support contains 39 out of 40 places after structural reductions.
[2022-05-16 07:31:53] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:31:53] [INFO ] Flatten gal took : 4 ms
[2022-05-16 07:31:53] [INFO ] Input system was already deterministic with 40 transitions.
Support contains 37 out of 40 places (down from 39) after GAL structural reductions.
Finished random walk after 403 steps, including 0 resets, run visited all 29 properties in 23 ms. (steps per millisecond=17 )
FORMULA Eratosthenes-PT-500-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 40 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 40
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' '!((F(G(X(p0)))||F(G(!p0))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Graph (complete) has 0 edges and 40 vertex of which 2 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Applied a total of 1 rules in 9 ms. Remains 2 /40 variables (removed 38) and now considering 2/40 (removed 38) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:53] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:53] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2022-05-16 07:31:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:53] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/40 places, 2/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/40 places, 2/40 transitions.
Stuttering acceptance computed with spot in 181 ms :[false]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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, (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-500-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-00 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U !F(p0)) U (X((G(p0)||p0))||p1))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3 transition count 3
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3 transition count 3
Applied a total of 74 rules in 1 ms. Remains 3 /40 variables (removed 37) and now considering 3/40 (removed 37) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:54] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:54] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/40 places, 3/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/40 places, 3/40 transitions.
Stuttering acceptance computed with spot in 1146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, p0]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-01 finished in 1230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U X(p1)))||F(((F(p3)&&p4)||p2)))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 7 transition count 7
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 7 transition count 7
Applied a total of 66 rules in 1 ms. Remains 7 /40 variables (removed 33) and now considering 7/40 (removed 33) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:31:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:55] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:31:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:31:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/40 places, 7/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/40 places, 7/40 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (AND p1 (NOT p2) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) p1), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p4 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p4) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p4 (NOT p3) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p4 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p4) p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p4 (NOT p3) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p4 (NOT p3)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LT s3 1) (LT s6 1)), p4:(OR (LT s2 1) (LT s4 1)), p3:(OR (LT s3 1) (LT s6 1)), p0:(GEQ s5 1), p1:(AND (GEQ s1 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28301 reset in 172 ms.
Product exploration explored 100000 steps with 28191 reset in 179 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
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 p2) (NOT p4) (NOT p3) p0 p1), (F (G p2)), (F (G p4)), (F (G p3)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p4 (NOT p3))), (X (NOT (AND (NOT p2) p4 (NOT p3)))), (X (AND (NOT p2) (NOT p4))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (X (AND (NOT p2) p4 (NOT p3)))), (X (X (NOT (AND (NOT p2) p4 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p2) p4 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p4 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p4) p0))), (X (X (NOT (AND (NOT p2) (NOT p4) p0))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 6 factoid took 473 ms. Reduced automaton from 8 states, 15 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-500-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-02 finished in 1397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0 U G(p1))) U ((!p0 U X(p2))||G(p2)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 5 transition count 5
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 5 transition count 5
Applied a total of 70 rules in 8 ms. Remains 5 /40 variables (removed 35) and now considering 5/40 (removed 35) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:31:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:56] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:31:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:31:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/40 places, 5/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 5/40 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p2:(GEQ s2 1), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 6 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-05 finished in 256 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 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3 transition count 3
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3 transition count 3
Applied a total of 74 rules in 1 ms. Remains 3 /40 variables (removed 37) and now considering 3/40 (removed 37) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/40 places, 3/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/40 places, 3/40 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-06 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:(OR (LT s1 1) (LT s2 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 406 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-06 finished in 130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Graph (complete) has 0 edges and 40 vertex of which 2 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /40 variables (removed 38) and now considering 2/40 (removed 38) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-16 07:31:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:57] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/40 places, 2/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/40 places, 2/40 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1 1) (LT s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 49 ms.
Product exploration explored 100000 steps with 33333 reset in 46 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-500-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-07 finished in 301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3 transition count 3
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3 transition count 3
Applied a total of 74 rules in 2 ms. Remains 3 /40 variables (removed 37) and now considering 3/40 (removed 37) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/40 places, 3/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/40 places, 3/40 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-09 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:(OR (LT s1 1) (LT s2 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 2026 steps with 5 reset in 3 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-09 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(G(X(p0)))))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Graph (complete) has 0 edges and 40 vertex of which 2 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /40 variables (removed 38) and now considering 2/40 (removed 38) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-16 07:31:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/40 places, 2/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/40 places, 2/40 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-10 finished in 110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1 U p2)))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Graph (complete) has 0 edges and 40 vertex of which 4 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /40 variables (removed 36) and now considering 4/40 (removed 36) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 07:31:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/40 places, 4/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/40 places, 4/40 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(LT s3 1), p1:(GEQ s1 1), p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-11 finished in 140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 4 transition count 4
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 4 transition count 4
Applied a total of 72 rules in 1 ms. Remains 4 /40 variables (removed 36) and now considering 4/40 (removed 36) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/40 places, 4/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/40 places, 4/40 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s2 1), p1:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-12 finished in 218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((G(p1)&&G(F(p2)))))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 6 transition count 6
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 6 transition count 6
Applied a total of 68 rules in 1 ms. Remains 6 /40 variables (removed 34) and now considering 6/40 (removed 34) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants and state equation in 23 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:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/40 places, 6/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/40 places, 6/40 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(GEQ s1 1), p2:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-13 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X((F(G(p1))||p0)) U !p1)))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3 transition count 3
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3 transition count 3
Applied a total of 74 rules in 2 ms. Remains 3 /40 variables (removed 37) and now considering 3/40 (removed 37) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:31:58] [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 3 rows 3 cols
[2022-05-16 07:31:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/40 places, 3/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/40 places, 3/40 transitions.
Stuttering acceptance computed with spot in 149 ms :[p1, p1, false, false]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s2 1), p0:(OR (LT s1 1) (GEQ s2 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 451 reset in 115 ms.
Product exploration explored 100000 steps with 446 reset in 81 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 p1 p0), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-500-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-14 finished in 681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(F(G(X(p0))))))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Graph (complete) has 0 edges and 40 vertex of which 2 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /40 variables (removed 38) and now considering 2/40 (removed 38) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:59] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:59] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2022-05-16 07:31:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:31:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:31:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/40 places, 2/40 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/40 places, 2/40 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, 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 33333 reset in 43 ms.
Product exploration explored 100000 steps with 33333 reset in 46 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-500-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-15 finished in 342 ms.
All properties solved by simple procedures.
Total runtime 7379 ms.

BK_STOP 1652686320023

--------------------
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-500"
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-500, 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-165260110400500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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