Execution Chart

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

Trace from the execution

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

--------------------
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 1679350959543

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 22:22:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:22:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:22:42] [INFO ] Load time of PNML (sax parser for PT used): 879 ms
[2023-03-20 22:22:42] [INFO ] Transformed 32765 places.
[2023-03-20 22:22:42] [INFO ] Transformed 40955 transitions.
[2023-03-20 22:22:42] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 1143 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 4933 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:22:58] [INFO ] Invariants computation overflowed in 10687 ms
[2023-03-20 22:23:01] [INFO ] Implicit Places using invariants in 13644 ms returned []
Implicit Place search using SMT only with invariants took 13671 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:23:12] [INFO ] Invariants computation overflowed in 11109 ms
[2023-03-20 22:23:15] [INFO ] Dead Transitions using invariants and state equation in 14107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32723 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 49 out of 32765 places after structural reductions.
[2023-03-20 22:23:17] [INFO ] Flatten gal took : 1384 ms
[2023-03-20 22:23:18] [INFO ] Flatten gal took : 1132 ms
[2023-03-20 22:23:20] [INFO ] Input system was already deterministic with 40955 transitions.
Incomplete random walk after 10000 steps, including 981 resets, run finished after 2939 ms. (steps per millisecond=3 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 323 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 246 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 227 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 234 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 231 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 228 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 230 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 351 ms. (steps per millisecond=2 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 281 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 268 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 272 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 268 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 273 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 233 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 236 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 237 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 278 ms. (steps per millisecond=3 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 226 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 235 ms. (steps per millisecond=4 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:23:39] [INFO ] Invariants computation overflowed in 9284 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: 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-20 22:24:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 22:24:04] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 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 260 are kept as prefixes of interest. Removing 32505 places using SCC suffix rule.34 ms
Discarding 32505 places :
Also discarding 40317 output transitions
Drop transitions removed 40317 transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 489 rules applied. Total rules applied 490 place count 260 transition count 149
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 595 place count 155 transition count 149
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 595 place count 155 transition count 126
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 641 place count 132 transition count 126
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 646 place count 127 transition count 121
Iterating global reduction 2 with 5 rules applied. Total rules applied 651 place count 127 transition count 121
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 693 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 105 transition count 99
Applied a total of 694 rules in 179 ms. Remains 105 /32765 variables (removed 32660) and now considering 99/40955 (removed 40856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 105/32765 places, 99/40955 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 24 properties in 3 ms. (steps per millisecond=17 )
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 5086 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:24:19] [INFO ] Invariants computation overflowed in 9404 ms
[2023-03-20 22:24:22] [INFO ] Implicit Places using invariants in 12048 ms returned []
Implicit Place search using SMT only with invariants took 12051 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:24:31] [INFO ] Invariants computation overflowed in 9043 ms
[2023-03-20 22:24:33] [INFO ] Dead Transitions using invariants and state equation in 11462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28605 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 225 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 20920 steps with 10460 reset in 10002 ms.
Product exploration timeout after 18810 steps with 9405 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 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 226 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 201327 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 3354 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:27:39] [INFO ] Invariants computation overflowed in 9459 ms
[2023-03-20 22:27:41] [INFO ] Implicit Places using invariants in 12039 ms returned []
Implicit Place search using SMT only with invariants took 12068 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:27:50] [INFO ] Invariants computation overflowed in 9007 ms
[2023-03-20 22:27:53] [INFO ] Dead Transitions using invariants and state equation in 11460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26906 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 172 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 15 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 finished in 27170 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.46 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 116 ms. Remains 76 /32765 variables (removed 32689) and now considering 105/40955 (removed 40850) transitions.
// Phase 1: matrix 105 rows 76 cols
[2023-03-20 22:27:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:27:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 22:27:53] [INFO ] Invariant cache hit.
[2023-03-20 22:27:53] [INFO ] Implicit Places using invariants and state equation in 70 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 136 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 20 ms. Remains 27 /58 variables (removed 31) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 27 cols
[2023-03-20 22:27:53] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-20 22:27:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 22:27:53] [INFO ] Invariant cache hit.
[2023-03-20 22:27:53] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 93 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 367 ms. Remains : 27/32765 places, 44/40955 transitions.
Stuttering acceptance computed with spot in 50 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 15 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 finished in 452 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 3668 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:28:06] [INFO ] Invariants computation overflowed in 9419 ms
[2023-03-20 22:28:09] [INFO ] Implicit Places using invariants in 11892 ms returned []
Implicit Place search using SMT only with invariants took 11909 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:28:18] [INFO ] Invariants computation overflowed in 8853 ms
[2023-03-20 22:28:20] [INFO ] Dead Transitions using invariants and state equation in 11304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26898 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 172 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 23 steps with 0 reset in 10 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 finished in 27172 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.45 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 92 ms. Remains 77 /32765 variables (removed 32688) and now considering 108/40955 (removed 40847) transitions.
// Phase 1: matrix 108 rows 77 cols
[2023-03-20 22:28:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 22:28:21] [INFO ] Invariant cache hit.
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants and state equation in 60 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 134 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 12 ms. Remains 46 /66 variables (removed 20) and now considering 73/99 (removed 26) transitions.
// Phase 1: matrix 73 rows 46 cols
[2023-03-20 22:28:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 22:28:21] [INFO ] Invariant cache hit.
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 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 311 ms. Remains : 46/32765 places, 73/40955 transitions.
Stuttering acceptance computed with spot in 202 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 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 finished in 559 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.19 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 52 ms. Remains 30 /32765 variables (removed 32735) and now considering 43/40955 (removed 40912) transitions.
// Phase 1: matrix 43 rows 30 cols
[2023-03-20 22:28:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 22:28:21] [INFO ] Invariant cache hit.
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants and state equation in 36 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 69 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 2 ms. Remains 19 /26 variables (removed 7) and now considering 30/39 (removed 9) transitions.
// Phase 1: matrix 30 rows 19 cols
[2023-03-20 22:28:21] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 22:28:21] [INFO ] Invariant cache hit.
[2023-03-20 22:28:21] [INFO ] Implicit Places using invariants and state equation in 28 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 : 19/32765 places, 30/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 19/32765 places, 30/40955 transitions.
Stuttering acceptance computed with spot in 74 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 276 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 3835 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:28:34] [INFO ] Invariants computation overflowed in 9088 ms
[2023-03-20 22:28:37] [INFO ] Implicit Places using invariants in 11528 ms returned []
Implicit Place search using SMT only with invariants took 11538 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:28:46] [INFO ] Invariants computation overflowed in 9370 ms
[2023-03-20 22:28:49] [INFO ] Dead Transitions using invariants and state equation in 11800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27200 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 220 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 3 steps with 0 reset in 6 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-08 finished in 27538 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 3631 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:29:01] [INFO ] Invariants computation overflowed in 8867 ms
[2023-03-20 22:29:04] [INFO ] Implicit Places using invariants in 11309 ms returned []
Implicit Place search using SMT only with invariants took 11311 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:29:13] [INFO ] Invariants computation overflowed in 9211 ms
[2023-03-20 22:29:16] [INFO ] Dead Transitions using invariants and state equation in 11648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26597 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 128 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 18750 steps with 9375 reset in 10004 ms.
Product exploration timeout after 17450 steps with 8725 reset in 10002 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 232 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 171827 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 3438 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:31:53] [INFO ] Invariants computation overflowed in 9243 ms
[2023-03-20 22:31:56] [INFO ] Implicit Places using invariants in 11774 ms returned []
Implicit Place search using SMT only with invariants took 11801 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:32:05] [INFO ] Invariants computation overflowed in 9217 ms
[2023-03-20 22:32:08] [INFO ] Dead Transitions using invariants and state equation in 11821 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27072 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 85 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]]
Entered a terminal (fully accepting) state of product in 10826 steps with 980 reset in 2413 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 finished in 29653 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 3146 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:32:23] [INFO ] Invariants computation overflowed in 8971 ms
[2023-03-20 22:32:25] [INFO ] Implicit Places using invariants in 11450 ms returned []
Implicit Place search using SMT only with invariants took 11455 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 22:32:34] [INFO ] Invariants computation overflowed in 9075 ms
[2023-03-20 22:32:37] [INFO ] Dead Transitions using invariants and state equation in 11565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26188 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 177 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 26730 steps with 6682 reset in 10004 ms.
Product exploration timeout after 23650 steps with 5912 reset in 10002 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 143 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 168602 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.22 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 50 ms. Remains 28 /32765 variables (removed 32737) and now considering 40/40955 (removed 40915) transitions.
// Phase 1: matrix 40 rows 28 cols
[2023-03-20 22:34:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 22:34:59] [INFO ] Invariant cache hit.
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants and state equation in 35 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 99 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.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 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 4 ms. Remains 17 /24 variables (removed 7) and now considering 26/36 (removed 10) transitions.
// Phase 1: matrix 26 rows 17 cols
[2023-03-20 22:34:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 22:34:59] [INFO ] Invariant cache hit.
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 57 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 210 ms. Remains : 17/32765 places, 26/40955 transitions.
Stuttering acceptance computed with spot in 72 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 315 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.23 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 52 ms. Remains 29 /32765 variables (removed 32736) and now considering 41/40955 (removed 40914) transitions.
// Phase 1: matrix 41 rows 29 cols
[2023-03-20 22:34:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 22:34:59] [INFO ] Invariant cache hit.
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants and state equation in 39 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 72 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 2 ms. Remains 15 /24 variables (removed 9) and now considering 25/36 (removed 11) transitions.
// Phase 1: matrix 25 rows 15 cols
[2023-03-20 22:34:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-20 22:34:59] [INFO ] Invariant cache hit.
[2023-03-20 22:34:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 55 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 182 ms. Remains : 15/32765 places, 25/40955 transitions.
Stuttering acceptance computed with spot in 28 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 11 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 finished in 238 ms.
All properties solved by simple procedures.
Total runtime 738711 ms.
ITS solved all properties within timeout

BK_STOP 1679351701297

--------------------
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ViralEpidemic-PT-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 r489-tall-167912707901252"
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 ;