About the Execution of ITS-Tools for ViralEpidemic-PT-S08D1C2A04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3235940.00 | 0.00 | 0.00 | TFTFFFFFTFFFFFT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r276-smll-165307353300388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ViralEpidemic-PT-S08D1C2A04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353300388
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 7.4K Apr 29 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 11 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 27M May 10 09:34 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-S08D1C2A04-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S08D1C2A04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653239551076
Running Version 202205111006
[2022-05-22 17:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 17:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 17:12:35] [INFO ] Load time of PNML (sax parser for PT used): 2153 ms
[2022-05-22 17:12:35] [INFO ] Transformed 46811 places.
[2022-05-22 17:12:35] [INFO ] Transformed 79577 transitions.
[2022-05-22 17:12:35] [INFO ] Parsed PT model containing 46811 places and 79577 transitions in 2632 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 46811 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46811/46811 places, 79577/79577 transitions.
Discarding 4536 places :
Symmetric choice reduction at 0 with 4536 rule applications. Total rules 4536 place count 42275 transition count 43289
Iterating global reduction 0 with 4536 rules applied. Total rules applied 9072 place count 42275 transition count 43289
Discarding 736 places :
Symmetric choice reduction at 0 with 736 rule applications. Total rules 9808 place count 41539 transition count 41817
Iterating global reduction 0 with 736 rules applied. Total rules applied 10544 place count 41539 transition count 41817
Applied a total of 10544 rules in 49263 ms. Remains 41539 /46811 variables (removed 5272) and now considering 41817/79577 (removed 37760) transitions.
// Phase 1: matrix 41817 rows 41539 cols
[2022-05-22 17:13:28] [INFO ] Invariants computation overflowed in 2342 ms
[2022-05-22 17:13:34] [INFO ] Implicit Places using invariants in 8395 ms returned []
Implicit Place search using SMT only with invariants took 8440 ms to find 0 implicit places.
// Phase 1: matrix 41817 rows 41539 cols
[2022-05-22 17:13:36] [INFO ] Invariants computation overflowed in 2095 ms
[2022-05-22 17:13:41] [INFO ] Dead Transitions using invariants and state equation in 7738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41539/46811 places, 41817/79577 transitions.
Finished structural reductions, in 1 iterations. Remains : 41539/46811 places, 41817/79577 transitions.
Support contains 74 out of 41539 places after structural reductions.
[2022-05-22 17:13:44] [INFO ] Flatten gal took : 2201 ms
[2022-05-22 17:13:46] [INFO ] Flatten gal took : 1840 ms
[2022-05-22 17:13:49] [INFO ] Input system was already deterministic with 41817 transitions.
Support contains 72 out of 41539 places (down from 74) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4009 ms. (steps per millisecond=2 ) properties (out of 34) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=7 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=9 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=9 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 41817 rows 41539 cols
[2022-05-22 17:13:57] [INFO ] Invariants computation overflowed in 1881 ms
[2022-05-22 17:14:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-22 17:14:23] [INFO ] After 25146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 41539 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Graph (complete) has 36712 edges and 41539 vertex of which 153 are kept as prefixes of interest. Removing 41386 places using SCC suffix rule.62 ms
Discarding 41386 places :
Also discarding 41550 output transitions
Drop transitions removed 41550 transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 153 transition count 126
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 155 place count 140 transition count 126
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 140 transition count 109
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 189 place count 123 transition count 109
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 213 place count 99 transition count 85
Iterating global reduction 2 with 24 rules applied. Total rules applied 237 place count 99 transition count 85
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 251 place count 92 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 252 place count 91 transition count 77
Applied a total of 252 rules in 225 ms. Remains 91 /41539 variables (removed 41448) and now considering 77/41817 (removed 41740) transitions.
Finished structural reductions, in 1 iterations. Remains : 91/41539 places, 77/41817 transitions.
Finished random walk after 732 steps, including 12 resets, run visited all 15 properties in 13 ms. (steps per millisecond=56 )
Computed a total of 41539 stabilizing places and 41817 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41539 transition count 41817
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(X((X(F(p1))&&p0)) U p2))))'
Support contains 4 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 41477 transition count 41684
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 41477 transition count 41684
Applied a total of 124 rules in 18348 ms. Remains 41477 /41539 variables (removed 62) and now considering 41684/41817 (removed 133) transitions.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:14:44] [INFO ] Invariants computation overflowed in 1716 ms
[2022-05-22 17:14:49] [INFO ] Implicit Places using invariants in 7110 ms returned []
Implicit Place search using SMT only with invariants took 7124 ms to find 0 implicit places.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:14:51] [INFO ] Invariants computation overflowed in 1742 ms
[2022-05-22 17:14:56] [INFO ] Dead Transitions using invariants and state equation in 7176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41477/41539 places, 41684/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41477/41539 places, 41684/41817 transitions.
Stuttering acceptance computed with spot in 593 ms :[p2, p2, (AND p2 p0 p1), (AND p2 p0 p1), (AND p1 p2)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p2 p0 p1), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s38864 1) (GEQ s39560 1)), p0:(AND (GEQ s38864 1) (GEQ s39560 1)), p1:(AND (GEQ s9320 1) (GEQ s9471 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 22140 steps with 7380 reset in 10005 ms.
Product exploration timeout after 22510 steps with 7503 reset in 10002 ms.
Computed a total of 41477 stabilizing places and 41684 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41477 transition count 41684
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 8 factoid took 223 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-00 finished in 301719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((p1 U p0)&&p2)))'
Support contains 8 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 41483 transition count 41680
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 41483 transition count 41680
Applied a total of 112 rules in 19063 ms. Remains 41483 /41539 variables (removed 56) and now considering 41680/41817 (removed 137) transitions.
// Phase 1: matrix 41680 rows 41483 cols
[2022-05-22 17:19:46] [INFO ] Invariants computation overflowed in 1267 ms
[2022-05-22 17:19:51] [INFO ] Implicit Places using invariants in 6697 ms returned []
Implicit Place search using SMT only with invariants took 6699 ms to find 0 implicit places.
// Phase 1: matrix 41680 rows 41483 cols
[2022-05-22 17:19:52] [INFO ] Invariants computation overflowed in 1415 ms
[2022-05-22 17:19:58] [INFO ] Dead Transitions using invariants and state equation in 6866 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41483/41539 places, 41680/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41483/41539 places, 41680/41817 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s34643 1) (GEQ s34671 1)) (AND (GEQ s13033 1) (GEQ s13054 1))), p0:(AND (GEQ s34643 1) (GEQ s34671 1)), p1:(AND (GEQ s11268 1) (GEQ s1129...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 11 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-01 finished in 33196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 4 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 41479 transition count 41674
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 41479 transition count 41674
Applied a total of 120 rules in 20929 ms. Remains 41479 /41539 variables (removed 60) and now considering 41674/41817 (removed 143) transitions.
// Phase 1: matrix 41674 rows 41479 cols
[2022-05-22 17:20:21] [INFO ] Invariants computation overflowed in 1637 ms
[2022-05-22 17:20:27] [INFO ] Implicit Places using invariants in 7385 ms returned []
Implicit Place search using SMT only with invariants took 7391 ms to find 0 implicit places.
// Phase 1: matrix 41674 rows 41479 cols
[2022-05-22 17:20:29] [INFO ] Invariants computation overflowed in 1719 ms
[2022-05-22 17:20:34] [INFO ] Dead Transitions using invariants and state equation in 6883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41479/41539 places, 41674/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41479/41539 places, 41674/41817 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (OR (LT s35025 1) (LT s35053 1)) (OR (LT s2616 1) (LT s2643 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 timeout after 31400 steps with 6280 reset in 10002 ms.
Product exploration timeout after 30510 steps with 6102 reset in 10002 ms.
Computed a total of 41479 stabilizing places and 41674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41479 transition count 41674
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, true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-02 finished in 289528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X((F(p0) U G(p1)))&&F(p0)) U (p0 U X(p1)))))'
Support contains 4 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 41478 transition count 41679
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 41478 transition count 41679
Applied a total of 122 rules in 20130 ms. Remains 41478 /41539 variables (removed 61) and now considering 41679/41817 (removed 138) transitions.
// Phase 1: matrix 41679 rows 41478 cols
[2022-05-22 17:25:10] [INFO ] Invariants computation overflowed in 1807 ms
[2022-05-22 17:25:16] [INFO ] Implicit Places using invariants in 7477 ms returned []
Implicit Place search using SMT only with invariants took 7480 ms to find 0 implicit places.
// Phase 1: matrix 41679 rows 41478 cols
[2022-05-22 17:25:17] [INFO ] Invariants computation overflowed in 1856 ms
[2022-05-22 17:25:23] [INFO ] Dead Transitions using invariants and state equation in 7621 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41478/41539 places, 41679/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41478/41539 places, 41679/41817 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s25969 1) (GEQ s25975 1)), p1:(AND (GEQ s35724 1) (GEQ s35757 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 3638 steps with 0 reset in 995 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-03 finished in 36675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&(G(p1)||F(p1))))'
Support contains 4 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 41478 transition count 41679
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 41478 transition count 41679
Applied a total of 122 rules in 20282 ms. Remains 41478 /41539 variables (removed 61) and now considering 41679/41817 (removed 138) transitions.
// Phase 1: matrix 41679 rows 41478 cols
[2022-05-22 17:25:47] [INFO ] Invariants computation overflowed in 2075 ms
[2022-05-22 17:25:52] [INFO ] Implicit Places using invariants in 7533 ms returned []
Implicit Place search using SMT only with invariants took 7535 ms to find 0 implicit places.
// Phase 1: matrix 41679 rows 41478 cols
[2022-05-22 17:25:55] [INFO ] Invariants computation overflowed in 2147 ms
[2022-05-22 17:26:00] [INFO ] Dead Transitions using invariants and state equation in 7844 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41478/41539 places, 41679/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41478/41539 places, 41679/41817 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s153 1) (GEQ s1373 1)) (LT s2390 1) (LT s2396 1)), p1:(OR (LT s153 1) (LT s1373 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 36360 steps with 10 reset in 10003 ms.
Entered a terminal (fully accepting) state of product in 25422 steps with 7 reset in 7938 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-04 finished in 53838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&X((G(p2)&&p1))))'
Support contains 6 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 41481 transition count 41677
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 41481 transition count 41677
Applied a total of 116 rules in 22651 ms. Remains 41481 /41539 variables (removed 58) and now considering 41677/41817 (removed 140) transitions.
// Phase 1: matrix 41677 rows 41481 cols
[2022-05-22 17:26:43] [INFO ] Invariants computation overflowed in 1445 ms
[2022-05-22 17:26:48] [INFO ] Implicit Places using invariants in 6662 ms returned []
Implicit Place search using SMT only with invariants took 6667 ms to find 0 implicit places.
// Phase 1: matrix 41677 rows 41481 cols
[2022-05-22 17:26:49] [INFO ] Invariants computation overflowed in 1369 ms
[2022-05-22 17:26:54] [INFO ] Dead Transitions using invariants and state equation in 6450 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41481/41539 places, 41677/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41481/41539 places, 41677/41817 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s21500 1) (GEQ s21521 1)), p0:(AND (GEQ s9073 1) (GEQ s9078 1)), p1:(AND (GEQ s7543 1) (GEQ s7546 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-05 finished in 36105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 41539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Graph (complete) has 36712 edges and 41539 vertex of which 21 are kept as prefixes of interest. Removing 41518 places using SCC suffix rule.71 ms
Discarding 41518 places :
Also discarding 41768 output transitions
Drop transitions removed 41768 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 20 transition count 32
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 15 transition count 22
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 15 transition count 22
Applied a total of 27 rules in 138 ms. Remains 15 /41539 variables (removed 41524) and now considering 22/41817 (removed 41795) transitions.
// Phase 1: matrix 22 rows 15 cols
[2022-05-22 17:26:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:26:55] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 22 rows 15 cols
[2022-05-22 17:26:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:26:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-22 17:26:55] [INFO ] Redundant transitions in 22 ms returned [2, 6, 19]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 19 rows 15 cols
[2022-05-22 17:26:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:26:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/41539 places, 19/41817 transitions.
Graph (complete) has 7 edges and 15 vertex of which 12 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 3 ms. Remains 12 /15 variables (removed 3) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 12 cols
[2022-05-22 17:26:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:26:55] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2022-05-22 17:26:55] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-22 17:26:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/41539 places, 16/41817 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/41539 places, 16/41817 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-06 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(X((G(X(G((p0 U p1)))) U p1)))))))'
Support contains 4 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 41479 transition count 41674
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 41479 transition count 41674
Applied a total of 120 rules in 16855 ms. Remains 41479 /41539 variables (removed 60) and now considering 41674/41817 (removed 143) transitions.
// Phase 1: matrix 41674 rows 41479 cols
[2022-05-22 17:27:14] [INFO ] Invariants computation overflowed in 1833 ms
[2022-05-22 17:27:19] [INFO ] Implicit Places using invariants in 6963 ms returned []
Implicit Place search using SMT only with invariants took 6981 ms to find 0 implicit places.
// Phase 1: matrix 41674 rows 41479 cols
[2022-05-22 17:27:21] [INFO ] Invariants computation overflowed in 1655 ms
[2022-05-22 17:27:26] [INFO ] Dead Transitions using invariants and state equation in 7448 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41479/41539 places, 41674/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41479/41539 places, 41674/41817 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(OR p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s24549 1) (GEQ s24576 1)), p0:(AND (GEQ s35338 1) (GEQ s35361 1) (GEQ s24549 1) (GEQ s24576 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 6 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-07 finished in 31699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p1))||G(X(X(p2)))))'
Support contains 6 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 41479 transition count 41681
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 41479 transition count 41681
Applied a total of 120 rules in 17568 ms. Remains 41479 /41539 variables (removed 60) and now considering 41681/41817 (removed 136) transitions.
// Phase 1: matrix 41681 rows 41479 cols
[2022-05-22 17:27:46] [INFO ] Invariants computation overflowed in 1554 ms
[2022-05-22 17:27:51] [INFO ] Implicit Places using invariants in 6560 ms returned []
Implicit Place search using SMT only with invariants took 6573 ms to find 0 implicit places.
// Phase 1: matrix 41681 rows 41479 cols
[2022-05-22 17:27:53] [INFO ] Invariants computation overflowed in 1998 ms
[2022-05-22 17:27:58] [INFO ] Dead Transitions using invariants and state equation in 7372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41479/41539 places, 41681/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41479/41539 places, 41681/41817 transitions.
Stuttering acceptance computed with spot in 425 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-09 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: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=2, aps=[p1:(AND (GEQ s30880 1) (GEQ s30936 1)), p0:(AND (GEQ s9716 1) (GEQ s9719 1)), p2:(OR (LT s24581 1) (LT s24602 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 timeout after 36090 steps with 9 reset in 10002 ms.
Entered a terminal (fully accepting) state of product in 4182 steps with 1 reset in 1197 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-09 finished in 43247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(G(p1)&&(X(X(p2))||p0))))))'
Support contains 6 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 41481 transition count 41677
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 41481 transition count 41677
Applied a total of 116 rules in 15641 ms. Remains 41481 /41539 variables (removed 58) and now considering 41677/41817 (removed 140) transitions.
// Phase 1: matrix 41677 rows 41481 cols
[2022-05-22 17:28:27] [INFO ] Invariants computation overflowed in 1361 ms
[2022-05-22 17:28:32] [INFO ] Implicit Places using invariants in 6502 ms returned []
Implicit Place search using SMT only with invariants took 6513 ms to find 0 implicit places.
// Phase 1: matrix 41677 rows 41481 cols
[2022-05-22 17:28:34] [INFO ] Invariants computation overflowed in 1588 ms
[2022-05-22 17:28:39] [INFO ] Dead Transitions using invariants and state equation in 6603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41481/41539 places, 41677/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41481/41539 places, 41677/41817 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (AND p0 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s32623 1) (GEQ s32655 1)), p1:(OR (LT s27529 1) (LT s27557 1)), p2:(AND (GEQ s2785 1) (GEQ s2816 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 9 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-10 finished in 29109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 41477 transition count 41684
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 41477 transition count 41684
Applied a total of 124 rules in 20421 ms. Remains 41477 /41539 variables (removed 62) and now considering 41684/41817 (removed 133) transitions.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:29:01] [INFO ] Invariants computation overflowed in 1436 ms
[2022-05-22 17:29:06] [INFO ] Implicit Places using invariants in 6846 ms returned []
Implicit Place search using SMT only with invariants took 6849 ms to find 0 implicit places.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:29:08] [INFO ] Invariants computation overflowed in 1269 ms
[2022-05-22 17:29:13] [INFO ] Dead Transitions using invariants and state equation in 6557 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41477/41539 places, 41684/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41477/41539 places, 41684/41817 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s17808 1) (LT s18112 1) (LT s39890 1) (LT s40096 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 34970 steps with 9 reset in 10002 ms.
Product exploration timeout after 31440 steps with 8 reset in 10001 ms.
Computed a total of 41477 stabilizing places and 41684 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41477 transition count 41684
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, true, (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3258 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 44197 steps, run timeout after 12010 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 44197 steps, saw 43315 distinct states, run finished after 12013 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:33:42] [INFO ] Invariants computation overflowed in 1655 ms
[2022-05-22 17:34:07] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 41477 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41477/41477 places, 41684/41684 transitions.
Graph (complete) has 36683 edges and 41477 vertex of which 27 are kept as prefixes of interest. Removing 41450 places using SCC suffix rule.14 ms
Discarding 41450 places :
Also discarding 41623 output transitions
Drop transitions removed 41623 transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 27 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 23 transition count 23
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 55 place count 11 transition count 11
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 10 transition count 10
Applied a total of 68 rules in 76 ms. Remains 10 /41477 variables (removed 41467) and now considering 10/41684 (removed 41674) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/41477 places, 10/41684 transitions.
Finished random walk after 15 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, true, (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 41477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41477/41477 places, 41684/41684 transitions.
Applied a total of 0 rules in 15355 ms. Remains 41477 /41477 variables (removed 0) and now considering 41684/41684 (removed 0) transitions.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:34:25] [INFO ] Invariants computation overflowed in 1594 ms
[2022-05-22 17:34:30] [INFO ] Implicit Places using invariants in 7193 ms returned []
Implicit Place search using SMT only with invariants took 7197 ms to find 0 implicit places.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:34:32] [INFO ] Invariants computation overflowed in 1497 ms
[2022-05-22 17:34:37] [INFO ] Dead Transitions using invariants and state equation in 7275 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41477/41477 places, 41684/41684 transitions.
Computed a total of 41477 stabilizing places and 41684 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41477 transition count 41684
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, true, (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3516 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 994 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 47791 steps, run timeout after 12008 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 47791 steps, saw 46852 distinct states, run finished after 12009 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 41684 rows 41477 cols
[2022-05-22 17:39:03] [INFO ] Invariants computation overflowed in 1546 ms
[2022-05-22 17:39:28] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 41477 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41477/41477 places, 41684/41684 transitions.
Graph (complete) has 36683 edges and 41477 vertex of which 27 are kept as prefixes of interest. Removing 41450 places using SCC suffix rule.17 ms
Discarding 41450 places :
Also discarding 41623 output transitions
Drop transitions removed 41623 transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 27 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 23 transition count 23
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 55 place count 11 transition count 11
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 10 transition count 10
Applied a total of 68 rules in 72 ms. Remains 10 /41477 variables (removed 41467) and now considering 10/41684 (removed 41674) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/41477 places, 10/41684 transitions.
Finished random walk after 9 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, true, (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 36000 steps with 10 reset in 10002 ms.
Product exploration timeout after 31330 steps with 8 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 41477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41477/41477 places, 41684/41684 transitions.
Graph (complete) has 36683 edges and 41477 vertex of which 50 are kept as prefixes of interest. Removing 41427 places using SCC suffix rule.26 ms
Discarding 41427 places :
Also discarding 41571 output transitions
Drop transitions removed 41571 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 50 transition count 101
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 38 place count 25 transition count 39
Iterating global reduction 1 with 25 rules applied. Total rules applied 63 place count 25 transition count 39
Applied a total of 63 rules in 73 ms. Remains 25 /41477 variables (removed 41452) and now considering 39/41684 (removed 41645) transitions.
[2022-05-22 17:39:49] [INFO ] Redundant transitions in 47 ms returned [6, 10, 24, 28]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 35 rows 25 cols
[2022-05-22 17:39:49] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 17:39:49] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/41477 places, 35/41684 transitions.
Graph (complete) has 15 edges and 25 vertex of which 21 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 9 ms. Remains 21 /25 variables (removed 4) and now considering 31/35 (removed 4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/41477 places, 31/41684 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/41477 places, 31/41684 transitions.
Entered a terminal (fully accepting) state of product in 12789 steps with 472 reset in 336 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-11 finished in 670629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 41539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Graph (complete) has 36712 edges and 41539 vertex of which 27 are kept as prefixes of interest. Removing 41512 places using SCC suffix rule.23 ms
Discarding 41512 places :
Also discarding 41762 output transitions
Drop transitions removed 41762 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 26 transition count 43
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 17 transition count 25
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 17 transition count 25
Applied a total of 30 rules in 63 ms. Remains 17 /41539 variables (removed 41522) and now considering 25/41817 (removed 41792) transitions.
// Phase 1: matrix 25 rows 17 cols
[2022-05-22 17:39:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:39:50] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 25 rows 17 cols
[2022-05-22 17:39:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:39:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-22 17:39:50] [INFO ] Redundant transitions in 14 ms returned [8, 20, 22, 24]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 21 rows 17 cols
[2022-05-22 17:39:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:39:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/41539 places, 21/41817 transitions.
Graph (complete) has 9 edges and 17 vertex of which 13 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 1 ms. Remains 13 /17 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 13 cols
[2022-05-22 17:39:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 17:39:50] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 17 rows 13 cols
[2022-05-22 17:39:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 17:39:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/41539 places, 17/41817 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/41539 places, 17/41817 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-12 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U (G(p1)||!p2)))))'
Support contains 6 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 41481 transition count 41677
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 41481 transition count 41677
Applied a total of 116 rules in 19468 ms. Remains 41481 /41539 variables (removed 58) and now considering 41677/41817 (removed 140) transitions.
// Phase 1: matrix 41677 rows 41481 cols
[2022-05-22 17:40:11] [INFO ] Invariants computation overflowed in 1566 ms
[2022-05-22 17:40:17] [INFO ] Implicit Places using invariants in 7233 ms returned []
Implicit Place search using SMT only with invariants took 7234 ms to find 0 implicit places.
// Phase 1: matrix 41677 rows 41481 cols
[2022-05-22 17:40:19] [INFO ] Invariants computation overflowed in 1718 ms
[2022-05-22 17:40:24] [INFO ] Dead Transitions using invariants and state equation in 7061 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41481/41539 places, 41677/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41481/41539 places, 41677/41817 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), true, (NOT p0), (NOT p1), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s41164 1) (GEQ s41179 1)), p0:(AND (GEQ s37967 1) (GEQ s37977 1)), p1:(AND (GEQ s12089 1) (GEQ s12102 1))], 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]]
Entered a terminal (fully accepting) state of product in 27725 steps with 7 reset in 7392 ms.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-13 finished in 41522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 41539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Graph (complete) has 36712 edges and 41539 vertex of which 35 are kept as prefixes of interest. Removing 41504 places using SCC suffix rule.22 ms
Discarding 41504 places :
Also discarding 41754 output transitions
Drop transitions removed 41754 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 34 transition count 58
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 16 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 16 transition count 22
Applied a total of 41 rules in 58 ms. Remains 16 /41539 variables (removed 41523) and now considering 22/41817 (removed 41795) transitions.
// Phase 1: matrix 22 rows 16 cols
[2022-05-22 17:40:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:40:32] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 22 rows 16 cols
[2022-05-22 17:40:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 17:40:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-22 17:40:32] [INFO ] Redundant transitions in 13 ms returned [4, 11]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 20 rows 16 cols
[2022-05-22 17:40:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:40:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/41539 places, 20/41817 transitions.
Graph (complete) has 8 edges and 16 vertex of which 14 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 14 /16 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 14 cols
[2022-05-22 17:40:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:40:32] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 14 cols
[2022-05-22 17:40:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 17:40:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/41539 places, 18/41817 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/41539 places, 18/41817 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5746 reset in 127 ms.
Product exploration explored 100000 steps with 5759 reset in 185 ms.
Computed a total of 14 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 18
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 :(F (G p0))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S08D1C2A04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-14 finished in 738 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((!(p0 U p1)&&G(p2)))&&(p3 U !X(p4))))'
Support contains 10 out of 41539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41539/41539 places, 41817/41817 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 41483 transition count 41687
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 41483 transition count 41687
Applied a total of 112 rules in 20330 ms. Remains 41483 /41539 variables (removed 56) and now considering 41687/41817 (removed 130) transitions.
// Phase 1: matrix 41687 rows 41483 cols
[2022-05-22 17:40:54] [INFO ] Invariants computation overflowed in 1442 ms
[2022-05-22 17:41:00] [INFO ] Implicit Places using invariants in 6952 ms returned []
Implicit Place search using SMT only with invariants took 6956 ms to find 0 implicit places.
// Phase 1: matrix 41687 rows 41483 cols
[2022-05-22 17:41:01] [INFO ] Invariants computation overflowed in 1432 ms
[2022-05-22 17:41:07] [INFO ] Dead Transitions using invariants and state equation in 6990 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41483/41539 places, 41687/41817 transitions.
Finished structural reductions, in 1 iterations. Remains : 41483/41539 places, 41687/41817 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) p1 p4), p4, (OR (NOT p2) p1), p4, (NOT p2), p1, true]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p4, acceptance={} source=1 dest: 6}], [{ cond=(OR p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p3) p4), acceptance={} source=3 dest: 1}, { cond=(AND p3 p4), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=4 dest: 2}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s7348 1) (GEQ s7373 1)), p1:(AND (GEQ s21707 1) (GEQ s21727 1)), p2:(OR (LT s15582 1) (LT s15605 1)), p0:(AND (GEQ s4053 1) (GEQ s4066 1)), p...], nbAcceptance=2, 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 timeout after 33870 steps with 15 reset in 10003 ms.
Product exploration timeout after 32320 steps with 21 reset in 10001 ms.
Computed a total of 41483 stabilizing places and 41687 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41483 transition count 41687
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 p3) (NOT p1) p2 (NOT p0) (NOT p4)), (X (NOT (AND (NOT p3) p4))), (X (NOT p4)), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X p2), (X (NOT (AND p3 p4))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p3) p4)))), true, (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT p4))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p4)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1692 ms. Reduced automaton from 7 states, 16 edges and 5 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3553 ms. (steps per millisecond=2 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 41687 rows 41483 cols
[2022-05-22 17:46:10] [INFO ] Invariants computation overflowed in 1528 ms
[2022-05-22 17:46:35] [INFO ] After 11156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-22 17:46:36] [INFO ] After 11250ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-22 17:46:36] [INFO ] After 25140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 41483 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41483/41483 places, 41687/41687 transitions.
Graph (complete) has 36687 edges and 41483 vertex of which 26 are kept as prefixes of interest. Removing 41457 places using SCC suffix rule.18 ms
Discarding 41457 places :
Also discarding 41648 output transitions
Drop transitions removed 41648 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 26 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 20 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 29 place count 20 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 17 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 16 transition count 13
Applied a total of 36 rules in 61 ms. Remains 16 /41483 variables (removed 41467) and now considering 13/41687 (removed 41674) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/41483 places, 13/41687 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0) (NOT p4)), (X (NOT (AND (NOT p3) p4))), (X (NOT p4)), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X p2), (X (NOT (AND p3 p4))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p3) p4)))), true, (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT p4))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p4)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (AND (NOT p1) p0)), (F (OR p1 (NOT p2))), (F (AND (NOT p1) p2 p0)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 25 factoid took 1623 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Support contains 6 out of 41483 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 41483/41483 places, 41687/41687 transitions.
Applied a total of 0 rules in 11007 ms. Remains 41483 /41483 variables (removed 0) and now considering 41687/41687 (removed 0) transitions.
// Phase 1: matrix 41687 rows 41483 cols
[2022-05-22 17:46:50] [INFO ] Invariants computation overflowed in 1558 ms
[2022-05-22 17:46:56] [INFO ] Implicit Places using invariants in 7195 ms returned []
Implicit Place search using SMT only with invariants took 7197 ms to find 0 implicit places.
// Phase 1: matrix 41687 rows 41483 cols
[2022-05-22 17:46:57] [INFO ] Invariants computation overflowed in 1381 ms
[2022-05-22 17:47:03] [INFO ] Dead Transitions using invariants and state equation in 7222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41483/41483 places, 41687/41687 transitions.
Computed a total of 41483 stabilizing places and 41687 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41483 transition count 41687
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) p2 (NOT p0)), (X p2), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 498 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3140 ms. (steps per millisecond=3 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 41687 rows 41483 cols
[2022-05-22 17:47:21] [INFO ] Invariants computation overflowed in 1545 ms
[2022-05-22 17:47:46] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 41483 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41483/41483 places, 41687/41687 transitions.
Graph (complete) has 36687 edges and 41483 vertex of which 9 are kept as prefixes of interest. Removing 41474 places using SCC suffix rule.10 ms
Discarding 41474 places :
Also discarding 41674 output transitions
Drop transitions removed 41674 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 9 transition count 5
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 5 transition count 4
Applied a total of 14 rules in 42 ms. Remains 5 /41483 variables (removed 41478) and now considering 4/41687 (removed 41683) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/41483 places, 4/41687 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (AND (NOT p1) p0)), (F (OR p1 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 537 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Product exploration timeout after 38910 steps with 11 reset in 10003 ms.
Product exploration timeout after 35390 steps with 10 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), p1]
Support contains 6 out of 41483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41483/41483 places, 41687/41687 transitions.
Graph (complete) has 36687 edges and 41483 vertex of which 72 are kept as prefixes of interest. Removing 41411 places using SCC suffix rule.30 ms
Discarding 41411 places :
Also discarding 41544 output transitions
Drop transitions removed 41544 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 72 transition count 120
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 47 transition count 70
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 47 transition count 70
Applied a total of 74 rules in 95 ms. Remains 47 /41483 variables (removed 41436) and now considering 70/41687 (removed 41617) transitions.
[2022-05-22 17:48:07] [INFO ] Redundant transitions in 31 ms returned [8, 12, 23, 26, 30, 34, 54, 62, 65, 68]
Found 10 redundant transitions using SMT.
Drop transitions removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions.
// Phase 1: matrix 60 rows 47 cols
[2022-05-22 17:48:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 17:48:07] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/41483 places, 60/41687 transitions.
Graph (complete) has 30 edges and 47 vertex of which 37 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 2 ms. Remains 37 /47 variables (removed 10) and now considering 50/60 (removed 10) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/41483 places, 50/41687 transitions.
Finished structural reductions, in 2 iterations. Remains : 37/41483 places, 50/41687 transitions.
Product exploration explored 100000 steps with 2475 reset in 572 ms.
Product exploration explored 100000 steps with 2476 reset in 571 ms.
Built C files in :
/tmp/ltsmin10006754671944616596
[2022-05-22 17:48:10] [INFO ] Built C files in 838ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10006754671944616596
Running compilation step : cd /tmp/ltsmin10006754671944616596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10006754671944616596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10006754671944616596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 41483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41483/41483 places, 41687/41687 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41480 transition count 41676
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41480 transition count 41676
Applied a total of 6 rules in 23246 ms. Remains 41480 /41483 variables (removed 3) and now considering 41676/41687 (removed 11) transitions.
// Phase 1: matrix 41676 rows 41480 cols
[2022-05-22 17:48:37] [INFO ] Invariants computation overflowed in 1483 ms
[2022-05-22 17:48:43] [INFO ] Implicit Places using invariants in 7648 ms returned []
Implicit Place search using SMT only with invariants took 7652 ms to find 0 implicit places.
// Phase 1: matrix 41676 rows 41480 cols
[2022-05-22 17:48:45] [INFO ] Invariants computation overflowed in 1454 ms
[2022-05-22 17:48:50] [INFO ] Dead Transitions using invariants and state equation in 6700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41480/41483 places, 41676/41687 transitions.
Finished structural reductions, in 1 iterations. Remains : 41480/41483 places, 41676/41687 transitions.
Built C files in :
/tmp/ltsmin4762455162702814677
[2022-05-22 17:48:51] [INFO ] Built C files in 471ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4762455162702814677
Running compilation step : cd /tmp/ltsmin4762455162702814677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4762455162702814677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4762455162702814677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-22 17:48:58] [INFO ] Flatten gal took : 1697 ms
[2022-05-22 17:48:59] [INFO ] Flatten gal took : 1628 ms
[2022-05-22 17:49:00] [INFO ] Time to serialize gal into /tmp/LTL6845681537411980077.gal : 436 ms
[2022-05-22 17:49:00] [INFO ] Time to serialize properties into /tmp/LTL3031407616287227692.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6845681537411980077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3031407616287227692.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6845681...266
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-22 17:49:17] [INFO ] Flatten gal took : 1614 ms
[2022-05-22 17:49:17] [INFO ] Applying decomposition
[2022-05-22 17:49:19] [INFO ] Flatten gal took : 2039 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11357130535126968084.txt' '-o' '/tmp/graph11357130535126968084.bin' '-w' '/tmp/graph11357130535126968084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11357130535126968084.bin' '-l' '-1' '-v' '-w' '/tmp/graph11357130535126968084.weights' '-q' '0' '-e' '0.001'
[2022-05-22 17:49:24] [INFO ] Decomposing Gal with order
[2022-05-22 17:50:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 17:59:48] [INFO ] Removed a total of 32596 redundant transitions.
[2022-05-22 17:59:49] [INFO ] Flatten gal took : 4116 ms
[2022-05-22 18:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 84695 labels/synchronizations in 56102 ms.
[2022-05-22 18:00:47] [INFO ] Time to serialize gal into /tmp/LTL15800849626815311863.gal : 620 ms
[2022-05-22 18:00:47] [INFO ] Time to serialize properties into /tmp/LTL9610121011921453163.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15800849626815311863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9610121011921453163.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1580084...246
Read 1 LTL properties
Checking formula 0 : !(((F((!(("((u885.cFactor47625>=1)&&(i438.i0.u884.patient76254>=1))")U("((u4702.dFactor46663>=1)&&(i2670.i3.u4699.patient66634>=1))"))...351
Formula 0 simplified : !(F(!("((u885.cFactor47625>=1)&&(i438.i0.u884.patient76254>=1))" U "((u4702.dFactor46663>=1)&&(i2670.i3.u4699.patient66634>=1))") & ...337
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15531986870436816098
[2022-05-22 18:01:02] [INFO ] Built C files in 366ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15531986870436816098
Running compilation step : cd /tmp/ltsmin15531986870436816098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15531986870436816098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15531986870436816098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ViralEpidemic-PT-S08D1C2A04-LTLFireability-15 finished in 1233110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((!(p0 U p1)&&G(p2)))&&(p3 U !X(p4))))'
[2022-05-22 18:01:08] [INFO ] Flatten gal took : 2075 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8888982782822886621
[2022-05-22 18:01:09] [INFO ] Too many transitions (41817) to apply POR reductions. Disabling POR matrices.
[2022-05-22 18:01:09] [INFO ] Built C files in 450ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8888982782822886621
Running compilation step : cd /tmp/ltsmin8888982782822886621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-22 18:01:11] [INFO ] Applying decomposition
[2022-05-22 18:01:13] [INFO ] Flatten gal took : 2397 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7300891436377965545.txt' '-o' '/tmp/graph7300891436377965545.bin' '-w' '/tmp/graph7300891436377965545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7300891436377965545.bin' '-l' '-1' '-v' '-w' '/tmp/graph7300891436377965545.weights' '-q' '0' '-e' '0.001'
[2022-05-22 18:01:18] [INFO ] Decomposing Gal with order
[2022-05-22 18:02:10] [INFO ] Rewriting arrays to variables to allow decomposition.
BK_STOP 1653242787016
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S08D1C2A04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S08D1C2A04, 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 r276-smll-165307353300388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S08D1C2A04.tgz
mv ViralEpidemic-PT-S08D1C2A04 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 '
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 ;