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.r461-smll-171701123100208.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 ViralEpidemic-PT-S03D1C1A06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123100208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 04:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 04:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:43 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 ViralEpidemic-PT-S03D1C1A06-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717217051261

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=ViralEpidemic-PT-S03D1C1A06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-01 04:44:13] [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-06-01 04:44:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:44:14] [INFO ] Load time of PNML (sax parser for PT used): 657 ms
[2024-06-01 04:44:14] [INFO ] Transformed 5466 places.
[2024-06-01 04:44:14] [INFO ] Transformed 7651 transitions.
[2024-06-01 04:44:14] [INFO ] Found NUPN structural information;
[2024-06-01 04:44:14] [INFO ] Parsed PT model containing 5466 places and 7651 transitions and 17488 arcs in 896 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 5466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5466/5466 places, 7651/7651 transitions.
Discarding 2497 places :
Symmetric choice reduction at 0 with 2497 rule applications. Total rules 2497 place count 2969 transition count 3013
Iterating global reduction 0 with 2497 rules applied. Total rules applied 4994 place count 2969 transition count 3013
Applied a total of 4994 rules in 1808 ms. Remains 2969 /5466 variables (removed 2497) and now considering 3013/7651 (removed 4638) transitions.
// Phase 1: matrix 3013 rows 2969 cols
[2024-06-01 04:44:17] [INFO ] Invariants computation overflowed in 313 ms
[2024-06-01 04:44:18] [INFO ] Implicit Places using invariants in 1198 ms returned []
// Phase 1: matrix 3013 rows 2969 cols
[2024-06-01 04:44:18] [INFO ] Invariants computation overflowed in 173 ms
[2024-06-01 04:44:19] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
// Phase 1: matrix 3013 rows 2969 cols
[2024-06-01 04:44:19] [INFO ] Invariants computation overflowed in 70 ms
[2024-06-01 04:44:22] [INFO ] Dead Transitions using invariants and state equation in 3106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2969/5466 places, 3013/7651 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7433 ms. Remains : 2969/5466 places, 3013/7651 transitions.
Support contains 71 out of 2969 places after structural reductions.
[2024-06-01 04:44:23] [INFO ] Flatten gal took : 326 ms
[2024-06-01 04:44:23] [INFO ] Flatten gal took : 200 ms
[2024-06-01 04:44:23] [INFO ] Input system was already deterministic with 3013 transitions.
Support contains 69 out of 2969 places (down from 71) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 69 resets, run finished after 888 ms. (steps per millisecond=11 ) properties (out of 40) seen :34
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 3013 rows 2969 cols
[2024-06-01 04:44:26] [INFO ] Invariants computation overflowed in 66 ms
[2024-06-01 04:44:26] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 04:44:30] [INFO ] After 2660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 04:44:31] [INFO ] After 3485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 446 ms.
[2024-06-01 04:44:31] [INFO ] After 4897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 105 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 11 ms.
Computed a total of 2969 stabilizing places and 3013 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2969 transition count 3013
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' '!(X((p0||G(F(p1)))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 2919 transition count 2920
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 2919 transition count 2920
Applied a total of 100 rules in 415 ms. Remains 2919 /2969 variables (removed 50) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:44:32] [INFO ] Invariants computation overflowed in 74 ms
[2024-06-01 04:44:35] [INFO ] Implicit Places using invariants in 2324 ms returned []
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:44:35] [INFO ] Invariants computation overflowed in 82 ms
[2024-06-01 04:44:38] [INFO ] Implicit Places using invariants and state equation in 3080 ms returned []
Implicit Place search using SMT with State Equation took 5409 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:44:38] [INFO ] Invariants computation overflowed in 62 ms
[2024-06-01 04:44:41] [INFO ] Dead Transitions using invariants and state equation in 3497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2919/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9326 ms. Remains : 2919/2969 places, 2920/3013 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 328 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s2405 1) (EQ s2406 1)), p1:(OR (EQ s1598 0) (EQ s1599 0))], 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]]
Product exploration explored 100000 steps with 828 reset in 2723 ms.
Product exploration explored 100000 steps with 849 reset in 3470 ms.
Computed a total of 2919 stabilizing places and 2920 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2919 transition count 2920
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-00 finished in 17544 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((F(p0) U (p0||G(p1))))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 2919 transition count 2920
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 2919 transition count 2920
Applied a total of 100 rules in 404 ms. Remains 2919 /2969 variables (removed 50) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:44:50] [INFO ] Invariants computation overflowed in 69 ms
[2024-06-01 04:44:52] [INFO ] Implicit Places using invariants in 2542 ms returned []
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:44:52] [INFO ] Invariants computation overflowed in 66 ms
[2024-06-01 04:44:53] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 3442 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:44:53] [INFO ] Invariants computation overflowed in 69 ms
[2024-06-01 04:44:57] [INFO ] Dead Transitions using invariants and state equation in 3468 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2919/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7318 ms. Remains : 2919/2969 places, 2920/3013 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1797 1) (EQ s1799 1)), p1:(AND (EQ s443 1) (EQ s445 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 5 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-01 finished in 7479 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(p0)||F(G(p1))))'
Support contains 2 out of 2969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Graph (complete) has 1842 edges and 2969 vertex of which 23 are kept as prefixes of interest. Removing 2946 places using SCC suffix rule.12 ms
Discarding 2946 places :
Also discarding 2978 output transitions
Drop transitions removed 2978 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 22 transition count 32
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 20 transition count 28
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 20 transition count 28
Applied a total of 7 rules in 35 ms. Remains 20 /2969 variables (removed 2949) and now considering 28/3013 (removed 2985) transitions.
// Phase 1: matrix 28 rows 20 cols
[2024-06-01 04:44:57] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:44:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 04:44:57] [INFO ] Invariant cache hit.
[2024-06-01 04:44:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 04:44:57] [INFO ] Redundant transitions in 15 ms returned [5, 15]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 26 rows 20 cols
[2024-06-01 04:44:57] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 04:44:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/2969 places, 26/3013 transitions.
Graph (complete) has 10 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 4 ms. Remains 18 /20 variables (removed 2) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 18 cols
[2024-06-01 04:44:57] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:44:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 04:44:57] [INFO ] Invariant cache hit.
[2024-06-01 04:44:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/2969 places, 24/3013 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 18/2969 places, 24/3013 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s15 1)), p1:(OR (EQ s13 0) (EQ s15 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7147 reset in 131 ms.
Product exploration explored 100000 steps with 7107 reset in 126 ms.
Computed a total of 18 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-02 finished in 608 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((p0||F((G(p1)&&X(X(p2)))))))'
Support contains 6 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 2920 transition count 2923
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 2920 transition count 2923
Applied a total of 98 rules in 423 ms. Remains 2920 /2969 variables (removed 49) and now considering 2923/3013 (removed 90) transitions.
// Phase 1: matrix 2923 rows 2920 cols
[2024-06-01 04:44:58] [INFO ] Invariants computation overflowed in 81 ms
[2024-06-01 04:45:00] [INFO ] Implicit Places using invariants in 1951 ms returned []
// Phase 1: matrix 2923 rows 2920 cols
[2024-06-01 04:45:00] [INFO ] Invariants computation overflowed in 68 ms
[2024-06-01 04:45:01] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 2850 ms to find 0 implicit places.
// Phase 1: matrix 2923 rows 2920 cols
[2024-06-01 04:45:01] [INFO ] Invariants computation overflowed in 62 ms
[2024-06-01 04:45:03] [INFO ] Dead Transitions using invariants and state equation in 2619 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2920/2969 places, 2923/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5894 ms. Remains : 2920/2969 places, 2923/3013 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1085 1) (EQ s1088 1)), p1:(OR (AND (OR (EQ s537 0) (EQ s538 0)) (OR (EQ s23 0) (EQ s30 0))) (EQ s1085 0) (EQ s1088 0)), p2:(OR (EQ s1085 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1603 reset in 2635 ms.
Product exploration explored 100000 steps with 1667 reset in 3379 ms.
Computed a total of 2920 stabilizing places and 2923 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2920 transition count 2923
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 239 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-03 finished in 14083 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((p0||X(X(X(p1)))))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 2918 transition count 2920
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 2918 transition count 2920
Applied a total of 102 rules in 424 ms. Remains 2918 /2969 variables (removed 51) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:45:12] [INFO ] Invariants computation overflowed in 73 ms
[2024-06-01 04:45:14] [INFO ] Implicit Places using invariants in 2254 ms returned []
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:45:14] [INFO ] Invariants computation overflowed in 62 ms
[2024-06-01 04:45:15] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 3150 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:45:15] [INFO ] Invariants computation overflowed in 62 ms
[2024-06-01 04:45:18] [INFO ] Dead Transitions using invariants and state equation in 3172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2918/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6751 ms. Remains : 2918/2969 places, 2920/3013 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}]], initial=0, aps=[p0:(AND (EQ s568 1) (EQ s570 1)), p1:(OR (EQ s2262 0) (EQ s2269 0))], nbAcceptance=1, 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 19947 reset in 3470 ms.
Product exploration explored 100000 steps with 20057 reset in 4253 ms.
Computed a total of 2918 stabilizing places and 2920 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2918 transition count 2920
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-04 finished in 16191 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||X((p1||F((G(F(!p2))||(F(!p2)&&X(!p1)))))))))'
Support contains 6 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 2920 transition count 2923
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 2920 transition count 2923
Applied a total of 98 rules in 426 ms. Remains 2920 /2969 variables (removed 49) and now considering 2923/3013 (removed 90) transitions.
// Phase 1: matrix 2923 rows 2920 cols
[2024-06-01 04:45:28] [INFO ] Invariants computation overflowed in 66 ms
[2024-06-01 04:45:31] [INFO ] Implicit Places using invariants in 2388 ms returned []
// Phase 1: matrix 2923 rows 2920 cols
[2024-06-01 04:45:31] [INFO ] Invariants computation overflowed in 60 ms
[2024-06-01 04:45:32] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 3293 ms to find 0 implicit places.
// Phase 1: matrix 2923 rows 2920 cols
[2024-06-01 04:45:32] [INFO ] Invariants computation overflowed in 66 ms
[2024-06-01 04:45:35] [INFO ] Dead Transitions using invariants and state equation in 3400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2920/2969 places, 2923/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7127 ms. Remains : 2920/2969 places, 2923/3013 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s929 1) (EQ s936 1)), p1:(AND (EQ s988 1) (EQ s990 1)), p2:(AND (EQ s2864 1) (EQ s2867 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5217 ms.
Product exploration explored 100000 steps with 50000 reset in 5789 ms.
Computed a total of 2920 stabilizing places and 2923 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2920 transition count 2923
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-05 finished in 19809 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((X(X((X(X(F(p2)))&&p1)))&&p0)))'
Support contains 6 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 2918 transition count 2923
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 2918 transition count 2923
Applied a total of 102 rules in 430 ms. Remains 2918 /2969 variables (removed 51) and now considering 2923/3013 (removed 90) transitions.
// Phase 1: matrix 2923 rows 2918 cols
[2024-06-01 04:45:48] [INFO ] Invariants computation overflowed in 68 ms
[2024-06-01 04:45:50] [INFO ] Implicit Places using invariants in 2353 ms returned []
// Phase 1: matrix 2923 rows 2918 cols
[2024-06-01 04:45:50] [INFO ] Invariants computation overflowed in 61 ms
[2024-06-01 04:45:51] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
// Phase 1: matrix 2923 rows 2918 cols
[2024-06-01 04:45:51] [INFO ] Invariants computation overflowed in 63 ms
[2024-06-01 04:45:54] [INFO ] Dead Transitions using invariants and state equation in 2921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2918/2969 places, 2923/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6603 ms. Remains : 2918/2969 places, 2923/3013 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (EQ s357 1) (EQ s358 1)), p1:(AND (EQ s869 1) (EQ s940 1)), p2:(AND (EQ s2585 1) (EQ s2589 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 4 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-06 finished in 6899 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(X(p0))&&(!X(p1) U p0)))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 2919 transition count 2920
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 2919 transition count 2920
Applied a total of 100 rules in 424 ms. Remains 2919 /2969 variables (removed 50) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:45:55] [INFO ] Invariants computation overflowed in 66 ms
[2024-06-01 04:45:57] [INFO ] Implicit Places using invariants in 2287 ms returned []
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:45:57] [INFO ] Invariants computation overflowed in 62 ms
[2024-06-01 04:46:00] [INFO ] Implicit Places using invariants and state equation in 3133 ms returned []
Implicit Place search using SMT with State Equation took 5422 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:46:00] [INFO ] Invariants computation overflowed in 61 ms
[2024-06-01 04:46:03] [INFO ] Dead Transitions using invariants and state equation in 3110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2919/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8959 ms. Remains : 2919/2969 places, 2920/3013 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (EQ s1324 1) (EQ s1327 1)), p1:(AND (EQ s2350 1) (EQ s2353 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 55 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-07 finished in 9107 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' '!((p0 U X((p1||F(G(p1))))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 2918 transition count 2920
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 2918 transition count 2920
Applied a total of 102 rules in 420 ms. Remains 2918 /2969 variables (removed 51) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:46:04] [INFO ] Invariants computation overflowed in 60 ms
[2024-06-01 04:46:06] [INFO ] Implicit Places using invariants in 2424 ms returned []
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:46:07] [INFO ] Invariants computation overflowed in 60 ms
[2024-06-01 04:46:07] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:46:07] [INFO ] Invariants computation overflowed in 59 ms
[2024-06-01 04:46:10] [INFO ] Dead Transitions using invariants and state equation in 2713 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2918/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6460 ms. Remains : 2918/2969 places, 2920/3013 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s969 1) (EQ s970 1)), p1:(AND (EQ s1496 1) (EQ s1497 1))], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 4 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-08 finished in 6641 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(F((F(G(p0))&&((!p0||X(p1)) U (G((!p0||X(p1)))||(!p2&&(!p0||X(p1)))))))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 2916 transition count 2917
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 2916 transition count 2917
Applied a total of 106 rules in 416 ms. Remains 2916 /2969 variables (removed 53) and now considering 2917/3013 (removed 96) transitions.
// Phase 1: matrix 2917 rows 2916 cols
[2024-06-01 04:46:11] [INFO ] Invariants computation overflowed in 60 ms
[2024-06-01 04:46:13] [INFO ] Implicit Places using invariants in 2319 ms returned []
// Phase 1: matrix 2917 rows 2916 cols
[2024-06-01 04:46:13] [INFO ] Invariants computation overflowed in 60 ms
[2024-06-01 04:46:14] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
// Phase 1: matrix 2917 rows 2916 cols
[2024-06-01 04:46:14] [INFO ] Invariants computation overflowed in 61 ms
[2024-06-01 04:46:17] [INFO ] Dead Transitions using invariants and state equation in 3202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2916/2969 places, 2917/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6833 ms. Remains : 2916/2969 places, 2917/3013 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s440 1) (EQ s452 1)), p0:(EQ s2242 1), p1:(NEQ s2629 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-09 finished in 7075 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((F(p0)||X(X(G(p1))))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 2918 transition count 2920
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 2918 transition count 2920
Applied a total of 102 rules in 418 ms. Remains 2918 /2969 variables (removed 51) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:46:18] [INFO ] Invariants computation overflowed in 61 ms
[2024-06-01 04:46:20] [INFO ] Implicit Places using invariants in 2459 ms returned []
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:46:20] [INFO ] Invariants computation overflowed in 61 ms
[2024-06-01 04:46:21] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 3349 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2918 cols
[2024-06-01 04:46:21] [INFO ] Invariants computation overflowed in 70 ms
[2024-06-01 04:46:25] [INFO ] Dead Transitions using invariants and state equation in 3476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2918/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7245 ms. Remains : 2918/2969 places, 2920/3013 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s2572 0) (EQ s2573 0)), p1:(OR (NEQ s2715 1) (NEQ s2718 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5177 ms.
Product exploration explored 100000 steps with 50000 reset in 5784 ms.
Computed a total of 2918 stabilizing places and 2920 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2918 transition count 2920
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 p0 p1), (X p0), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-10 finished in 20068 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&&(G(F(p1))||F(G(p0))||G(p2)))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 2919 transition count 2920
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 2919 transition count 2920
Applied a total of 100 rules in 425 ms. Remains 2919 /2969 variables (removed 50) and now considering 2920/3013 (removed 93) transitions.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:46:38] [INFO ] Invariants computation overflowed in 64 ms
[2024-06-01 04:46:40] [INFO ] Implicit Places using invariants in 2181 ms returned []
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:46:40] [INFO ] Invariants computation overflowed in 64 ms
[2024-06-01 04:46:41] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 3216 ms to find 0 implicit places.
// Phase 1: matrix 2920 rows 2919 cols
[2024-06-01 04:46:41] [INFO ] Invariants computation overflowed in 61 ms
[2024-06-01 04:46:44] [INFO ] Dead Transitions using invariants and state equation in 3196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2919/2969 places, 2920/3013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6841 ms. Remains : 2919/2969 places, 2920/3013 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s2890 0) (EQ s2893 0)), p2:(OR (EQ s2256 0) (EQ s2258 0)), p1:(AND (EQ s2256 1) (EQ s2258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 800 reset in 2571 ms.
Product exploration explored 100000 steps with 836 reset in 3273 ms.
Computed a total of 2919 stabilizing places and 2920 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2919 transition count 2920
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 p0 p2 (NOT p1)), (X p0), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-12 finished in 14503 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(((p1||(p2 U p3))&&p0))))'
Support contains 8 out of 2969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Graph (complete) has 1842 edges and 2969 vertex of which 71 are kept as prefixes of interest. Removing 2898 places using SCC suffix rule.8 ms
Discarding 2898 places :
Also discarding 2900 output transitions
Drop transitions removed 2900 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 70 transition count 106
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 63 transition count 90
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 63 transition count 90
Applied a total of 21 rules in 21 ms. Remains 63 /2969 variables (removed 2906) and now considering 90/3013 (removed 2923) transitions.
// Phase 1: matrix 90 rows 63 cols
[2024-06-01 04:46:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 04:46:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 04:46:52] [INFO ] Invariant cache hit.
[2024-06-01 04:46:52] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 04:46:52] [INFO ] Redundant transitions in 16 ms returned [5, 38, 42, 59]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 86 rows 63 cols
[2024-06-01 04:46:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/2969 places, 86/3013 transitions.
Graph (complete) has 35 edges and 63 vertex of which 59 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 3 ms. Remains 59 /63 variables (removed 4) and now considering 82/86 (removed 4) transitions.
// Phase 1: matrix 82 rows 59 cols
[2024-06-01 04:46:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 04:46:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 04:46:52] [INFO ] Invariant cache hit.
[2024-06-01 04:46:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/2969 places, 82/3013 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 59/2969 places, 82/3013 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p1 p0) (AND p0 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (AND (NOT p3) (NOT p0) p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (EQ s10 1) (EQ s13 1)), p0:(AND (EQ s27 1) (EQ s30 1)), p1:(AND (EQ s39 1) (EQ s40 1)), p2:(AND (EQ s55 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-13 finished in 428 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(p2)&&F(p3)&&p1)))))'
Support contains 6 out of 2969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Graph (complete) has 1842 edges and 2969 vertex of which 56 are kept as prefixes of interest. Removing 2913 places using SCC suffix rule.6 ms
Discarding 2913 places :
Also discarding 2929 output transitions
Drop transitions removed 2929 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 82
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 48 transition count 67
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 48 transition count 67
Applied a total of 16 rules in 18 ms. Remains 48 /2969 variables (removed 2921) and now considering 67/3013 (removed 2946) transitions.
// Phase 1: matrix 67 rows 48 cols
[2024-06-01 04:46:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 04:46:52] [INFO ] Invariant cache hit.
[2024-06-01 04:46:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 04:46:52] [INFO ] Redundant transitions in 15 ms returned [2, 18, 58]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-01 04:46:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:53] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/2969 places, 64/3013 transitions.
Graph (complete) has 28 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 61/64 (removed 3) transitions.
// Phase 1: matrix 61 rows 45 cols
[2024-06-01 04:46:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 04:46:53] [INFO ] Invariant cache hit.
[2024-06-01 04:46:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/2969 places, 61/3013 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 45/2969 places, 61/3013 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s41 1) (EQ s42 1)), p0:(AND (EQ s28 1) (EQ s30 1)), p2:(AND (EQ s13 1) (EQ s14 1)), p3:(AND (EQ s41 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-14 finished in 425 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||G(p2)))))'
Support contains 4 out of 2969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2969/2969 places, 3013/3013 transitions.
Graph (complete) has 1842 edges and 2969 vertex of which 41 are kept as prefixes of interest. Removing 2928 places using SCC suffix rule.5 ms
Discarding 2928 places :
Also discarding 2950 output transitions
Drop transitions removed 2950 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 40 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 36 transition count 51
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 36 transition count 51
Applied a total of 12 rules in 16 ms. Remains 36 /2969 variables (removed 2933) and now considering 51/3013 (removed 2962) transitions.
// Phase 1: matrix 51 rows 36 cols
[2024-06-01 04:46:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 04:46:53] [INFO ] Invariant cache hit.
[2024-06-01 04:46:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 04:46:53] [INFO ] Redundant transitions in 15 ms returned [8, 18]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 49 rows 36 cols
[2024-06-01 04:46:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/2969 places, 49/3013 transitions.
Graph (complete) has 20 edges and 36 vertex of which 34 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 34 /36 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 34 cols
[2024-06-01 04:46:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 04:46:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 04:46:53] [INFO ] Invariant cache hit.
[2024-06-01 04:46:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/2969 places, 47/3013 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 34/2969 places, 47/3013 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s30 1), p1:(AND (EQ s12 1) (EQ s15 1)), p2:(AND (EQ s12 1) (EQ s15 1) (EQ s20 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][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A06-LTLFireability-15 finished in 359 ms.
All properties solved by simple procedures.
Total runtime 159600 ms.

BK_STOP 1717217215006

--------------------
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="ViralEpidemic-PT-S03D1C1A06"
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 ViralEpidemic-PT-S03D1C1A06, 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 r461-smll-171701123100208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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