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.r487-tall-167912704201252.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 lolaxred
Input is ViralEpidemic-PT-S02D1C1A12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912704201252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 11K Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 20:51 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 5.6K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 23:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 23:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 19M 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-S02D1C1A12-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679246370195

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:19:32] [INFO ] Load time of PNML (sax parser for PT used): 901 ms
[2023-03-19 17:19:32] [INFO ] Transformed 32765 places.
[2023-03-19 17:19:32] [INFO ] Transformed 40955 transitions.
[2023-03-19 17:19:32] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 1165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3956 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:19:50] [INFO ] Invariants computation overflowed in 12954 ms
[2023-03-19 17:19:53] [INFO ] Implicit Places using invariants in 16002 ms returned []
Implicit Place search using SMT only with invariants took 16025 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:20:03] [INFO ] Invariants computation overflowed in 10102 ms
[2023-03-19 17:20:05] [INFO ] Dead Transitions using invariants and state equation in 12785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32786 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 49 out of 32765 places after structural reductions.
[2023-03-19 17:20:07] [INFO ] Flatten gal took : 1268 ms
[2023-03-19 17:20:08] [INFO ] Flatten gal took : 1015 ms
[2023-03-19 17:20:10] [INFO ] Input system was already deterministic with 40955 transitions.
Incomplete random walk after 10000 steps, including 910 resets, run finished after 2961 ms. (steps per millisecond=3 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 223 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 222 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 226 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 226 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 222 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 299 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 229 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 223 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 225 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 224 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 228 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 233 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 226 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 298 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 225 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 219 ms. (steps per millisecond=4 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 42307 steps, run timeout after 24010 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 42307 steps, saw 40521 distinct states, run finished after 24012 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:20:56] [INFO ] Invariants computation overflowed in 13059 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 17:21:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:21:21] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 279 are kept as prefixes of interest. Removing 32486 places using SCC suffix rule.33 ms
Discarding 32486 places :
Also discarding 40272 output transitions
Drop transitions removed 40272 transitions
Drop transitions removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 520 rules applied. Total rules applied 521 place count 279 transition count 163
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 631 place count 169 transition count 163
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 631 place count 169 transition count 138
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 681 place count 144 transition count 138
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 686 place count 139 transition count 133
Iterating global reduction 2 with 5 rules applied. Total rules applied 691 place count 139 transition count 133
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 737 place count 116 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 115 transition count 109
Applied a total of 738 rules in 173 ms. Remains 115 /32765 variables (removed 32650) and now considering 109/40955 (removed 40846) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 115/32765 places, 109/40955 transitions.
Finished random walk after 64 steps, including 0 resets, run visited all 26 properties in 5 ms. (steps per millisecond=12 )
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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' '!(F((X(p0)||G(p1))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3833 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:21:35] [INFO ] Invariants computation overflowed in 9588 ms
[2023-03-19 17:21:38] [INFO ] Implicit Places using invariants in 12238 ms returned []
Implicit Place search using SMT only with invariants took 12244 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:21:49] [INFO ] Invariants computation overflowed in 11324 ms
[2023-03-19 17:21:52] [INFO ] Dead Transitions using invariants and state equation in 14018 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30104 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s30351 1) (GEQ s30356 1)), p0:(OR (AND (GEQ s30351 1) (GEQ s30356 1)) (LT s26274 1) (LT s26279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 24380 steps with 12190 reset in 10004 ms.
Product exploration timeout after 21820 steps with 10910 reset in 10001 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-00 finished in 183984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(p1) U (G(p1)&&p2))))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3365 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:24:39] [INFO ] Invariants computation overflowed in 9986 ms
[2023-03-19 17:24:42] [INFO ] Implicit Places using invariants in 12438 ms returned []
Implicit Place search using SMT only with invariants took 12441 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:24:53] [INFO ] Invariants computation overflowed in 11580 ms
[2023-03-19 17:24:56] [INFO ] Dead Transitions using invariants and state equation in 14318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30145 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8234 1) (GEQ s8237 1)), p2:(AND (GEQ s5711 1) (GEQ s5717 1)), p1:(AND (GEQ s5711 1) (GEQ s5717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 12 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 finished in 30404 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 102 are kept as prefixes of interest. Removing 32663 places using SCC suffix rule.48 ms
Discarding 32663 places :
Also discarding 40799 output transitions
Drop transitions removed 40799 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 76 transition count 105
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 76 transition count 105
Applied a total of 51 rules in 138 ms. Remains 76 /32765 variables (removed 32689) and now considering 105/40955 (removed 40850) transitions.
// Phase 1: matrix 105 rows 76 cols
[2023-03-19 17:24:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:24:57] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-19 17:24:57] [INFO ] Invariant cache hit.
[2023-03-19 17:24:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [0, 2, 4, 6, 8, 10, 12, 16, 18, 34, 36, 42, 46, 48, 57, 61, 63, 65]
Discarding 18 places :
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Implicit Place search using SMT with State Equation took 475 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/32765 places, 88/40955 transitions.
Graph (complete) has 45 edges and 58 vertex of which 42 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 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 29 transition count 59
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 29 transition count 52
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 38 place count 27 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 27 transition count 51
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 27 transition count 45
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 27 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 27 transition count 44
Applied a total of 49 rules in 9 ms. Remains 27 /58 variables (removed 31) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 27 cols
[2023-03-19 17:24:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:24:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 17:24:57] [INFO ] Invariant cache hit.
[2023-03-19 17:24:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/32765 places, 44/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 667 ms. Remains : 27/32765 places, 44/40955 transitions.
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s23 1) (GEQ s26 1))) (NOT (AND (GEQ s5 1) (GEQ s6 1)))), p0:(GEQ s17 1), p1:(AND (GEQ s23 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((X(p0)||F(p1)))) U p2)))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4324 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:25:12] [INFO ] Invariants computation overflowed in 10278 ms
[2023-03-19 17:25:14] [INFO ] Implicit Places using invariants in 12958 ms returned []
Implicit Place search using SMT only with invariants took 12962 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:25:25] [INFO ] Invariants computation overflowed in 10462 ms
[2023-03-19 17:25:27] [INFO ] Dead Transitions using invariants and state equation in 13058 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30351 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s12472 1) (GEQ s12494 1)), p1:(AND (GEQ s30031 1) (GEQ s30044 1)), p0:(AND (GEQ s16929 1) (GEQ s16933 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 finished in 30646 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((X(F(p0)) U (!p1&&(F(p0) U p2))))))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 106 are kept as prefixes of interest. Removing 32659 places using SCC suffix rule.28 ms
Discarding 32659 places :
Also discarding 40791 output transitions
Drop transitions removed 40791 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 78 transition count 109
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 78 transition count 109
Graph (complete) has 43 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 56 place count 77 transition count 108
Applied a total of 56 rules in 77 ms. Remains 77 /32765 variables (removed 32688) and now considering 108/40955 (removed 40847) transitions.
// Phase 1: matrix 108 rows 77 cols
[2023-03-19 17:25:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 17:25:28] [INFO ] Invariant cache hit.
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [0, 2, 4, 6, 14, 16, 29, 45, 47, 58, 62]
Discarding 11 places :
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Implicit Place search using SMT with State Equation took 94 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/32765 places, 99/40955 transitions.
Graph (complete) has 42 edges and 66 vertex of which 57 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
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 47 transition count 80
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 47 transition count 75
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 28 place count 46 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 46 transition count 74
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 46 transition count 73
Applied a total of 30 rules in 6 ms. Remains 46 /66 variables (removed 20) and now considering 73/99 (removed 26) transitions.
// Phase 1: matrix 73 rows 46 cols
[2023-03-19 17:25:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 17:25:28] [INFO ] Invariant cache hit.
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/32765 places, 73/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 46/32765 places, 73/40955 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s14 1)), p2:(AND (GEQ s40 1) (GEQ s42 1)), p0:(AND (GEQ s24 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 finished in 470 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(F(p0)))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 42 are kept as prefixes of interest. Removing 32723 places using SCC suffix rule.21 ms
Discarding 32723 places :
Also discarding 40889 output transitions
Drop transitions removed 40889 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 30 transition count 43
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 30 transition count 43
Applied a total of 23 rules in 56 ms. Remains 30 /32765 variables (removed 32735) and now considering 43/40955 (removed 40912) transitions.
// Phase 1: matrix 43 rows 30 cols
[2023-03-19 17:25:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 17:25:28] [INFO ] Invariant cache hit.
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned [0, 2, 4, 19]
Discarding 4 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 62 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/32765 places, 39/40955 transitions.
Graph (complete) has 15 edges and 26 vertex of which 22 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 19 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 9 place count 19 transition count 30
Applied a total of 9 rules in 0 ms. Remains 19 /26 variables (removed 7) and now considering 30/39 (removed 9) transitions.
// Phase 1: matrix 30 rows 19 cols
[2023-03-19 17:25:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 17:25:28] [INFO ] Invariant cache hit.
[2023-03-19 17:25:28] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/32765 places, 30/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 19/32765 places, 30/40955 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-07 finished in 291 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((F(G(p1))&&p0)))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3450 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:25:44] [INFO ] Invariants computation overflowed in 11675 ms
[2023-03-19 17:25:46] [INFO ] Implicit Places using invariants in 14418 ms returned []
Implicit Place search using SMT only with invariants took 14425 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:25:56] [INFO ] Invariants computation overflowed in 9662 ms
[2023-03-19 17:25:59] [INFO ] Dead Transitions using invariants and state equation in 12366 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30257 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s11703 1) (GEQ s11724 1)), p1:(AND (GEQ s23904 1) (GEQ s23906 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 15 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-08 finished in 30572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((p1&&X(G(!p0))))))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3509 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:26:13] [INFO ] Invariants computation overflowed in 9964 ms
[2023-03-19 17:26:15] [INFO ] Implicit Places using invariants in 12379 ms returned []
Implicit Place search using SMT only with invariants took 12389 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:26:25] [INFO ] Invariants computation overflowed in 10065 ms
[2023-03-19 17:26:27] [INFO ] Dead Transitions using invariants and state equation in 12518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28423 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s21330 1), p1:(GEQ s10492 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 timeout after 23460 steps with 11730 reset in 10004 ms.
Product exploration timeout after 20530 steps with 10265 reset in 10001 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-10 finished in 185027 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 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4000 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:29:19] [INFO ] Invariants computation overflowed in 10559 ms
[2023-03-19 17:29:21] [INFO ] Implicit Places using invariants in 12996 ms returned []
Implicit Place search using SMT only with invariants took 12998 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:29:32] [INFO ] Invariants computation overflowed in 11151 ms
[2023-03-19 17:29:35] [INFO ] Dead Transitions using invariants and state equation in 13904 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30907 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 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:(LT s4853 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]]
Product exploration timeout after 37830 steps with 3653 reset in 10002 ms.
Product exploration timeout after 29300 steps with 2790 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 968 resets, run finished after 2564 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 2149 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23740 steps, run timeout after 12005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23740 steps, saw 22841 distinct states, run finished after 12005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:32:41] [INFO ] Invariants computation overflowed in 11162 ms
[2023-03-19 17:33:06] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 13 are kept as prefixes of interest. Removing 32752 places using SCC suffix rule.9 ms
Discarding 32752 places :
Also discarding 40922 output transitions
Drop transitions removed 40922 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 13 transition count 5
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 37 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 37 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 3
Applied a total of 41 rules in 44 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 3/32765 places, 3/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4036 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:33:25] [INFO ] Invariants computation overflowed in 13988 ms
[2023-03-19 17:33:28] [INFO ] Implicit Places using invariants in 16627 ms returned []
Implicit Place search using SMT only with invariants took 16630 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:33:38] [INFO ] Invariants computation overflowed in 10774 ms
[2023-03-19 17:33:41] [INFO ] Dead Transitions using invariants and state equation in 13552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34225 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 944 resets, run finished after 2598 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 2220 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23211 steps, run timeout after 12012 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23211 steps, saw 22338 distinct states, run finished after 12014 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:36:07] [INFO ] Invariants computation overflowed in 11441 ms
[2023-03-19 17:36:32] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 13 are kept as prefixes of interest. Removing 32752 places using SCC suffix rule.9 ms
Discarding 32752 places :
Also discarding 40922 output transitions
Drop transitions removed 40922 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 13 transition count 5
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 37 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 37 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 3
Applied a total of 41 rules in 36 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 3/32765 places, 3/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 7605 steps with 734 reset in 1820 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 finished in 450262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X((X(p1)||F(p2))))))))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3915 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:36:48] [INFO ] Invariants computation overflowed in 10147 ms
[2023-03-19 17:36:51] [INFO ] Implicit Places using invariants in 12882 ms returned []
Implicit Place search using SMT only with invariants took 12883 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:37:01] [INFO ] Invariants computation overflowed in 9646 ms
[2023-03-19 17:37:03] [INFO ] Dead Transitions using invariants and state equation in 12256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29060 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s15224 1) (GEQ s15245 1)), p2:(OR (LT s14739 1) (LT s14742 1)), p1:(AND (GEQ s3250 1) (GEQ s3259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 29530 steps with 7382 reset in 10003 ms.
Product exploration timeout after 24170 steps with 6042 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-12 finished in 194254 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(F(p0)))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 40 are kept as prefixes of interest. Removing 32725 places using SCC suffix rule.16 ms
Discarding 32725 places :
Also discarding 40893 output transitions
Drop transitions removed 40893 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 29 transition count 41
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 29 transition count 41
Graph (complete) has 16 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 28 transition count 40
Applied a total of 22 rules in 56 ms. Remains 28 /32765 variables (removed 32737) and now considering 40/40955 (removed 40915) transitions.
// Phase 1: matrix 40 rows 28 cols
[2023-03-19 17:39:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 17:39:49] [INFO ] Invariant cache hit.
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [6, 8, 12, 16]
Discarding 4 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 90 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32765 places, 36/40955 transitions.
Graph (complete) has 15 edges and 24 vertex of which 20 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 17 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 17 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 17 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 17 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 17 transition count 26
Applied a total of 11 rules in 2 ms. Remains 17 /24 variables (removed 7) and now considering 26/36 (removed 10) transitions.
// Phase 1: matrix 26 rows 17 cols
[2023-03-19 17:39:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 17:39:49] [INFO ] Invariant cache hit.
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32765 places, 26/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 17/32765 places, 26/40955 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-13 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 41 are kept as prefixes of interest. Removing 32724 places using SCC suffix rule.17 ms
Discarding 32724 places :
Also discarding 40892 output transitions
Drop transitions removed 40892 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 30 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 30 transition count 42
Graph (complete) has 16 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 29 transition count 41
Applied a total of 22 rules in 45 ms. Remains 29 /32765 variables (removed 32736) and now considering 41/40955 (removed 40914) transitions.
// Phase 1: matrix 41 rows 29 cols
[2023-03-19 17:39:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 17:39:49] [INFO ] Invariant cache hit.
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [0, 6, 22, 24, 26]
Discarding 5 places :
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 69 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32765 places, 36/40955 transitions.
Graph (complete) has 15 edges and 24 vertex of which 19 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 15 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 15 transition count 25
Applied a total of 11 rules in 4 ms. Remains 15 /24 variables (removed 9) and now considering 25/36 (removed 11) transitions.
// Phase 1: matrix 25 rows 15 cols
[2023-03-19 17:39:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-19 17:39:49] [INFO ] Invariant cache hit.
[2023-03-19 17:39:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32765 places, 25/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 15/32765 places, 25/40955 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 finished in 226 ms.
All properties solved by simple procedures.
Total runtime 1217974 ms.
ITS solved all properties within timeout

BK_STOP 1679247591074

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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-S02D1C1A12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ViralEpidemic-PT-S02D1C1A12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912704201252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S02D1C1A12.tgz
mv ViralEpidemic-PT-S02D1C1A12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;