About the Execution of ITS-Tools for ViralEpidemic-PT-S03D1C1A08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16115.283 | 3600000.00 | 4165082.00 | 38156.90 | TTFTTFFT?TTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r485-tall-167912700501283.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700501283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 8.4K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 21:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 23:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29M 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-S03D1C1A08-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679336553102
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S03D1C1A08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 18:22:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 18:22:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:22:35] [INFO ] Load time of PNML (sax parser for PT used): 1214 ms
[2023-03-20 18:22:35] [INFO ] Transformed 49206 places.
[2023-03-20 18:22:36] [INFO ] Transformed 68887 transitions.
[2023-03-20 18:22:36] [INFO ] Parsed PT model containing 49206 places and 68887 transitions and 157456 arcs in 1544 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 416 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:23:04] [INFO ] Invariants computation overflowed in 27351 ms
[2023-03-20 18:23:08] [INFO ] Implicit Places using invariants in 31096 ms returned []
Implicit Place search using SMT only with invariants took 31127 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:23:33] [INFO ] Invariants computation overflowed in 25132 ms
[2023-03-20 18:23:36] [INFO ] Dead Transitions using invariants and state equation in 28716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60278 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Support contains 38 out of 49206 places after structural reductions.
[2023-03-20 18:23:39] [INFO ] Flatten gal took : 1985 ms
[2023-03-20 18:23:41] [INFO ] Flatten gal took : 1722 ms
[2023-03-20 18:23:44] [INFO ] Input system was already deterministic with 68887 transitions.
Support contains 36 out of 49206 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 3470 ms. (steps per millisecond=2 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 234 ms. (steps per millisecond=4 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 38886 steps, run timeout after 24010 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 38886 steps, saw 37786 distinct states, run finished after 24012 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:24:42] [INFO ] Invariants computation overflowed in 25720 ms
[2023-03-20 18:25:04] [INFO ] After 21394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
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:350)
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 18:25:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 18:25:29] [INFO ] After 25292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 303 are kept as prefixes of interest. Removing 48903 places using SCC suffix rule.57 ms
Discarding 48903 places :
Also discarding 68108 output transitions
Drop transitions removed 68108 transitions
Drop transitions removed 509 transitions
Reduce isomorphic transitions removed 509 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 618 rules applied. Total rules applied 619 place count 303 transition count 161
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 728 place count 194 transition count 161
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 728 place count 194 transition count 145
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 760 place count 178 transition count 145
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 812 place count 126 transition count 93
Iterating global reduction 2 with 52 rules applied. Total rules applied 864 place count 126 transition count 93
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 946 place count 85 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 947 place count 84 transition count 51
Ensure Unique test removed 18 places
Iterating post reduction 2 with 18 rules applied. Total rules applied 965 place count 66 transition count 51
Applied a total of 965 rules in 296 ms. Remains 66 /49206 variables (removed 49140) and now considering 51/68887 (removed 68836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 66/49206 places, 51/68887 transitions.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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(G(p0)))'
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 35 are kept as prefixes of interest. Removing 49171 places using SCC suffix rule.59 ms
Discarding 49171 places :
Also discarding 68820 output transitions
Drop transitions removed 68820 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 34 transition count 64
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 23 transition count 34
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 23 transition count 34
Graph (complete) has 12 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 22 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 22 transition count 32
Applied a total of 27 rules in 151 ms. Remains 22 /49206 variables (removed 49184) and now considering 32/68887 (removed 68855) transitions.
// Phase 1: matrix 32 rows 22 cols
[2023-03-20 18:25:30] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-20 18:25:30] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-20 18:25:30] [INFO ] Invariant cache hit.
[2023-03-20 18:25:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-20 18:25:30] [INFO ] Redundant transitions in 12 ms returned [4, 23, 25]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 29 rows 22 cols
[2023-03-20 18:25:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:30] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/49206 places, 29/68887 transitions.
Graph (complete) has 12 edges and 22 vertex of which 19 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 19 /22 variables (removed 3) and now considering 26/29 (removed 3) transitions.
// Phase 1: matrix 26 rows 19 cols
[2023-03-20 18:25:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 18:25:30] [INFO ] Invariant cache hit.
[2023-03-20 18:25:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/49206 places, 26/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 19/49206 places, 26/68887 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7163 reset in 221 ms.
Product exploration explored 100000 steps with 7107 reset in 121 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 464 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Probably explored full state space saw : 145308 states, properties seen :0
Probabilistic random walk after 1139778 steps, saw 145308 distinct states, run finished after 731 ms. (steps per millisecond=1559 ) properties seen :0
Explored full state space saw : 145314 states, properties seen :0
Exhaustive walk after 1139832 steps, saw 145314 distinct states, run finished after 496 ms. (steps per millisecond=2298 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 finished in 2677 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 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 36 are kept as prefixes of interest. Removing 49170 places using SCC suffix rule.34 ms
Discarding 49170 places :
Also discarding 68819 output transitions
Drop transitions removed 68819 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 35 transition count 65
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 24 transition count 35
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 24 transition count 35
Graph (complete) has 13 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 23 transition count 34
Applied a total of 26 rules in 93 ms. Remains 23 /49206 variables (removed 49183) and now considering 34/68887 (removed 68853) transitions.
// Phase 1: matrix 34 rows 23 cols
[2023-03-20 18:25:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 18:25:32] [INFO ] Invariant cache hit.
[2023-03-20 18:25:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-20 18:25:32] [INFO ] Redundant transitions in 13 ms returned [4, 10, 22, 32]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 30 rows 23 cols
[2023-03-20 18:25:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/49206 places, 30/68887 transitions.
Graph (complete) has 12 edges and 23 vertex of which 19 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 5 ms. Remains 19 /23 variables (removed 4) and now considering 26/30 (removed 4) transitions.
// Phase 1: matrix 26 rows 19 cols
[2023-03-20 18:25:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 18:25:33] [INFO ] Invariant cache hit.
[2023-03-20 18:25:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/49206 places, 26/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 19/49206 places, 26/68887 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 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:(GT 3 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7284 reset in 76 ms.
Product exploration explored 100000 steps with 7213 reset in 74 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 476 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 136809 states, properties seen :0
Probabilistic random walk after 1071306 steps, saw 136809 distinct states, run finished after 718 ms. (steps per millisecond=1492 ) properties seen :0
Explored full state space saw : 136809 states, properties seen :0
Exhaustive walk after 1071306 steps, saw 136809 distinct states, run finished after 417 ms. (steps per millisecond=2569 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 finished in 2034 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 U (p1||G(p0))))))'
Support contains 4 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 128 are kept as prefixes of interest. Removing 49078 places using SCC suffix rule.32 ms
Discarding 49078 places :
Also discarding 68644 output transitions
Drop transitions removed 68644 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 127 transition count 222
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 63 place count 85 transition count 119
Iterating global reduction 1 with 42 rules applied. Total rules applied 105 place count 85 transition count 119
Graph (complete) has 47 edges and 85 vertex of which 83 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 83 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 83 transition count 116
Applied a total of 107 rules in 90 ms. Remains 83 /49206 variables (removed 49123) and now considering 116/68887 (removed 68771) transitions.
// Phase 1: matrix 116 rows 83 cols
[2023-03-20 18:25:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 18:25:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 18:25:34] [INFO ] Invariant cache hit.
[2023-03-20 18:25:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-20 18:25:35] [INFO ] Redundant transitions in 20 ms returned [7, 12, 32, 74, 99, 102, 107]
Found 7 redundant transitions using SMT.
Drop transitions removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
// Phase 1: matrix 109 rows 83 cols
[2023-03-20 18:25:35] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:35] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/49206 places, 109/68887 transitions.
Graph (complete) has 45 edges and 83 vertex of which 76 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Applied a total of 1 rules in 2 ms. Remains 76 /83 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 76 cols
[2023-03-20 18:25:35] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:25:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 18:25:35] [INFO ] Invariant cache hit.
[2023-03-20 18:25:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/49206 places, 102/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 413 ms. Remains : 76/49206 places, 102/68887 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s27 s67) (GT s47 s13)), p0:(GT s47 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 finished in 508 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))||G(p1)))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 140 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:26:00] [INFO ] Invariants computation overflowed in 24681 ms
[2023-03-20 18:26:03] [INFO ] Implicit Places using invariants in 28264 ms returned []
Implicit Place search using SMT only with invariants took 28265 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:26:26] [INFO ] Invariants computation overflowed in 22928 ms
[2023-03-20 18:26:30] [INFO ] Dead Transitions using invariants and state equation in 26516 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54930 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 1 s17278), p0:(GT 2 s15216)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 32280 steps with 222 reset in 10004 ms.
Product exploration timeout after 24170 steps with 162 reset in 10003 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 591 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 75 resets, run finished after 3337 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 3003 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 28834 steps, run timeout after 18014 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 28834 steps, saw 28027 distinct states, run finished after 18014 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:27:55] [INFO ] Invariants computation overflowed in 30452 ms
[2023-03-20 18:28:20] [INFO ] After 15489ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 18:28:21] [INFO ] After 16150ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 18:28:21] [INFO ] After 25390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 12 are kept as prefixes of interest. Removing 49194 places using SCC suffix rule.14 ms
Discarding 49194 places :
Also discarding 68856 output transitions
Drop transitions removed 68856 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 12 transition count 4
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 35 place count 5 transition count 4
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 3 transition count 2
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 3 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 2 transition count 1
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 1 transition count 1
Applied a total of 41 rules in 157 ms. Remains 1 /49206 variables (removed 49205) and now considering 1/68887 (removed 68886) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1/49206 places, 1/68887 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 2 states, properties seen :0
Probabilistic random walk after 3 steps, saw 2 distinct states, run finished after 12 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 2 states, properties seen :0
Exhaustive walk after 3 steps, saw 2 distinct states, run finished after 2 ms. (steps per millisecond=1 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 16 factoid took 359 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 finished in 166572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(G(!p0))))&&(X(p1) U ((p0&&X(p1))||X(G(p1))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 140 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:28:52] [INFO ] Invariants computation overflowed in 30465 ms
[2023-03-20 18:28:56] [INFO ] Implicit Places using invariants in 34097 ms returned []
Implicit Place search using SMT only with invariants took 34100 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:29:23] [INFO ] Invariants computation overflowed in 27521 ms
[2023-03-20 18:29:27] [INFO ] Dead Transitions using invariants and state equation in 31167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65414 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (OR p0 p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s22802), p1:(GT s44947 s27677)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 19 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 finished in 65804 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 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 37 are kept as prefixes of interest. Removing 49169 places using SCC suffix rule.31 ms
Discarding 49169 places :
Also discarding 68817 output transitions
Drop transitions removed 68817 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 36 transition count 65
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 26 transition count 39
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 26 transition count 39
Graph (complete) has 14 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 25 transition count 38
Applied a total of 26 rules in 81 ms. Remains 25 /49206 variables (removed 49181) and now considering 38/68887 (removed 68849) transitions.
// Phase 1: matrix 38 rows 25 cols
[2023-03-20 18:29:27] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 18:29:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 18:29:27] [INFO ] Invariant cache hit.
[2023-03-20 18:29:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-20 18:29:27] [INFO ] Redundant transitions in 15 ms returned [4, 10, 26, 31, 33, 36]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 32 rows 25 cols
[2023-03-20 18:29:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:29:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/49206 places, 32/68887 transitions.
Graph (complete) has 13 edges and 25 vertex of which 19 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Applied a total of 1 rules in 0 ms. Remains 19 /25 variables (removed 6) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 19 cols
[2023-03-20 18:29:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:29:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-20 18:29:27] [INFO ] Invariant cache hit.
[2023-03-20 18:29:27] [INFO ] Implicit Places using invariants and state equation in 28 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 : 19/49206 places, 26/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 19/49206 places, 26/68887 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-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:(GT 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5115 reset in 87 ms.
Product exploration explored 100000 steps with 5105 reset in 114 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Probably explored full state space saw : 85292 states, properties seen :0
Probabilistic random walk after 653904 steps, saw 85292 distinct states, run finished after 429 ms. (steps per millisecond=1524 ) properties seen :0
Explored full state space saw : 85292 states, properties seen :0
Exhaustive walk after 653904 steps, saw 85292 distinct states, run finished after 292 ms. (steps per millisecond=2239 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 finished in 1728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(G(p0))&&F((p1||(p0 U p2)))))))))'
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 150 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:30:02] [INFO ] Invariants computation overflowed in 32572 ms
[2023-03-20 18:30:05] [INFO ] Implicit Places using invariants in 36177 ms returned []
Implicit Place search using SMT only with invariants took 36178 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:30:35] [INFO ] Invariants computation overflowed in 29361 ms
[2023-03-20 18:30:39] [INFO ] Dead Transitions using invariants and state equation in 33421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69752 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-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=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s9316 s8791), p2:(LEQ 1 s20104), p0:(LEQ s45826 s2953)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 29520 steps with 211 reset in 10003 ms.
Product exploration timeout after 22120 steps with 136 reset in 10004 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 3486 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2956 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2855 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2774 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 54969 steps, run timeout after 36015 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 54969 steps, saw 53399 distinct states, run finished after 36016 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:32:37] [INFO ] Invariants computation overflowed in 39262 ms
[2023-03-20 18:32:47] [INFO ] After 10118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 18:33:12] [INFO ] After 13210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:33:12] [INFO ] After 13243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 18:33:12] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 56 are kept as prefixes of interest. Removing 49150 places using SCC suffix rule.15 ms
Discarding 49150 places :
Also discarding 68742 output transitions
Drop transitions removed 68742 transitions
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 56 transition count 23
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 151 place count 28 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 25 transition count 20
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 18 transition count 13
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 18 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 13 transition count 8
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 11 transition count 8
Applied a total of 182 rules in 74 ms. Remains 11 /49206 variables (removed 49195) and now considering 8/68887 (removed 68879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 11/49206 places, 8/68887 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 141 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:33:48] [INFO ] Invariants computation overflowed in 34118 ms
[2023-03-20 18:33:52] [INFO ] Implicit Places using invariants in 38181 ms returned []
Implicit Place search using SMT only with invariants took 38184 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:34:43] [INFO ] Invariants computation overflowed in 50919 ms
[2023-03-20 18:34:47] [INFO ] Dead Transitions using invariants and state equation in 55169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93504 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 3313 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 2806 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2769 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 2822 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 59205 steps, run timeout after 36010 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 59205 steps, saw 57500 distinct states, run finished after 36011 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:36:15] [INFO ] Invariants computation overflowed in 29308 ms
[2023-03-20 18:36:25] [INFO ] After 10160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 18:36:50] [INFO ] After 12512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:36:50] [INFO ] After 12536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 18:36:50] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 56 are kept as prefixes of interest. Removing 49150 places using SCC suffix rule.17 ms
Discarding 49150 places :
Also discarding 68742 output transitions
Drop transitions removed 68742 transitions
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 56 transition count 23
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 151 place count 28 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 25 transition count 20
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 18 transition count 13
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 18 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 13 transition count 8
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 11 transition count 8
Applied a total of 182 rules in 79 ms. Remains 11 /49206 variables (removed 49195) and now considering 8/68887 (removed 68879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 11/49206 places, 8/68887 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 31710 steps with 196 reset in 10003 ms.
Product exploration timeout after 24270 steps with 157 reset in 10001 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 160 are kept as prefixes of interest. Removing 49046 places using SCC suffix rule.32 ms
Discarding 49046 places :
Also discarding 68586 output transitions
Drop transitions removed 68586 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 160 transition count 281
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 70 place count 111 transition count 159
Iterating global reduction 1 with 49 rules applied. Total rules applied 119 place count 111 transition count 159
Graph (complete) has 69 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 109 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 109 transition count 156
Applied a total of 121 rules in 118 ms. Remains 109 /49206 variables (removed 49097) and now considering 156/68887 (removed 68731) transitions.
[2023-03-20 18:37:12] [INFO ] Redundant transitions in 66 ms returned [18, 29, 36, 40, 47, 61, 70, 73, 78, 88, 95, 138, 142, 144]
Found 14 redundant transitions using SMT.
Drop transitions removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
// Phase 1: matrix 142 rows 109 cols
[2023-03-20 18:37:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:37:12] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/49206 places, 142/68887 transitions.
Graph (complete) has 67 edges and 109 vertex of which 95 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 2 ms. Remains 95 /109 variables (removed 14) and now considering 128/142 (removed 14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/49206 places, 128/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 95/49206 places, 128/68887 transitions.
Built C files in :
/tmp/ltsmin13190817919327224806
[2023-03-20 18:37:13] [INFO ] Built C files in 651ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13190817919327224806
Running compilation step : cd /tmp/ltsmin13190817919327224806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13190817919327224806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13190817919327224806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 130 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:37:51] [INFO ] Invariants computation overflowed in 34567 ms
[2023-03-20 18:37:54] [INFO ] Implicit Places using invariants in 38201 ms returned []
Implicit Place search using SMT only with invariants took 38202 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:38:25] [INFO ] Invariants computation overflowed in 30984 ms
[2023-03-20 18:38:29] [INFO ] Dead Transitions using invariants and state equation in 34769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73103 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Built C files in :
/tmp/ltsmin8106730381601642253
[2023-03-20 18:38:30] [INFO ] Built C files in 454ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8106730381601642253
Running compilation step : cd /tmp/ltsmin8106730381601642253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8106730381601642253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8106730381601642253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 18:38:36] [INFO ] Flatten gal took : 1719 ms
[2023-03-20 18:38:38] [INFO ] Flatten gal took : 1638 ms
[2023-03-20 18:38:38] [INFO ] Time to serialize gal into /tmp/LTL10743660017298703679.gal : 342 ms
[2023-03-20 18:38:38] [INFO ] Time to serialize properties into /tmp/LTL16846767577970435464.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10743660017298703679.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5364175026918716571.hoa' '-atoms' '/tmp/LTL16846767577970435464.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2023-03-20 18:38:56] [INFO ] Flatten gal took : 1631 ms
[2023-03-20 18:38:58] [INFO ] Flatten gal took : 1640 ms
[2023-03-20 18:38:58] [INFO ] Time to serialize gal into /tmp/LTL4815046244030884002.gal : 234 ms
[2023-03-20 18:38:58] [INFO ] Time to serialize properties into /tmp/LTL10246735136631966245.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4815046244030884002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10246735136631966245.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 18:39:15] [INFO ] Flatten gal took : 1570 ms
[2023-03-20 18:39:15] [INFO ] Applying decomposition
[2023-03-20 18:39:17] [INFO ] Flatten gal took : 1537 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10658997138387547884.txt' '-o' '/tmp/graph10658997138387547884.bin' '-w' '/tmp/graph10658997138387547884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10658997138387547884.bin' '-l' '-1' '-v' '-w' '/tmp/graph10658997138387547884.weights' '-q' '0' '-e' '0.001'
[2023-03-20 18:39:21] [INFO ] Decomposing Gal with order
[2023-03-20 18:39:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 19:08:09] [INFO ] Removed a total of 69743 redundant transitions.
[2023-03-20 19:08:10] [INFO ] Flatten gal took : 2907 ms
[2023-03-20 19:08:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 77421 labels/synchronizations in 32892 ms.
[2023-03-20 19:08:51] [INFO ] Time to serialize gal into /tmp/LTL1248520551749990331.gal : 337 ms
[2023-03-20 19:08:51] [INFO ] Time to serialize properties into /tmp/LTL11298037987220820784.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1248520551749990331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11298037987220820784.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15653127412991248661
[2023-03-20 19:09:06] [INFO ] Built C files in 424ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15653127412991248661
Running compilation step : cd /tmp/ltsmin15653127412991248661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15653127412991248661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15653127412991248661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 finished in 2380172 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 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 119 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:09:36] [INFO ] Invariants computation overflowed in 26366 ms
[2023-03-20 19:09:39] [INFO ] Implicit Places using invariants in 29959 ms returned []
Implicit Place search using SMT only with invariants took 29960 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:10:03] [INFO ] Invariants computation overflowed in 23476 ms
[2023-03-20 19:10:06] [INFO ] Dead Transitions using invariants and state equation in 26944 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57026 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09 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:(GT 3 s4041)], 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 30680 steps with 189 reset in 10004 ms.
Product exploration timeout after 23970 steps with 157 reset in 10004 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 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 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 3309 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 3141 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 28803 steps, run timeout after 18009 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 28803 steps, saw 27997 distinct states, run finished after 18010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:11:27] [INFO ] Invariants computation overflowed in 26643 ms
[2023-03-20 19:11:52] [INFO ] After 15530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 19:11:53] [INFO ] After 16192ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-20 19:11:53] [INFO ] After 25308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 11 are kept as prefixes of interest. Removing 49195 places using SCC suffix rule.14 ms
Discarding 49195 places :
Also discarding 68858 output transitions
Drop transitions removed 68858 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 11 transition count 5
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 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 31 place count 5 transition count 4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Applied a total of 35 rules in 63 ms. Remains 3 /49206 variables (removed 49203) and now considering 3/68887 (removed 68884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 3/49206 places, 3/68887 transitions.
Incomplete random walk after 10000 steps, including 3333 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 7 steps, saw 4 distinct states, run finished after 4 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 7 steps, saw 4 distinct states, run finished after 1 ms. (steps per millisecond=7 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09 finished in 163734 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(((p1&&X(p1))||p0))))'
Support contains 8 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 112 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:12:19] [INFO ] Invariants computation overflowed in 25910 ms
[2023-03-20 19:12:22] [INFO ] Implicit Places using invariants in 29289 ms returned []
Implicit Place search using SMT only with invariants took 29290 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:12:47] [INFO ] Invariants computation overflowed in 24381 ms
[2023-03-20 19:12:50] [INFO ] Dead Transitions using invariants and state equation in 27993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57404 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s31973 s45153) (AND (LEQ 1 s36182) (LEQ 3 s20800) (LEQ s12392 s4792))), p1:(LEQ s10482 s35306)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 13660 steps with 6830 reset in 10007 ms.
Product exploration timeout after 12510 steps with 6255 reset in 10004 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 finished in 87386 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(F(p1))))))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 116 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:13:47] [INFO ] Invariants computation overflowed in 27016 ms
[2023-03-20 19:13:51] [INFO ] Implicit Places using invariants in 30586 ms returned []
Implicit Place search using SMT only with invariants took 30587 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:14:14] [INFO ] Invariants computation overflowed in 23552 ms
[2023-03-20 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 27084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57802 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 2 s6062), p0:(LEQ 3 s48095)], 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]]
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 58 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 finished in 58101 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(((X(p0) U p1)||p0))||F(X(F(p0))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 162 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:14:45] [INFO ] Invariants computation overflowed in 26913 ms
[2023-03-20 19:14:49] [INFO ] Implicit Places using invariants in 30452 ms returned []
Implicit Place search using SMT only with invariants took 30467 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:15:12] [INFO ] Invariants computation overflowed in 22738 ms
[2023-03-20 19:15:15] [INFO ] Dead Transitions using invariants and state equation in 26274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56906 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s26238 s46007), p0:(LEQ 1 s1313)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 13950 steps with 6975 reset in 10004 ms.
Product exploration timeout after 12590 steps with 6295 reset in 10021 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13 finished in 86857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1) U p0)))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 121 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:16:10] [INFO ] Invariants computation overflowed in 24487 ms
[2023-03-20 19:16:13] [INFO ] Implicit Places using invariants in 28018 ms returned []
Implicit Place search using SMT only with invariants took 28020 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 19:16:39] [INFO ] Invariants computation overflowed in 25334 ms
[2023-03-20 19:16:42] [INFO ] Dead Transitions using invariants and state equation in 28979 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57128 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s37994), p1:(LEQ 3 s23365)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 finished in 57414 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||X((G(p1) U (p0&&G(p1))))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 101 are kept as prefixes of interest. Removing 49105 places using SCC suffix rule.25 ms
Discarding 49105 places :
Also discarding 68700 output transitions
Drop transitions removed 68700 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 100 transition count 176
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 45 place count 66 transition count 91
Iterating global reduction 1 with 34 rules applied. Total rules applied 79 place count 66 transition count 91
Applied a total of 79 rules in 72 ms. Remains 66 /49206 variables (removed 49140) and now considering 91/68887 (removed 68796) transitions.
// Phase 1: matrix 91 rows 66 cols
[2023-03-20 19:16:43] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 19:16:43] [INFO ] Invariant cache hit.
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-20 19:16:43] [INFO ] Redundant transitions in 15 ms returned [12, 16, 22, 41, 82]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 86 rows 66 cols
[2023-03-20 19:16:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 19:16:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/49206 places, 86/68887 transitions.
Graph (complete) has 39 edges and 66 vertex of which 61 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 3 ms. Remains 61 /66 variables (removed 5) and now considering 81/86 (removed 5) transitions.
// Phase 1: matrix 81 rows 61 cols
[2023-03-20 19:16:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 19:16:43] [INFO ] Invariant cache hit.
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/49206 places, 81/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 61/49206 places, 81/68887 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s54 s34), p1:(LEQ 2 s18)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1465 steps with 45 reset in 4 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(G(p0))&&F((p1||(p0 U p2)))))))))'
Found a Shortening insensitive property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 160 are kept as prefixes of interest. Removing 49046 places using SCC suffix rule.36 ms
Discarding 49046 places :
Also discarding 68586 output transitions
Drop transitions removed 68586 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 159 transition count 280
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 70 place count 110 transition count 158
Iterating global reduction 1 with 49 rules applied. Total rules applied 119 place count 110 transition count 158
Graph (complete) has 66 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 108 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 108 transition count 155
Applied a total of 121 rules in 90 ms. Remains 108 /49206 variables (removed 49098) and now considering 155/68887 (removed 68732) transitions.
// Phase 1: matrix 155 rows 108 cols
[2023-03-20 19:16:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 19:16:43] [INFO ] Invariant cache hit.
[2023-03-20 19:16:44] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-20 19:16:44] [INFO ] Invariant cache hit.
[2023-03-20 19:16:44] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/49206 places, 155/68887 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 235 ms. Remains : 108/49206 places, 155/68887 transitions.
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-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=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s50 s36), p2:(LEQ 1 s72), p0:(LEQ s97 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7817 steps with 107 reset in 17 ms.
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 finished in 612 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 19:16:46] [INFO ] Flatten gal took : 1920 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3660018469630570666
[2023-03-20 19:16:47] [INFO ] Too many transitions (68887) to apply POR reductions. Disabling POR matrices.
[2023-03-20 19:16:48] [INFO ] Built C files in 696ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3660018469630570666
Running compilation step : cd /tmp/ltsmin3660018469630570666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-20 19:16:48] [INFO ] Applying decomposition
[2023-03-20 19:16:50] [INFO ] Flatten gal took : 2082 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7690547881067539948.txt' '-o' '/tmp/graph7690547881067539948.bin' '-w' '/tmp/graph7690547881067539948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7690547881067539948.bin' '-l' '-1' '-v' '-w' '/tmp/graph7690547881067539948.weights' '-q' '0' '-e' '0.001'
[2023-03-20 19:16:55] [INFO ] Decomposing Gal with order
[2023-03-20 19:18:01] [INFO ] Rewriting arrays to variables to allow decomposition.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2175776 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15967028 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S03D1C1A08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912700501283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S03D1C1A08.tgz
mv ViralEpidemic-PT-S03D1C1A08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;