Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280000153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Eratosthenes-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280000153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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-050-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716581659331

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 20:14:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 20:14:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:14:21] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-24 20:14:21] [INFO ] Transformed 49 places.
[2024-05-24 20:14:21] [INFO ] Transformed 108 transitions.
[2024-05-24 20:14:21] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA Eratosthenes-PT-050-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 79
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 48 place count 33 transition count 33
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 29 transition count 29
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 29 transition count 29
Applied a total of 56 rules in 19 ms. Remains 29 /34 variables (removed 5) and now considering 29/80 (removed 51) transitions.
// Phase 1: matrix 29 rows 29 cols
[2024-05-24 20:14:22] [INFO ] Computed 0 invariants in 4 ms
[2024-05-24 20:14:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-24 20:14:22] [INFO ] Invariant cache hit.
[2024-05-24 20:14:22] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-24 20:14:22] [INFO ] Invariant cache hit.
[2024-05-24 20:14:22] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/34 places, 29/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 29/34 places, 29/80 transitions.
Support contains 28 out of 29 places after structural reductions.
[2024-05-24 20:14:22] [INFO ] Flatten gal took : 22 ms
[2024-05-24 20:14:22] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:14:22] [INFO ] Input system was already deterministic with 29 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 28 properties in 113 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 29
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U X(p1)) U X(X(p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5 transition count 5
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5 transition count 5
Applied a total of 48 rules in 2 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:14:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:14:23] [INFO ] Invariant cache hit.
[2024-05-24 20:14:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 20:14:23] [INFO ] Invariant cache hit.
[2024-05-24 20:14:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 5/29 places, 5/29 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 760 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=true, acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}, { cond=(NOT p1), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=true, acceptance={0} source=2 dest: 5}, { cond=p0, acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(NOT p2), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=10 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=10 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=10 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=11 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p1:(GEQ s4 1), p2:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 1 reset in 3 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-00 finished in 922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0 U (p1||G(p0)))) U X(p2)))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 5 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 5 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:14:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 20:14:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), false]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s0 1) (NOT (AND (GEQ s2 1) (GEQ s3 1)))), p0:(LT s0 1), p2:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 8 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-02 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9 transition count 9
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9 transition count 9
Applied a total of 40 rules in 4 ms. Remains 9 /29 variables (removed 20) and now considering 9/29 (removed 20) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-24 20:14:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9/29 places, 9/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 9/29 places, 9/29 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-03 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 (AND (GEQ s3 1) (GEQ s8 1) (OR (LT s5 1) (LT s7 1) (AND (GEQ s4 1) (GEQ s6 1)))) (AND (GEQ s2 1) (GEQ 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 3 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-03 finished in 173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(!p1)||(!p1&&F(p2))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 5 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:14:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 20:14:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (LT s2 1) (GEQ s0 1)), p2:(LT s4 1), p1:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-04 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1))))))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 6 transition count 6
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 6 transition count 6
Applied a total of 46 rules in 2 ms. Remains 6 /29 variables (removed 23) and now considering 6/29 (removed 23) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-24 20:14:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 20:14:24] [INFO ] Invariant cache hit.
[2024-05-24 20:14:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/29 places, 6/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 6/29 places, 6/29 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s4 1))) (NOT (AND (GEQ s2 1) (GEQ s3 1)))), p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(LT s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16411 reset in 411 ms.
Product exploration explored 100000 steps with 16437 reset in 224 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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) p1 (NOT p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-06 finished in 967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 6 transition count 6
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 6 transition count 6
Applied a total of 46 rules in 2 ms. Remains 6 /29 variables (removed 23) and now considering 6/29 (removed 23) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-24 20:14:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 20:14:25] [INFO ] Invariant cache hit.
[2024-05-24 20:14:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-24 20:14:25] [INFO ] Invariant cache hit.
[2024-05-24 20:14:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/29 places, 6/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 6/29 places, 6/29 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), p1, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s3 1) (GEQ s4 1)), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-07 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0) U (p1 U p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5 transition count 5
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5 transition count 5
Applied a total of 48 rules in 2 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:14:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:26] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:14:26] [INFO ] Invariant cache hit.
[2024-05-24 20:14:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 20:14:26] [INFO ] Invariant cache hit.
[2024-05-24 20:14:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}, { cond=(NOT p0), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=7, aps=[p2:(GEQ s2 1), p1:(GEQ s1 1), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-08 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G(F(p1)) U !p0)&&X(G(p2)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 3 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:14:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 20:14:26] [INFO ] Invariant cache hit.
[2024-05-24 20:14:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 20:14:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:14:26] [INFO ] Invariant cache hit.
[2024-05-24 20:14:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/29 places, 3/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 3/29 places, 3/29 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={0} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(LT s1 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-09 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3 transition count 3
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3 transition count 3
Applied a total of 52 rules in 1 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:14:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 20:14:27] [INFO ] Invariant cache hit.
[2024-05-24 20:14:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 20:14:27] [INFO ] Invariant cache hit.
[2024-05-24 20:14:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/29 places, 3/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 3/29 places, 3/29 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-11 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-11 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(!p0)&&X((p1 U p2)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 20:14:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:14:27] [INFO ] Invariant cache hit.
[2024-05-24 20:14:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 20:14:27] [INFO ] Invariant cache hit.
[2024-05-24 20:14:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/29 places, 4/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 4/29 places, 4/29 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s3 1), p2:(GEQ s2 1), p1:(GEQ s1 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 37925 reset in 263 ms.
Product exploration explored 100000 steps with 38181 reset in 188 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) p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-12 finished in 698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||G(p1)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 20:14:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:14:27] [INFO ] Invariant cache hit.
[2024-05-24 20:14:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 20:14:27] [INFO ] Invariant cache hit.
[2024-05-24 20:14:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/29 places, 4/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 4/29 places, 4/29 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s3 1) (LT s2 1)), p0:(GEQ 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, 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-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-13 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 1 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 1 /29 variables (removed 28) and now considering 1/29 (removed 28) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-24 20:14:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 20:14:28] [INFO ] Invariant cache hit.
[2024-05-24 20:14:28] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-24 20:14:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:14:28] [INFO ] Invariant cache hit.
[2024-05-24 20:14:28] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/29 places, 1/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 1/29 places, 1/29 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-14 finished in 149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 20:14:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:14:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:14:28] [INFO ] Invariant cache hit.
[2024-05-24 20:14:28] [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.
[2024-05-24 20:14:28] [INFO ] Invariant cache hit.
[2024-05-24 20:14:28] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/29 places, 4/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 4/29 places, 4/29 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s0 1)), p0:(LT 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 35313 reset in 64 ms.
Product exploration explored 100000 steps with 35319 reset in 72 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 p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-15 finished in 366 ms.
All properties solved by simple procedures.
Total runtime 6929 ms.

BK_STOP 1716581669979

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Eratosthenes-PT-050, 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 r175-smll-171636280000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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