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.r489-tall-167912707901243.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 ltsminxred
Input is ViralEpidemic-PT-S02D1C1A10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707901243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 11K Feb 25 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 20:34 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.7K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 21:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 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 8.8M 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-S02D1C1A10-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679350348937

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 22:12:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:12:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:12:30] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2023-03-20 22:12:30] [INFO ] Transformed 8189 places.
[2023-03-20 22:12:31] [INFO ] Transformed 10235 transitions.
[2023-03-20 22:12:31] [INFO ] Found NUPN structural information;
[2023-03-20 22:12:31] [INFO ] Parsed PT model containing 8189 places and 10235 transitions and 22517 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 8189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8189/8189 places, 10235/10235 transitions.
Discarding 3046 places :
Symmetric choice reduction at 0 with 3046 rule applications. Total rules 3046 place count 5143 transition count 5149
Iterating global reduction 0 with 3046 rules applied. Total rules applied 6092 place count 5143 transition count 5149
Applied a total of 6092 rules in 2250 ms. Remains 5143 /8189 variables (removed 3046) and now considering 5149/10235 (removed 5086) transitions.
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 22:12:33] [INFO ] Invariants computation overflowed in 491 ms
[2023-03-20 22:12:36] [INFO ] Implicit Places using invariants in 2868 ms returned []
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 22:12:36] [INFO ] Invariants computation overflowed in 290 ms
[2023-03-20 22:12:37] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 4080 ms to find 0 implicit places.
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 22:12:37] [INFO ] Invariants computation overflowed in 174 ms
[2023-03-20 22:12:40] [INFO ] Dead Transitions using invariants and state equation in 3297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5143/8189 places, 5149/10235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9640 ms. Remains : 5143/8189 places, 5149/10235 transitions.
Support contains 28 out of 5143 places after structural reductions.
[2023-03-20 22:12:41] [INFO ] Flatten gal took : 312 ms
[2023-03-20 22:12:41] [INFO ] Flatten gal took : 226 ms
[2023-03-20 22:12:42] [INFO ] Input system was already deterministic with 5149 transitions.
Incomplete random walk after 10000 steps, including 392 resets, run finished after 703 ms. (steps per millisecond=14 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 22:12:45] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-20 22:12:46] [INFO ] After 1225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 22:12:52] [INFO ] After 4092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 22:12:54] [INFO ] After 6160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1130 ms.
[2023-03-20 22:12:55] [INFO ] After 8831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 462 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=23 )
Parikh walk visited 8 properties in 318 ms.
Computed a total of 5143 stabilizing places and 5149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5143 transition count 5149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5120 transition count 5120
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5120 transition count 5120
Applied a total of 46 rules in 950 ms. Remains 5120 /5143 variables (removed 23) and now considering 5120/5149 (removed 29) transitions.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:12:57] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-20 22:12:59] [INFO ] Implicit Places using invariants in 2505 ms returned []
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:12:59] [INFO ] Invariants computation overflowed in 184 ms
[2023-03-20 22:13:00] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 3716 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 22:13:01] [INFO ] Invariants computation overflowed in 180 ms
[2023-03-20 22:13:04] [INFO ] Dead Transitions using invariants and state equation in 3575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5120/5143 places, 5120/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8244 ms. Remains : 5120/5143 places, 5120/5149 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00 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: 2}]], initial=3, aps=[p0:(AND (EQ s2674 0) (EQ s1408 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 383 steps with 16 reset in 17 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00 finished in 8567 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(X(X(G((p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 5123 transition count 5123
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 5123 transition count 5123
Applied a total of 40 rules in 903 ms. Remains 5123 /5143 variables (removed 20) and now considering 5123/5149 (removed 26) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:13:05] [INFO ] Invariants computation overflowed in 188 ms
[2023-03-20 22:13:08] [INFO ] Implicit Places using invariants in 2269 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:13:08] [INFO ] Invariants computation overflowed in 181 ms
[2023-03-20 22:13:09] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 3355 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:13:09] [INFO ] Invariants computation overflowed in 188 ms
[2023-03-20 22:13:12] [INFO ] Dead Transitions using invariants and state equation in 3414 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5123/5143 places, 5123/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7676 ms. Remains : 5123/5143 places, 5123/5149 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s1030 1), p2:(AND (NOT (OR (EQ s3720 0) (EQ s113 1))) (NOT (OR (EQ s115 0) (EQ s5111 1)))), p1:(OR (EQ s115 0) (EQ s5111 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03 finished in 7899 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(X(X(F(p0)))))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5121 transition count 5120
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5121 transition count 5120
Applied a total of 44 rules in 902 ms. Remains 5121 /5143 variables (removed 22) and now considering 5120/5149 (removed 29) transitions.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 22:13:13] [INFO ] Invariants computation overflowed in 179 ms
[2023-03-20 22:13:15] [INFO ] Implicit Places using invariants in 2315 ms returned []
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 22:13:16] [INFO ] Invariants computation overflowed in 174 ms
[2023-03-20 22:13:17] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 22:13:17] [INFO ] Invariants computation overflowed in 171 ms
[2023-03-20 22:13:20] [INFO ] Dead Transitions using invariants and state equation in 3403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5143 places, 5120/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7686 ms. Remains : 5121/5143 places, 5120/5149 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2751 0) (NEQ s5093 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 5 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04 finished in 7872 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 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5121 transition count 5121
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5121 transition count 5121
Applied a total of 44 rules in 894 ms. Remains 5121 /5143 variables (removed 22) and now considering 5121/5149 (removed 28) transitions.
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 22:13:21] [INFO ] Invariants computation overflowed in 174 ms
[2023-03-20 22:13:23] [INFO ] Implicit Places using invariants in 2280 ms returned []
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 22:13:23] [INFO ] Invariants computation overflowed in 175 ms
[2023-03-20 22:13:24] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 3346 ms to find 0 implicit places.
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 22:13:25] [INFO ] Invariants computation overflowed in 178 ms
[2023-03-20 22:13:28] [INFO ] Dead Transitions using invariants and state equation in 3306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5143 places, 5121/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7547 ms. Remains : 5121/5143 places, 5121/5149 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06 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:(AND (EQ s5067 0) (EQ s3687 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06 finished in 7655 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(X(F(p0))))'
Support contains 1 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5120 transition count 5119
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5120 transition count 5119
Applied a total of 46 rules in 905 ms. Remains 5120 /5143 variables (removed 23) and now considering 5119/5149 (removed 30) transitions.
// Phase 1: matrix 5119 rows 5120 cols
[2023-03-20 22:13:29] [INFO ] Invariants computation overflowed in 183 ms
[2023-03-20 22:13:31] [INFO ] Implicit Places using invariants in 2423 ms returned []
// Phase 1: matrix 5119 rows 5120 cols
[2023-03-20 22:13:31] [INFO ] Invariants computation overflowed in 175 ms
[2023-03-20 22:13:32] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 3526 ms to find 0 implicit places.
// Phase 1: matrix 5119 rows 5120 cols
[2023-03-20 22:13:32] [INFO ] Invariants computation overflowed in 189 ms
[2023-03-20 22:13:36] [INFO ] Dead Transitions using invariants and state equation in 3319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5120/5143 places, 5119/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7753 ms. Remains : 5120/5143 places, 5119/5149 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07 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}]], initial=2, aps=[p0:(EQ s665 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4771 ms.
Product exploration explored 100000 steps with 33333 reset in 5489 ms.
Computed a total of 5120 stabilizing places and 5119 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 5119
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 73 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-S02D1C1A10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07 finished in 20113 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(p1))))'
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 96 are kept as prefixes of interest. Removing 5047 places using SCC suffix rule.18 ms
Discarding 5047 places :
Also discarding 5020 output transitions
Drop transitions removed 5020 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 93 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 93 transition count 123
Applied a total of 5 rules in 38 ms. Remains 93 /5143 variables (removed 5050) and now considering 123/5149 (removed 5026) transitions.
// Phase 1: matrix 123 rows 93 cols
[2023-03-20 22:13:48] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-20 22:13:48] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 22:13:48] [INFO ] Invariant cache hit.
[2023-03-20 22:13:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [0, 2, 10, 31, 33, 35, 37, 39, 47, 53, 55, 57, 63, 70, 72, 76, 78]
Discarding 17 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 95 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/5143 places, 111/5149 transitions.
Graph (complete) has 52 edges and 76 vertex of which 62 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
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 49 transition count 84
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 34 place count 49 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 47 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 47 transition count 77
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 47 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 47 transition count 72
Applied a total of 47 rules in 18 ms. Remains 47 /76 variables (removed 29) and now considering 72/111 (removed 39) transitions.
// Phase 1: matrix 72 rows 47 cols
[2023-03-20 22:13:48] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:13:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 22:13:48] [INFO ] Invariant cache hit.
[2023-03-20 22:13:48] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/5143 places, 72/5149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 47/5143 places, 72/5149 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s19 1)), p1:(OR (EQ s35 0) (EQ s26 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2300 reset in 248 ms.
Product exploration explored 100000 steps with 2303 reset in 235 ms.
Computed a total of 47 stabilizing places and 72 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 72
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 11 factoid took 274 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09 finished in 1140 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((G(p0) U p1))))'
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 73 are kept as prefixes of interest. Removing 5070 places using SCC suffix rule.12 ms
Discarding 5070 places :
Also discarding 5049 output transitions
Drop transitions removed 5049 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 70 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 70 transition count 93
Applied a total of 5 rules in 27 ms. Remains 70 /5143 variables (removed 5073) and now considering 93/5149 (removed 5056) transitions.
// Phase 1: matrix 93 rows 70 cols
[2023-03-20 22:13:49] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:13:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 22:13:49] [INFO ] Invariant cache hit.
[2023-03-20 22:13:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [0, 2, 12, 20, 22, 24, 28, 30, 32, 44, 51, 57, 61, 63]
Discarding 14 places :
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 84 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/5143 places, 82/5149 transitions.
Graph (complete) has 39 edges and 56 vertex of which 45 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 35 transition count 61
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 26 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 33 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 33 transition count 55
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 33 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 33 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 33 transition count 52
Applied a total of 35 rules in 11 ms. Remains 33 /56 variables (removed 23) and now considering 52/82 (removed 30) transitions.
// Phase 1: matrix 52 rows 33 cols
[2023-03-20 22:13:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:13:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 22:13:49] [INFO ] Invariant cache hit.
[2023-03-20 22:13:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/5143 places, 52/5149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 33/5143 places, 52/5149 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s32 0) (EQ s22 1)), p0:(OR (EQ s16 0) (EQ s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3565 reset in 168 ms.
Product exploration explored 100000 steps with 3568 reset in 157 ms.
Computed a total of 33 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 transition count 52
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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 13 factoid took 359 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11 finished in 1021 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)))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 39 are kept as prefixes of interest. Removing 5104 places using SCC suffix rule.9 ms
Discarding 5104 places :
Also discarding 5097 output transitions
Drop transitions removed 5097 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 22 ms. Remains 38 /5143 variables (removed 5105) and now considering 51/5149 (removed 5098) transitions.
// Phase 1: matrix 51 rows 38 cols
[2023-03-20 22:13:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:13:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-20 22:13:50] [INFO ] Invariant cache hit.
[2023-03-20 22:13:50] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [13, 15, 17, 26, 28, 30, 32, 36]
Discarding 8 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 78 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/5143 places, 44/5149 transitions.
Graph (complete) has 22 edges and 30 vertex of which 23 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 18 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 18 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 17 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 17 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 17 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 17 transition count 28
Applied a total of 18 rules in 4 ms. Remains 17 /30 variables (removed 13) and now considering 28/44 (removed 16) transitions.
// Phase 1: matrix 28 rows 17 cols
[2023-03-20 22:13:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:13:50] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-20 22:13:50] [INFO ] Invariant cache hit.
[2023-03-20 22:13:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/5143 places, 28/5149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 17/5143 places, 28/5149 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5887 reset in 71 ms.
Product exploration explored 100000 steps with 5892 reset in 77 ms.
Computed a total of 17 stabilizing places and 28 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 28
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 117 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-S02D1C1A10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12 finished in 493 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)))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5121 transition count 5120
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5121 transition count 5120
Applied a total of 44 rules in 862 ms. Remains 5121 /5143 variables (removed 22) and now considering 5120/5149 (removed 29) transitions.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 22:13:52] [INFO ] Invariants computation overflowed in 178 ms
[2023-03-20 22:13:54] [INFO ] Implicit Places using invariants in 2163 ms returned []
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 22:13:54] [INFO ] Invariants computation overflowed in 165 ms
[2023-03-20 22:13:55] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 3161 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 22:13:55] [INFO ] Invariants computation overflowed in 172 ms
[2023-03-20 22:13:58] [INFO ] Dead Transitions using invariants and state equation in 3071 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5143 places, 5120/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7096 ms. Remains : 5121/5143 places, 5120/5149 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s3000 0) (EQ s2176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 35521 steps with 1443 reset in 1105 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14 finished in 8301 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' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 5123 transition count 5123
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 5123 transition count 5123
Applied a total of 40 rules in 854 ms. Remains 5123 /5143 variables (removed 20) and now considering 5123/5149 (removed 26) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:00] [INFO ] Invariants computation overflowed in 172 ms
[2023-03-20 22:14:02] [INFO ] Implicit Places using invariants in 2240 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:02] [INFO ] Invariants computation overflowed in 163 ms
[2023-03-20 22:14:03] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 3258 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:03] [INFO ] Invariants computation overflowed in 166 ms
[2023-03-20 22:14:06] [INFO ] Dead Transitions using invariants and state equation in 3301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5123/5143 places, 5123/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7416 ms. Remains : 5123/5143 places, 5123/5149 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(OR (EQ s1689 0) (EQ s4384 1)), p0:(OR (EQ s240 0) (EQ s2469 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4511 ms.
Product exploration explored 100000 steps with 25000 reset in 5402 ms.
Computed a total of 5123 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5123 transition count 5123
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 p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 440 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:20] [INFO ] Invariants computation overflowed in 182 ms
[2023-03-20 22:14:20] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:14:24] [INFO ] After 2876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:14:24] [INFO ] After 3138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-20 22:14:24] [INFO ] After 3863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 459 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5123/5123 places, 5123/5123 transitions.
Applied a total of 0 rules in 431 ms. Remains 5123 /5123 variables (removed 0) and now considering 5123/5123 (removed 0) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:25] [INFO ] Invariants computation overflowed in 169 ms
[2023-03-20 22:14:28] [INFO ] Implicit Places using invariants in 2380 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:28] [INFO ] Invariants computation overflowed in 176 ms
[2023-03-20 22:14:29] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 3443 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:29] [INFO ] Invariants computation overflowed in 172 ms
[2023-03-20 22:14:32] [INFO ] Dead Transitions using invariants and state equation in 3170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7048 ms. Remains : 5123/5123 places, 5123/5123 transitions.
Computed a total of 5123 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5123 transition count 5123
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 p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 378 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:35] [INFO ] Invariants computation overflowed in 187 ms
[2023-03-20 22:14:36] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:14:39] [INFO ] After 2851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:14:39] [INFO ] After 3105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-20 22:14:39] [INFO ] After 3780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 330 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 4491 ms.
Product exploration explored 100000 steps with 25000 reset in 5459 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5123/5123 places, 5123/5123 transitions.
Graph (complete) has 3073 edges and 5123 vertex of which 90 are kept as prefixes of interest. Removing 5033 places using SCC suffix rule.18 ms
Discarding 5033 places :
Also discarding 5004 output transitions
Drop transitions removed 5004 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 89 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 116
Applied a total of 3 rules in 51 ms. Remains 89 /5123 variables (removed 5034) and now considering 116/5123 (removed 5007) transitions.
[2023-03-20 22:14:50] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2023-03-20 22:14:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:14:51] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/5123 places, 116/5123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 89/5123 places, 116/5123 transitions.
Support contains 4 out of 5123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5123/5123 places, 5123/5123 transitions.
Applied a total of 0 rules in 845 ms. Remains 5123 /5123 variables (removed 0) and now considering 5123/5123 (removed 0) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:52] [INFO ] Invariants computation overflowed in 173 ms
[2023-03-20 22:14:54] [INFO ] Implicit Places using invariants in 2406 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:54] [INFO ] Invariants computation overflowed in 171 ms
[2023-03-20 22:14:55] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 22:14:55] [INFO ] Invariants computation overflowed in 178 ms
[2023-03-20 22:14:58] [INFO ] Dead Transitions using invariants and state equation in 3391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7690 ms. Remains : 5123/5123 places, 5123/5123 transitions.
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 finished in 59725 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' '!((G(p0)||X(X(X(F(p1))))))'
Found a Shortening insensitive property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 90 are kept as prefixes of interest. Removing 5053 places using SCC suffix rule.9 ms
Discarding 5053 places :
Also discarding 5030 output transitions
Drop transitions removed 5030 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 88 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 88 transition count 115
Applied a total of 3 rules in 31 ms. Remains 88 /5143 variables (removed 5055) and now considering 115/5149 (removed 5034) transitions.
// Phase 1: matrix 115 rows 88 cols
[2023-03-20 22:14:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:14:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 22:14:59] [INFO ] Invariant cache hit.
[2023-03-20 22:14:59] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [0, 2, 4, 6, 8, 12, 16, 20, 28, 32, 34, 54, 56, 58, 60, 68, 70, 80]
Discarding 18 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 126 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/5143 places, 102/5149 transitions.
Graph (complete) has 50 edges and 70 vertex of which 55 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 41 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 36 place count 41 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 39 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 39 transition count 66
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 39 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 39 transition count 65
Applied a total of 45 rules in 6 ms. Remains 39 /70 variables (removed 31) and now considering 65/102 (removed 37) transitions.
// Phase 1: matrix 65 rows 39 cols
[2023-03-20 22:14:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:14:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 22:14:59] [INFO ] Invariant cache hit.
[2023-03-20 22:14:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/5143 places, 65/5149 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 233 ms. Remains : 39/5143 places, 65/5149 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(OR (EQ s16 0) (EQ s36 1)), p0:(OR (EQ s7 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 170 ms.
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Computed a total of 39 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 65
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 p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 207 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 22:15:00] [INFO ] Invariant cache hit.
[2023-03-20 22:15:00] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:15:00] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:15:00] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 22:15:00] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-20 22:15:01] [INFO ] Invariant cache hit.
[2023-03-20 22:15:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 22:15:01] [INFO ] Invariant cache hit.
[2023-03-20 22:15:01] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-20 22:15:01] [INFO ] Invariant cache hit.
[2023-03-20 22:15:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 39/39 places, 65/65 transitions.
Computed a total of 39 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 65
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 p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 205 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 22:15:01] [INFO ] Invariant cache hit.
[2023-03-20 22:15:01] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:15:01] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:15:01] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 22:15:01] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 65/65 transitions.
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 39 transition count 60
Applied a total of 5 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 60/65 (removed 5) transitions.
[2023-03-20 22:15:03] [INFO ] Redundant transitions in 14 ms returned [3, 9, 28, 41]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 56 rows 39 cols
[2023-03-20 22:15:03] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:15:03] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 56/65 transitions.
Graph (complete) has 19 edges and 39 vertex of which 35 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
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 35 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 35 transition count 57
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 35 transition count 55
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 3 ms. Remains 35 /39 variables (removed 4) and now considering 55/56 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/39 places, 55/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 35/39 places, 55/65 transitions.
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 39 cols
[2023-03-20 22:15:03] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:15:03] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 22:15:03] [INFO ] Invariant cache hit.
[2023-03-20 22:15:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-20 22:15:03] [INFO ] Invariant cache hit.
[2023-03-20 22:15:03] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 39/39 places, 65/65 transitions.
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 finished in 4270 ms.
[2023-03-20 22:15:03] [INFO ] Flatten gal took : 138 ms
[2023-03-20 22:15:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 22:15:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5143 places, 5149 transitions and 11335 arcs took 29 ms.
Total runtime 153087 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1482/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15

BK_STOP 1679350509805

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15
ltl formula formula --ltl=/tmp/1482/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5143 places, 5149 transitions and 11335 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1482/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1482/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1482/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.060 real 0.180 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1482/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-S02D1C1A10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ViralEpidemic-PT-S02D1C1A10, 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 r489-tall-167912707901243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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