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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 04:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 04:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Apr 12 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 284K 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-S04D1C1A03-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717223483830

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-S04D1C1A03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-01 06:31:27] [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 06:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:31:27] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-06-01 06:31:27] [INFO ] Transformed 511 places.
[2024-06-01 06:31:27] [INFO ] Transformed 765 transitions.
[2024-06-01 06:31:27] [INFO ] Found NUPN structural information;
[2024-06-01 06:31:27] [INFO ] Parsed PT model containing 511 places and 765 transitions and 1785 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 765/765 transitions.
Discarding 239 places :
Symmetric choice reduction at 0 with 239 rule applications. Total rules 239 place count 272 transition count 306
Iterating global reduction 0 with 239 rules applied. Total rules applied 478 place count 272 transition count 306
Applied a total of 478 rules in 130 ms. Remains 272 /511 variables (removed 239) and now considering 306/765 (removed 459) transitions.
// Phase 1: matrix 306 rows 272 cols
[2024-06-01 06:31:28] [INFO ] Computed 1 invariants in 38 ms
[2024-06-01 06:31:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:31:28] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-06-01 06:31:28] [INFO ] Invariant cache hit.
[2024-06-01 06:31:29] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2024-06-01 06:31:29] [INFO ] Invariant cache hit.
[2024-06-01 06:31:29] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/511 places, 306/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1548 ms. Remains : 272/511 places, 306/765 transitions.
Support contains 49 out of 272 places after structural reductions.
[2024-06-01 06:31:29] [INFO ] Flatten gal took : 110 ms
[2024-06-01 06:31:29] [INFO ] Flatten gal took : 47 ms
[2024-06-01 06:31:30] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 47 out of 272 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 26) seen :25
Finished Best-First random walk after 157 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 272 stabilizing places and 306 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 272 transition count 306
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||F(p1)))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 23 are kept as prefixes of interest. Removing 249 places using SCC suffix rule.3 ms
Discarding 249 places :
Also discarding 267 output transitions
Drop transitions removed 267 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 22 transition count 34
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 17 transition count 22
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 17 transition count 22
Applied a total of 15 rules in 15 ms. Remains 17 /272 variables (removed 255) and now considering 22/306 (removed 284) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-06-01 06:31:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 06:31:30] [INFO ] Invariant cache hit.
[2024-06-01 06:31:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 06:31:31] [INFO ] Redundant transitions in 19 ms returned [5]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-06-01 06:31:31] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/272 places, 21/306 transitions.
Graph (complete) has 9 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-06-01 06:31:31] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 06:31:31] [INFO ] Invariant cache hit.
[2024-06-01 06:31:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/272 places, 20/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 16/272 places, 20/306 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 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s14 1)), p1:(OR (EQ s6 0) (EQ s9 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12876 reset in 418 ms.
Product exploration explored 100000 steps with 12768 reset in 228 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 20 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-S04D1C1A03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 finished in 1292 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(((p0 U p1)||X(((!(p0 U p3)&&p4)||p2))))))'
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 239 transition count 243
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 239 transition count 243
Applied a total of 66 rules in 22 ms. Remains 239 /272 variables (removed 33) and now considering 243/306 (removed 63) transitions.
// Phase 1: matrix 243 rows 239 cols
[2024-06-01 06:31:32] [INFO ] Computed 1 invariants in 8 ms
[2024-06-01 06:31:32] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 06:31:32] [INFO ] Invariant cache hit.
[2024-06-01 06:31:32] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-06-01 06:31:32] [INFO ] Invariant cache hit.
[2024-06-01 06:31:32] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/272 places, 243/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 700 ms. Remains : 239/272 places, 243/306 transitions.
Stuttering acceptance computed with spot in 465 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3)), p3, (AND (NOT p1) p3), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p4 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p0) (NOT p2) p3)), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p2) (NOT p4)) (AND (NOT p1) p0 (NOT p2) p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) p4 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 2}]], initial=7, aps=[p1:(AND (EQ s61 1) (EQ s63 1)), p0:(AND (EQ s225 1) (EQ s230 1)), p2:(OR (EQ s31 0) (EQ s32 0)), p4:(OR (EQ s31 0) (EQ s32 0)), p3:(EQ s207 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 732 ms.
Product exploration explored 100000 steps with 25000 reset in 540 ms.
Computed a total of 239 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 243
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) p2 p4 (NOT p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p4)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 9 states, 17 edges and 5 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), p3, (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-01 06:31:35] [INFO ] Invariant cache hit.
[2024-06-01 06:31:35] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p4 (NOT p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p4)), (F (G (NOT p3))), (G (NOT (AND p0 (NOT p2) (NOT p3) p4)))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (OR (AND (NOT p2) p3) (AND (NOT p2) (NOT p4)))), (F p3)]
Knowledge based reduction with 9 factoid took 303 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Support contains 3 out of 239 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 243/243 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-06-01 06:31:36] [INFO ] Invariant cache hit.
[2024-06-01 06:31:36] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 06:31:36] [INFO ] Invariant cache hit.
[2024-06-01 06:31:36] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-06-01 06:31:36] [INFO ] Invariant cache hit.
[2024-06-01 06:31:36] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 239/239 places, 243/243 transitions.
Computed a total of 239 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 243
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p3) p4), true, (F (G p2)), (F (G (NOT p3))), (F (G p4))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Finished random walk after 262 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=131 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p3) p4), true, (F (G p2)), (F (G (NOT p3))), (F (G p4))]
False Knowledge obtained : [(F (OR (AND (NOT p2) p3) (AND (NOT p2) (NOT p4))))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Product exploration explored 100000 steps with 25000 reset in 610 ms.
Product exploration explored 100000 steps with 25000 reset in 476 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 243/243 transitions.
Graph (complete) has 150 edges and 239 vertex of which 25 are kept as prefixes of interest. Removing 214 places using SCC suffix rule.1 ms
Discarding 214 places :
Also discarding 203 output transitions
Drop transitions removed 203 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 25 transition count 38
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 20 transition count 28
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 20 transition count 28
Applied a total of 13 rules in 10 ms. Remains 20 /239 variables (removed 219) and now considering 28/243 (removed 215) transitions.
[2024-06-01 06:31:40] [INFO ] Redundant transitions in 19 ms returned [6, 21]
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 06:31:40] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:40] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/239 places, 26/243 transitions.
Graph (complete) has 12 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 3 ms. Remains 18 /20 variables (removed 2) and now considering 24/26 (removed 2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/239 places, 24/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 18/239 places, 24/243 transitions.
Built C files in :
/tmp/ltsmin7255043094805695788
[2024-06-01 06:31:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7255043094805695788
Running compilation step : cd /tmp/ltsmin7255043094805695788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1122 ms.
Running link step : cd /tmp/ltsmin7255043094805695788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin7255043094805695788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12214266312985472157.hoa' '--buchi-type=spotba'
LTSmin run took 244 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 finished in 9683 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)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 236 transition count 236
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 236 transition count 236
Applied a total of 72 rules in 11 ms. Remains 236 /272 variables (removed 36) and now considering 236/306 (removed 70) transitions.
// Phase 1: matrix 236 rows 236 cols
[2024-06-01 06:31:41] [INFO ] Computed 1 invariants in 11 ms
[2024-06-01 06:31:42] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 06:31:42] [INFO ] Invariant cache hit.
[2024-06-01 06:31:42] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-06-01 06:31:42] [INFO ] Invariant cache hit.
[2024-06-01 06:31:42] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/272 places, 236/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 875 ms. Remains : 236/272 places, 236/306 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s94 0) (EQ s95 0))], 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 488 ms.
Product exploration explored 100000 steps with 50000 reset in 492 ms.
Computed a total of 236 stabilizing places and 236 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 236
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 finished in 2120 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)||G(p1))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 28 are kept as prefixes of interest. Removing 244 places using SCC suffix rule.1 ms
Discarding 244 places :
Also discarding 253 output transitions
Drop transitions removed 253 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 47
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 20 transition count 29
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 20 transition count 29
Applied a total of 20 rules in 8 ms. Remains 20 /272 variables (removed 252) and now considering 29/306 (removed 277) transitions.
// Phase 1: matrix 29 rows 20 cols
[2024-06-01 06:31:43] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 06:31:43] [INFO ] Invariant cache hit.
[2024-06-01 06:31:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 06:31:44] [INFO ] Redundant transitions in 18 ms returned [5, 20]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 27 rows 20 cols
[2024-06-01 06:31:44] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:31:44] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/272 places, 27/306 transitions.
Graph (complete) has 9 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 1 ms. Remains 18 /20 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 18 cols
[2024-06-01 06:31:44] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 06:31:44] [INFO ] Invariant cache hit.
[2024-06-01 06:31:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/272 places, 25/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 18/272 places, 25/306 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s15 1) (NEQ s16 1)), p1:(OR (NEQ s6 1) (NEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7090 reset in 287 ms.
Product exploration explored 100000 steps with 7079 reset in 283 ms.
Computed a total of 18 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 25
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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 finished in 914 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 U p1))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 31 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.3 ms
Discarding 241 places :
Also discarding 253 output transitions
Drop transitions removed 253 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 30 transition count 47
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 23 transition count 31
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 23 transition count 31
Applied a total of 20 rules in 12 ms. Remains 23 /272 variables (removed 249) and now considering 31/306 (removed 275) transitions.
// Phase 1: matrix 31 rows 23 cols
[2024-06-01 06:31:44] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:31:44] [INFO ] Invariant cache hit.
[2024-06-01 06:31:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 06:31:44] [INFO ] Redundant transitions in 15 ms returned [5, 23]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-06-01 06:31:44] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/272 places, 29/306 transitions.
Graph (complete) has 11 edges and 23 vertex of which 21 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 21 /23 variables (removed 2) and now considering 27/29 (removed 2) transitions.
// Phase 1: matrix 27 rows 21 cols
[2024-06-01 06:31:45] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 06:31:45] [INFO ] Invariant cache hit.
[2024-06-01 06:31:45] [INFO ] Implicit Places using invariants and state equation in 48 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 : 21/272 places, 27/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 21/272 places, 27/306 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s8 1)), p0:(AND (EQ s16 1) (EQ s19 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 14 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 finished in 383 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)&&X(X((G(F(p0))||G(p1)))))))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 14 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.1 ms
Discarding 258 places :
Also discarding 277 output transitions
Drop transitions removed 277 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 13 transition count 26
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 9 transition count 14
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 9 transition count 14
Applied a total of 11 rules in 7 ms. Remains 9 /272 variables (removed 263) and now considering 14/306 (removed 292) transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-06-01 06:31:45] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 06:31:45] [INFO ] Invariant cache hit.
[2024-06-01 06:31:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 06:31:45] [INFO ] Redundant transitions in 16 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 13 rows 9 cols
[2024-06-01 06:31:45] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:45] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/272 places, 13/306 transitions.
Graph (complete) has 3 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 06:31:45] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 06:31:45] [INFO ] Invariant cache hit.
[2024-06-01 06:31:45] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/272 places, 12/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 8/272 places, 12/306 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 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:(OR (EQ s4 0) (EQ s7 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15434 reset in 389 ms.
Product exploration explored 100000 steps with 15443 reset in 384 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 finished in 1118 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)&&F(G(p1)))))'
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 31 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.0 ms
Discarding 241 places :
Also discarding 253 output transitions
Drop transitions removed 253 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 31 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 26 transition count 38
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 26 transition count 38
Applied a total of 13 rules in 6 ms. Remains 26 /272 variables (removed 246) and now considering 38/306 (removed 268) transitions.
// Phase 1: matrix 38 rows 26 cols
[2024-06-01 06:31:46] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 06:31:46] [INFO ] Invariant cache hit.
[2024-06-01 06:31:46] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 06:31:46] [INFO ] Redundant transitions in 16 ms returned [10, 14, 26, 30]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 34 rows 26 cols
[2024-06-01 06:31:46] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:46] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/272 places, 34/306 transitions.
Graph (complete) has 15 edges and 26 vertex of which 22 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 2 ms. Remains 22 /26 variables (removed 4) and now considering 30/34 (removed 4) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-01 06:31:46] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:31:46] [INFO ] Invariant cache hit.
[2024-06-01 06:31:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/272 places, 30/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 22/272 places, 30/306 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s4 0)), p1:(OR (AND (EQ s9 1) (EQ s11 1)) (AND (EQ s19 1) (EQ s20 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 14 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 finished in 327 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((!p1 U (!p2||G(!p1))))&&p0)))'
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 240 transition count 242
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 240 transition count 242
Applied a total of 64 rules in 7 ms. Remains 240 /272 variables (removed 32) and now considering 242/306 (removed 64) transitions.
// Phase 1: matrix 242 rows 240 cols
[2024-06-01 06:31:46] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 06:31:46] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 06:31:46] [INFO ] Invariant cache hit.
[2024-06-01 06:31:47] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-06-01 06:31:47] [INFO ] Invariant cache hit.
[2024-06-01 06:31:47] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/272 places, 242/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 240/272 places, 242/306 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p2 p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-10 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: 3}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (NEQ s161 1) (NEQ s163 1)) (OR (NEQ s236 1) (NEQ s238 1))), p2:(AND (EQ s206 1) (EQ s208 1)), p1:(OR (AND (EQ s161 1) (EQ s163 1)) (AND (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 569 ms.
Product exploration explored 100000 steps with 33333 reset in 562 ms.
Computed a total of 240 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 242
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 (NOT p2) (NOT p1)), (X p0), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 223 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-10 finished in 2269 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)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 17 are kept as prefixes of interest. Removing 255 places using SCC suffix rule.1 ms
Discarding 255 places :
Also discarding 277 output transitions
Drop transitions removed 277 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 16 transition count 27
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 13 transition count 19
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 13 transition count 19
Applied a total of 8 rules in 5 ms. Remains 13 /272 variables (removed 259) and now considering 19/306 (removed 287) transitions.
// Phase 1: matrix 19 rows 13 cols
[2024-06-01 06:31:48] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:31:48] [INFO ] Invariant cache hit.
[2024-06-01 06:31:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 06:31:49] [INFO ] Redundant transitions in 20 ms returned [2, 6, 10]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-06-01 06:31:49] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/272 places, 16/306 transitions.
Graph (complete) has 6 edges and 13 vertex of which 10 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 10 /13 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-01 06:31:49] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:31:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 06:31:49] [INFO ] Invariant cache hit.
[2024-06-01 06:31:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/272 places, 13/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 10/272 places, 13/306 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11451 reset in 132 ms.
Product exploration explored 100000 steps with 11446 reset in 154 ms.
Computed a total of 10 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 13
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 finished in 614 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)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 15 are kept as prefixes of interest. Removing 257 places using SCC suffix rule.1 ms
Discarding 257 places :
Also discarding 279 output transitions
Drop transitions removed 279 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 14 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 11 transition count 14
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 11 transition count 14
Applied a total of 13 rules in 7 ms. Remains 11 /272 variables (removed 261) and now considering 14/306 (removed 292) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 06:31:49] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 06:31:49] [INFO ] Invariant cache hit.
[2024-06-01 06:31:49] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 06:31:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-01 06:31:49] [INFO ] Invariant cache hit.
[2024-06-01 06:31:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/272 places, 14/306 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 11/272 places, 14/306 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11804 reset in 144 ms.
Product exploration explored 100000 steps with 11900 reset in 162 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 finished in 536 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(!p1))&&F(p0))||G(!p1)))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 237 transition count 240
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 237 transition count 240
Applied a total of 70 rules in 9 ms. Remains 237 /272 variables (removed 35) and now considering 240/306 (removed 66) transitions.
// Phase 1: matrix 240 rows 237 cols
[2024-06-01 06:31:50] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 06:31:50] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 06:31:50] [INFO ] Invariant cache hit.
[2024-06-01 06:31:50] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-01 06:31:50] [INFO ] Invariant cache hit.
[2024-06-01 06:31:50] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/272 places, 240/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 237/272 places, 240/306 transitions.
Stuttering acceptance computed with spot in 233 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), p1]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(AND (EQ s89 1) (EQ s91 1)), p1:(AND (EQ s209 1) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1734 reset in 585 ms.
Product exploration explored 100000 steps with 1748 reset in 501 ms.
Computed a total of 237 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 237 transition count 240
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 27 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 finished in 2187 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)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 15 are kept as prefixes of interest. Removing 257 places using SCC suffix rule.2 ms
Discarding 257 places :
Also discarding 276 output transitions
Drop transitions removed 276 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 14 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 11 transition count 15
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 11 transition count 15
Applied a total of 13 rules in 7 ms. Remains 11 /272 variables (removed 261) and now considering 15/306 (removed 291) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-06-01 06:31:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:31:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 06:31:52] [INFO ] Invariant cache hit.
[2024-06-01 06:31:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 06:31:52] [INFO ] Redundant transitions in 14 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 06:31:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:31:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/272 places, 14/306 transitions.
Graph (complete) has 4 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-01 06:31:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:31:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 06:31:52] [INFO ] Invariant cache hit.
[2024-06-01 06:31:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/272 places, 13/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 10/272 places, 13/306 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s9 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11442 reset in 101 ms.
Product exploration explored 100000 steps with 11414 reset in 117 ms.
Computed a total of 10 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 13
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-15 finished in 501 ms.
All properties solved by simple procedures.
Total runtime 25754 ms.

BK_STOP 1717223514432

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

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