Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912700601315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ViralEpidemic-PT-S04D1C1A06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700601315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.9K Feb 25 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 21:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 23:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 23:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 20M Mar 5 18:23 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-S04D1C1A06-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679340987726

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 19:36:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 19:36:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:36:30] [INFO ] Load time of PNML (sax parser for PT used): 1087 ms
[2023-03-20 19:36:30] [INFO ] Transformed 32767 places.
[2023-03-20 19:36:30] [INFO ] Transformed 49149 transitions.
[2023-03-20 19:36:30] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 1324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2084 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:36:42] [INFO ] Invariants computation overflowed in 9036 ms
[2023-03-20 19:36:45] [INFO ] Implicit Places using invariants in 12421 ms returned []
Implicit Place search using SMT only with invariants took 12447 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:36:54] [INFO ] Invariants computation overflowed in 8785 ms
[2023-03-20 19:36:56] [INFO ] Dead Transitions using invariants and state equation in 11092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25634 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Support contains 47 out of 32767 places after structural reductions.
[2023-03-20 19:36:58] [INFO ] Flatten gal took : 1518 ms
[2023-03-20 19:36:59] [INFO ] Flatten gal took : 1184 ms
[2023-03-20 19:37:02] [INFO ] Input system was already deterministic with 49149 transitions.
Support contains 43 out of 32767 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 2585 ms. (steps per millisecond=3 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=4 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:37:16] [INFO ] Invariants computation overflowed in 8455 ms
[2023-03-20 19:37:29] [INFO ] After 12708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-20 19:37:54] [INFO ] After 6226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-20 19:37:54] [INFO ] After 6280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 19:37:54] [INFO ] After 25093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 283 are kept as prefixes of interest. Removing 32484 places using SCC suffix rule.41 ms
Discarding 32484 places :
Also discarding 48428 output transitions
Drop transitions removed 48428 transitions
Drop transitions removed 471 transitions
Reduce isomorphic transitions removed 471 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 541 rules applied. Total rules applied 542 place count 283 transition count 180
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 613 place count 213 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 614 place count 212 transition count 179
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 614 place count 212 transition count 161
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 650 place count 194 transition count 161
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 718 place count 126 transition count 93
Iterating global reduction 3 with 68 rules applied. Total rules applied 786 place count 126 transition count 93
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 854 place count 92 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 855 place count 91 transition count 58
Ensure Unique test removed 15 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 870 place count 76 transition count 58
Applied a total of 870 rules in 211 ms. Remains 76 /32767 variables (removed 32691) and now considering 58/49149 (removed 49091) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 76/32767 places, 58/49149 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 58 rows 76 cols
[2023-03-20 19:37:55] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-20 19:37:55] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-20 19:37:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 19:37:55] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 2 ms returned sat
[2023-03-20 19:37:55] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||G(p1)||(p1&&F(p2))))))'
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2423 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:38:06] [INFO ] Invariants computation overflowed in 8355 ms
[2023-03-20 19:38:08] [INFO ] Implicit Places using invariants in 10722 ms returned []
Implicit Place search using SMT only with invariants took 10723 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:38:17] [INFO ] Invariants computation overflowed in 8487 ms
[2023-03-20 19:38:19] [INFO ] Dead Transitions using invariants and state equation in 10906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24064 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT 1 s9866), p2:(GT s20492 s26402), p1:(GT s636 s27955)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3673 steps with 5 reset in 711 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 finished in 25279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1651 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:38:30] [INFO ] Invariants computation overflowed in 8217 ms
[2023-03-20 19:38:33] [INFO ] Implicit Places using invariants in 10607 ms returned []
Implicit Place search using SMT only with invariants took 10609 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:38:41] [INFO ] Invariants computation overflowed in 8356 ms
[2023-03-20 19:38:44] [INFO ] Dead Transitions using invariants and state equation in 10778 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23044 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT s30573 s9840), p0:(LEQ s13072 s18620)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 28260 steps with 14130 reset in 10003 ms.
Product exploration timeout after 25640 steps with 12820 reset in 10002 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 finished in 197947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 60 are kept as prefixes of interest. Removing 32707 places using SCC suffix rule.50 ms
Discarding 32707 places :
Also discarding 49025 output transitions
Drop transitions removed 49025 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 113
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 32 place count 38 transition count 56
Iterating global reduction 1 with 21 rules applied. Total rules applied 53 place count 38 transition count 56
Graph (complete) has 23 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 37 transition count 55
Applied a total of 54 rules in 100 ms. Remains 37 /32767 variables (removed 32730) and now considering 55/49149 (removed 49094) transitions.
// Phase 1: matrix 55 rows 37 cols
[2023-03-20 19:41:39] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 19:41:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 19:41:39] [INFO ] Invariant cache hit.
[2023-03-20 19:41:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-20 19:41:39] [INFO ] Redundant transitions in 14 ms returned [12, 19, 22, 24, 27, 30, 34, 38, 42]
Found 9 redundant transitions using SMT.
Drop transitions removed 9 transitions
Redundant transitions reduction (with SMT) removed 9 transitions.
// Phase 1: matrix 46 rows 37 cols
[2023-03-20 19:41:39] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 19:41:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/32767 places, 46/49149 transitions.
Graph (complete) has 22 edges and 37 vertex of which 28 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 2 ms. Remains 28 /37 variables (removed 9) and now considering 37/46 (removed 9) transitions.
// Phase 1: matrix 37 rows 28 cols
[2023-03-20 19:41:39] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-20 19:41:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 19:41:39] [INFO ] Invariant cache hit.
[2023-03-20 19:41:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/32767 places, 37/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 28/32767 places, 37/49149 transitions.
Stuttering acceptance computed with spot in 31 ms :[false]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s24 s12)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4242 reset in 139 ms.
Product exploration explored 100000 steps with 4240 reset in 217 ms.
Computed a total of 28 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 37
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1528 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:41:49] [INFO ] Invariants computation overflowed in 8670 ms
[2023-03-20 19:41:52] [INFO ] Implicit Places using invariants in 11128 ms returned []
Implicit Place search using SMT only with invariants took 11129 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:42:00] [INFO ] Invariants computation overflowed in 8514 ms
[2023-03-20 19:42:03] [INFO ] Dead Transitions using invariants and state equation in 10931 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23590 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s12697 s19361)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 28430 steps with 14215 reset in 10001 ms.
Product exploration timeout after 25680 steps with 12840 reset in 10001 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 finished in 203438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1561 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:45:13] [INFO ] Invariants computation overflowed in 8643 ms
[2023-03-20 19:45:15] [INFO ] Implicit Places using invariants in 10997 ms returned []
Implicit Place search using SMT only with invariants took 10999 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:45:24] [INFO ] Invariants computation overflowed in 8559 ms
[2023-03-20 19:45:26] [INFO ] Dead Transitions using invariants and state equation in 10923 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23486 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s11757 s11994), p1:(OR (LEQ s18546 s8484) (LEQ 2 s18166))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 60030 steps with 94 reset in 10001 ms.
Product exploration timeout after 45910 steps with 74 reset in 10002 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1802 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1354 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1386 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 32406 steps, run timeout after 12004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 32406 steps, saw 31644 distinct states, run finished after 12005 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:48:55] [INFO ] Invariants computation overflowed in 9049 ms
[2023-03-20 19:49:00] [INFO ] After 5023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:49:25] [INFO ] After 19331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:49:25] [INFO ] After 19361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 19:49:25] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 41 are kept as prefixes of interest. Removing 32726 places using SCC suffix rule.9 ms
Discarding 32726 places :
Also discarding 49044 output transitions
Drop transitions removed 49044 transitions
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 41 transition count 25
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 93 place count 29 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 93 place count 29 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 97 place count 27 transition count 23
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 106 place count 18 transition count 14
Iterating global reduction 2 with 9 rules applied. Total rules applied 115 place count 18 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 123 place count 14 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 13 transition count 9
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 11 transition count 9
Applied a total of 126 rules in 53 ms. Remains 11 /32767 variables (removed 32756) and now considering 9/49149 (removed 49140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 11/32767 places, 9/49149 transitions.
Finished random walk after 14 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1605 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:49:36] [INFO ] Invariants computation overflowed in 8750 ms
[2023-03-20 19:49:38] [INFO ] Implicit Places using invariants in 11169 ms returned []
Implicit Place search using SMT only with invariants took 11181 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:49:47] [INFO ] Invariants computation overflowed in 8552 ms
[2023-03-20 19:49:49] [INFO ] Dead Transitions using invariants and state equation in 10952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23742 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 1809 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1407 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1421 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 32546 steps, run timeout after 12006 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 32546 steps, saw 31780 distinct states, run finished after 12006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:53:07] [INFO ] Invariants computation overflowed in 9570 ms
[2023-03-20 19:53:12] [INFO ] After 4940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:53:37] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 41 are kept as prefixes of interest. Removing 32726 places using SCC suffix rule.9 ms
Discarding 32726 places :
Also discarding 49044 output transitions
Drop transitions removed 49044 transitions
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 41 transition count 25
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 93 place count 29 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 93 place count 29 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 97 place count 27 transition count 23
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 106 place count 18 transition count 14
Iterating global reduction 2 with 9 rules applied. Total rules applied 115 place count 18 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 123 place count 14 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 13 transition count 9
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 11 transition count 9
Applied a total of 126 rules in 57 ms. Remains 11 /32767 variables (removed 32756) and now considering 9/49149 (removed 49140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 11/32767 places, 9/49149 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 55880 steps with 90 reset in 10002 ms.
Product exploration timeout after 43620 steps with 66 reset in 10002 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 104 are kept as prefixes of interest. Removing 32663 places using SCC suffix rule.21 ms
Discarding 32663 places :
Also discarding 48929 output transitions
Drop transitions removed 48929 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 104 transition count 188
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 72 place count 65 transition count 90
Iterating global reduction 1 with 39 rules applied. Total rules applied 111 place count 65 transition count 90
Graph (complete) has 40 edges and 65 vertex of which 63 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 63 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 63 transition count 87
Applied a total of 113 rules in 61 ms. Remains 63 /32767 variables (removed 32704) and now considering 87/49149 (removed 49062) transitions.
[2023-03-20 19:53:58] [INFO ] Redundant transitions in 17 ms returned [12, 22, 26, 45, 54, 68]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 81 rows 63 cols
[2023-03-20 19:53:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 19:53:58] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/32767 places, 81/49149 transitions.
Graph (complete) has 38 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Applied a total of 1 rules in 2 ms. Remains 57 /63 variables (removed 6) and now considering 75/81 (removed 6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/32767 places, 75/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 57/32767 places, 75/49149 transitions.
Built C files in :
/tmp/ltsmin4895333383937546339
[2023-03-20 19:53:58] [INFO ] Built C files in 456ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4895333383937546339
Running compilation step : cd /tmp/ltsmin4895333383937546339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4895333383937546339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4895333383937546339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1799 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:54:13] [INFO ] Invariants computation overflowed in 8557 ms
[2023-03-20 19:54:16] [INFO ] Implicit Places using invariants in 10990 ms returned []
Implicit Place search using SMT only with invariants took 10991 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 19:54:24] [INFO ] Invariants computation overflowed in 8476 ms
[2023-03-20 19:54:27] [INFO ] Dead Transitions using invariants and state equation in 10923 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23725 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Built C files in :
/tmp/ltsmin5126005558766927368
[2023-03-20 19:54:27] [INFO ] Built C files in 384ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5126005558766927368
Running compilation step : cd /tmp/ltsmin5126005558766927368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5126005558766927368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5126005558766927368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 19:54:32] [INFO ] Flatten gal took : 1149 ms
[2023-03-20 19:54:34] [INFO ] Flatten gal took : 1349 ms
[2023-03-20 19:54:34] [INFO ] Time to serialize gal into /tmp/LTL7379863624423352644.gal : 208 ms
[2023-03-20 19:54:34] [INFO ] Time to serialize properties into /tmp/LTL3871198499907986090.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7379863624423352644.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7516532866058630750.hoa' '-atoms' '/tmp/LTL3871198499907986090.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Detected timeout of ITS tools.
[2023-03-20 19:54:51] [INFO ] Flatten gal took : 1303 ms
[2023-03-20 19:54:52] [INFO ] Flatten gal took : 1101 ms
[2023-03-20 19:54:52] [INFO ] Time to serialize gal into /tmp/LTL15733350620602508404.gal : 167 ms
[2023-03-20 19:54:52] [INFO ] Time to serialize properties into /tmp/LTL16374598892139645410.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15733350620602508404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16374598892139645410.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 19:55:09] [INFO ] Flatten gal took : 1206 ms
[2023-03-20 19:55:09] [INFO ] Applying decomposition
[2023-03-20 19:55:10] [INFO ] Flatten gal took : 1141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11901703418761695280.txt' '-o' '/tmp/graph11901703418761695280.bin' '-w' '/tmp/graph11901703418761695280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11901703418761695280.bin' '-l' '-1' '-v' '-w' '/tmp/graph11901703418761695280.weights' '-q' '0' '-e' '0.001'
[2023-03-20 19:55:13] [INFO ] Decomposing Gal with order
[2023-03-20 19:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 20:03:27] [INFO ] Removed a total of 54887 redundant transitions.
[2023-03-20 20:03:28] [INFO ] Flatten gal took : 2156 ms
[2023-03-20 20:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 52102 labels/synchronizations in 14503 ms.
[2023-03-20 20:03:46] [INFO ] Time to serialize gal into /tmp/LTL2704313709142874052.gal : 268 ms
[2023-03-20 20:03:46] [INFO ] Time to serialize properties into /tmp/LTL8102521548641937239.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2704313709142874052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8102521548641937239.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu5488.patient2344214>gu5488.dFactor6234444)")||(F("((gu8656.patient1342442<=gu8656.cFactor6343242)||(gi7858.gu8473.patient3...169
Formula 0 simplified : XF(!"(gu5488.patient2344214>gu5488.dFactor6234444)" & G!"((gu8656.patient1342442<=gu8656.cFactor6343242)||(gi7858.gu8473.patient311>...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9038792705360108548
[2023-03-20 20:04:02] [INFO ] Built C files in 367ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9038792705360108548
Running compilation step : cd /tmp/ltsmin9038792705360108548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9038792705360108548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9038792705360108548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 1141903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2240 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 20:04:15] [INFO ] Invariants computation overflowed in 8554 ms
[2023-03-20 20:04:18] [INFO ] Implicit Places using invariants in 10957 ms returned []
Implicit Place search using SMT only with invariants took 10967 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-20 20:04:26] [INFO ] Invariants computation overflowed in 8544 ms
[2023-03-20 20:04:29] [INFO ] Dead Transitions using invariants and state equation in 10866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24075 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s20393)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 28020 steps with 14010 reset in 10001 ms.
Product exploration timeout after 25510 steps with 12755 reset in 10001 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
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), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 finished in 192706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 145 are kept as prefixes of interest. Removing 32622 places using SCC suffix rule.23 ms
Discarding 32622 places :
Also discarding 48828 output transitions
Drop transitions removed 48828 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 144 transition count 270
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 102 place count 93 transition count 136
Iterating global reduction 1 with 51 rules applied. Total rules applied 153 place count 93 transition count 136
Graph (complete) has 54 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 92 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 92 transition count 134
Applied a total of 155 rules in 68 ms. Remains 92 /32767 variables (removed 32675) and now considering 134/49149 (removed 49015) transitions.
// Phase 1: matrix 134 rows 92 cols
[2023-03-20 20:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 20:07:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-20 20:07:17] [INFO ] Invariant cache hit.
[2023-03-20 20:07:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-20 20:07:17] [INFO ] Redundant transitions in 20 ms returned [8, 20, 24, 34, 41, 79, 95, 103, 109, 114, 117, 120, 128, 132]
Found 14 redundant transitions using SMT.
Drop transitions removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
// Phase 1: matrix 120 rows 92 cols
[2023-03-20 20:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 20:07:18] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/32767 places, 120/49149 transitions.
Graph (complete) has 53 edges and 92 vertex of which 78 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 2 ms. Remains 78 /92 variables (removed 14) and now considering 106/120 (removed 14) transitions.
// Phase 1: matrix 106 rows 78 cols
[2023-03-20 20:07:18] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 20:07:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 20:07:18] [INFO ] Invariant cache hit.
[2023-03-20 20:07:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/32767 places, 106/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 78/32767 places, 106/49149 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s25 s70), p0:(AND (LEQ s75 s19) (LEQ s46 s62) (LEQ s25 s70))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 104 are kept as prefixes of interest. Removing 32663 places using SCC suffix rule.20 ms
Discarding 32663 places :
Also discarding 48929 output transitions
Drop transitions removed 48929 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 103 transition count 187
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 72 place count 64 transition count 89
Iterating global reduction 1 with 39 rules applied. Total rules applied 111 place count 64 transition count 89
Graph (complete) has 36 edges and 64 vertex of which 62 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 62 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 62 transition count 86
Applied a total of 113 rules in 56 ms. Remains 62 /32767 variables (removed 32705) and now considering 86/49149 (removed 49063) transitions.
// Phase 1: matrix 86 rows 62 cols
[2023-03-20 20:07:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 20:07:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 20:07:18] [INFO ] Invariant cache hit.
[2023-03-20 20:07:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-20 20:07:18] [INFO ] Invariant cache hit.
[2023-03-20 20:07:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/32767 places, 86/49149 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 154 ms. Remains : 62/32767 places, 86/49149 transitions.
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s30 s37), p1:(OR (LEQ s55 s14) (LEQ 2 s47))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7654 steps with 169 reset in 14 ms.
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 375 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 20:07:20] [INFO ] Flatten gal took : 1505 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1851002 ms.

BK_STOP 1679342841491

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S04D1C1A06"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S04D1C1A06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912700601315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S04D1C1A06.tgz
mv ViralEpidemic-PT-S04D1C1A06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;