fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701123100213
Last Updated
July 7, 2024

About the Execution of 2023-gold for ViralEpidemic-PT-S03D1C1A08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10046.771 1415131.00 1527930.00 4028.00 FFFFFTFTTFFTTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r461-smll-171701123100213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123100213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 11:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 11:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29M May 18 16:43 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-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717218298993

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S03D1C1A08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-01 05:05:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-01 05:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:05:04] [INFO ] Load time of PNML (sax parser for PT used): 2221 ms
[2024-06-01 05:05:04] [INFO ] Transformed 49206 places.
[2024-06-01 05:05:04] [INFO ] Transformed 68887 transitions.
[2024-06-01 05:05:04] [INFO ] Found NUPN structural information;
[2024-06-01 05:05:04] [INFO ] Parsed PT model containing 49206 places and 68887 transitions and 157456 arcs in 2762 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 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 391 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:06:03] [INFO ] Invariants computation overflowed in 57499 ms
[2024-06-01 05:06:15] [INFO ] Implicit Places using invariants in 68939 ms returned []
Implicit Place search using SMT only with invariants took 68985 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:07:16] [INFO ] Invariants computation overflowed in 61136 ms
[2024-06-01 05:07:26] [INFO ] Dead Transitions using invariants and state equation in 71244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140645 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Support contains 66 out of 49206 places after structural reductions.
[2024-06-01 05:07:30] [INFO ] Flatten gal took : 3025 ms
[2024-06-01 05:07:32] [INFO ] Flatten gal took : 2198 ms
[2024-06-01 05:07:37] [INFO ] Input system was already deterministic with 68887 transitions.
Support contains 62 out of 49206 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 4548 ms. (steps per millisecond=2 ) properties (out of 29) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 443 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=2 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 319 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=3 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:08:43] [INFO ] Invariants computation overflowed in 53533 ms
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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-06-01 05:09:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 05:09:08] [INFO ] After 25204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 44 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 237 are kept as prefixes of interest. Removing 48969 places using SCC suffix rule.63 ms
Discarding 48969 places :
Also discarding 68344 output transitions
Drop transitions removed 68344 transitions
Drop transitions removed 318 transitions
Reduce isomorphic transitions removed 318 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 382 rules applied. Total rules applied 383 place count 237 transition count 161
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 447 place count 173 transition count 161
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 447 place count 173 transition count 138
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 493 place count 150 transition count 138
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 516 place count 127 transition count 115
Iterating global reduction 2 with 23 rules applied. Total rules applied 539 place count 127 transition count 115
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 569 place count 112 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 570 place count 111 transition count 99
Applied a total of 570 rules in 376 ms. Remains 111 /49206 variables (removed 49095) and now considering 99/68887 (removed 68788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 111/49206 places, 99/68887 transitions.
Finished random walk after 318 steps, including 5 resets, run visited all 20 properties in 7 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F((p1&&X(p2))))||p0))))'
Support contains 9 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 301 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:10:08] [INFO ] Invariants computation overflowed in 57717 ms
[2024-06-01 05:10:17] [INFO ] Implicit Places using invariants in 67243 ms returned []
Implicit Place search using SMT only with invariants took 67249 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:11:18] [INFO ] Invariants computation overflowed in 60577 ms
[2024-06-01 05:11:27] [INFO ] Dead Transitions using invariants and state equation in 69987 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137552 ms. Remains : 49206/49206 places, 68887/68887 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 442 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s21191 1) (EQ s21459 1)) (AND (EQ s13076 1) (EQ s13078 1))), p1:(OR (AND (EQ s30378 1) (EQ s30392 1)) (AND (EQ s43306 1) (EQ s43572 1))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 241 steps with 0 reset in 148 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-00 finished in 138546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
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 68 are kept as prefixes of interest. Removing 49138 places using SCC suffix rule.93 ms
Discarding 49138 places :
Also discarding 68761 output transitions
Drop transitions removed 68761 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 67 transition count 117
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 29 place count 47 transition count 67
Iterating global reduction 1 with 20 rules applied. Total rules applied 49 place count 47 transition count 67
Applied a total of 49 rules in 193 ms. Remains 47 /49206 variables (removed 49159) and now considering 67/68887 (removed 68820) transitions.
// Phase 1: matrix 67 rows 47 cols
[2024-06-01 05:11:28] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:11:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 05:11:28] [INFO ] Invariant cache hit.
[2024-06-01 05:11:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-01 05:11:28] [INFO ] Redundant transitions in 26 ms returned [10, 17, 21, 25, 54]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 62 rows 47 cols
[2024-06-01 05:11:28] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:11:29] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/49206 places, 62/68887 transitions.
Graph (complete) has 27 edges and 47 vertex of which 42 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 57/62 (removed 5) transitions.
// Phase 1: matrix 57 rows 42 cols
[2024-06-01 05:11:29] [INFO ] Computed 0 invariants in 2 ms
[2024-06-01 05:11:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 05:11:29] [INFO ] Invariant cache hit.
[2024-06-01 05:11:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/49206 places, 57/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 42/49206 places, 57/68887 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s17 0) (EQ s19 0)), p0:(AND (EQ s34 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 52 steps with 1 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-01 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U 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 68 are kept as prefixes of interest. Removing 49138 places using SCC suffix rule.106 ms
Discarding 49138 places :
Also discarding 68758 output transitions
Drop transitions removed 68758 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 67 transition count 118
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 33 place count 45 transition count 64
Iterating global reduction 1 with 22 rules applied. Total rules applied 55 place count 45 transition count 64
Applied a total of 55 rules in 223 ms. Remains 45 /49206 variables (removed 49161) and now considering 64/68887 (removed 68823) transitions.
// Phase 1: matrix 64 rows 45 cols
[2024-06-01 05:11:29] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:11:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 05:11:29] [INFO ] Invariant cache hit.
[2024-06-01 05:11:29] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-06-01 05:11:29] [INFO ] Redundant transitions in 24 ms returned [9, 16, 26]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 61 rows 45 cols
[2024-06-01 05:11:29] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:11:29] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/49206 places, 61/68887 transitions.
Graph (complete) has 25 edges and 45 vertex of which 42 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 3 ms. Remains 42 /45 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 42 cols
[2024-06-01 05:11:29] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:11:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 05:11:29] [INFO ] Invariant cache hit.
[2024-06-01 05:11:29] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/49206 places, 58/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 558 ms. Remains : 42/49206 places, 58/68887 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s35 1), p0:(AND (EQ s24 1) (EQ s27 1))], 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 23 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-03 finished in 709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
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 85 are kept as prefixes of interest. Removing 49121 places using SCC suffix rule.50 ms
Discarding 49121 places :
Also discarding 68722 output transitions
Drop transitions removed 68722 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 84 transition count 156
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 34 place count 59 transition count 90
Iterating global reduction 1 with 25 rules applied. Total rules applied 59 place count 59 transition count 90
Applied a total of 59 rules in 156 ms. Remains 59 /49206 variables (removed 49147) and now considering 90/68887 (removed 68797) transitions.
// Phase 1: matrix 90 rows 59 cols
[2024-06-01 05:11:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:11:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 05:11:30] [INFO ] Invariant cache hit.
[2024-06-01 05:11:30] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-06-01 05:11:30] [INFO ] Redundant transitions in 20 ms returned [18, 22, 41, 55, 79, 83, 85]
Found 7 redundant transitions using SMT.
Drop transitions removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
// Phase 1: matrix 83 rows 59 cols
[2024-06-01 05:11:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:11:30] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/49206 places, 83/68887 transitions.
Graph (complete) has 34 edges and 59 vertex of which 52 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 52 /59 variables (removed 7) and now considering 76/83 (removed 7) transitions.
// Phase 1: matrix 76 rows 52 cols
[2024-06-01 05:11:30] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:11:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 05:11:30] [INFO ] Invariant cache hit.
[2024-06-01 05:11:30] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/49206 places, 76/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 476 ms. Remains : 52/49206 places, 76/68887 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s16 0), p1:(AND (EQ s45 1) (EQ s48 1) (EQ s31 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-04 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 67 are kept as prefixes of interest. Removing 49139 places using SCC suffix rule.44 ms
Discarding 49139 places :
Also discarding 68763 output transitions
Drop transitions removed 68763 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 66 transition count 115
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 31 place count 44 transition count 61
Iterating global reduction 1 with 22 rules applied. Total rules applied 53 place count 44 transition count 61
Graph (complete) has 25 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 43 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 43 transition count 59
Applied a total of 55 rules in 134 ms. Remains 43 /49206 variables (removed 49163) and now considering 59/68887 (removed 68828) transitions.
// Phase 1: matrix 59 rows 43 cols
[2024-06-01 05:11:30] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:11:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 05:11:30] [INFO ] Invariant cache hit.
[2024-06-01 05:11:31] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-06-01 05:11:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-01 05:11:31] [INFO ] Invariant cache hit.
[2024-06-01 05:11:31] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/49206 places, 59/68887 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 43/49206 places, 59/68887 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s16 1) (NEQ s19 1)) (OR (EQ s36 0) (EQ s37 0)))], 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 6138 reset in 458 ms.
Product exploration explored 100000 steps with 6143 reset in 258 ms.
Computed a total of 43 stabilizing places and 59 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 59
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 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-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-05 finished in 1236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p0) U p1))) U G(p1)))'
Support contains 4 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 169 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:12:28] [INFO ] Invariants computation overflowed in 56309 ms
[2024-06-01 05:12:38] [INFO ] Implicit Places using invariants in 65817 ms returned []
Implicit Place search using SMT only with invariants took 65821 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:13:37] [INFO ] Invariants computation overflowed in 59135 ms
[2024-06-01 05:13:46] [INFO ] Dead Transitions using invariants and state equation in 68076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134103 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s36292 1) (EQ s36299 1)), p0:(AND (EQ s13428 1) (EQ s13457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 15 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-06 finished in 134458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 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 144 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:14:40] [INFO ] Invariants computation overflowed in 54011 ms
[2024-06-01 05:14:50] [INFO ] Implicit Places using invariants in 63725 ms returned []
Implicit Place search using SMT only with invariants took 63726 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:15:57] [INFO ] Invariants computation overflowed in 67518 ms
[2024-06-01 05:16:06] [INFO ] Dead Transitions using invariants and state equation in 76322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140210 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (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-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s32728 0) (EQ s32755 0)), p1:(OR (NEQ s25080 1) (NEQ s25082 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 8370 steps with 4185 reset in 10005 ms.
Product exploration timeout after 8510 steps with 4255 reset in 10008 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 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-07 finished in 187014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(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 73 are kept as prefixes of interest. Removing 49133 places using SCC suffix rule.27 ms
Discarding 49133 places :
Also discarding 68753 output transitions
Drop transitions removed 68753 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 72 transition count 129
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 29 place count 48 transition count 68
Iterating global reduction 1 with 24 rules applied. Total rules applied 53 place count 48 transition count 68
Applied a total of 53 rules in 86 ms. Remains 48 /49206 variables (removed 49158) and now considering 68/68887 (removed 68819) transitions.
// Phase 1: matrix 68 rows 48 cols
[2024-06-01 05:16:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:16:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 05:16:53] [INFO ] Invariant cache hit.
[2024-06-01 05:16:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 05:16:53] [INFO ] Redundant transitions in 18 ms returned [12, 20, 27, 43]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-01 05:16:53] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:16:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/49206 places, 64/68887 transitions.
Graph (complete) has 28 edges and 48 vertex of which 44 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 2 ms. Remains 44 /48 variables (removed 4) and now considering 60/64 (removed 4) transitions.
// Phase 1: matrix 60 rows 44 cols
[2024-06-01 05:16:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:16:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 05:16:53] [INFO ] Invariant cache hit.
[2024-06-01 05:16:53] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/49206 places, 60/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 336 ms. Remains : 44/49206 places, 60/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-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s15 1), p0:(OR (NEQ s31 1) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4614 reset in 199 ms.
Product exploration explored 100000 steps with 4619 reset in 212 ms.
Computed a total of 44 stabilizing places and 60 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 60
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-08 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p1)&&p0) U p2))))'
Support contains 6 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 197 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:17:49] [INFO ] Invariants computation overflowed in 55083 ms
[2024-06-01 05:17:58] [INFO ] Implicit Places using invariants in 64265 ms returned []
Implicit Place search using SMT only with invariants took 64270 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:18:58] [INFO ] Invariants computation overflowed in 59425 ms
[2024-06-01 05:19:08] [INFO ] Dead Transitions using invariants and state equation in 69151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133628 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s42711 1) (EQ s42719 1)), p0:(AND (EQ s1380 1) (EQ s1383 1)), p1:(AND (EQ s35515 1) (EQ s35519 1))], nbAcceptance=0, 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 2 steps with 0 reset in 12 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-10 finished in 133959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((((!p1&&X(!p2)) U (G((!p1&&X(!p2)))||(X(!p2)&&p3)))||p0)))))'
Support contains 6 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 282 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:20:02] [INFO ] Invariants computation overflowed in 54183 ms
[2024-06-01 05:20:12] [INFO ] Implicit Places using invariants in 63850 ms returned []
Implicit Place search using SMT only with invariants took 63855 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:21:10] [INFO ] Invariants computation overflowed in 57523 ms
[2024-06-01 05:21:19] [INFO ] Dead Transitions using invariants and state equation in 67154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131306 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p1) p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17591 0) (EQ s17595 0)), p3:(AND (NOT (AND (EQ s12270 1) (EQ s12272 1))) (NOT (AND (EQ s17591 1) (EQ s17595 1)))), p1:(AND (EQ s17591 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 11550 steps with 3850 reset in 10001 ms.
Product exploration timeout after 10630 steps with 3543 reset in 10008 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 p3 (NOT p1) (NOT p2)), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 1700 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-11 finished in 182503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(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 162 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:23:14] [INFO ] Invariants computation overflowed in 63524 ms
[2024-06-01 05:23:24] [INFO ] Implicit Places using invariants in 73267 ms returned []
Implicit Place search using SMT only with invariants took 73269 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:24:27] [INFO ] Invariants computation overflowed in 63585 ms
[2024-06-01 05:24:37] [INFO ] Dead Transitions using invariants and state equation in 73450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146884 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s41765 1) (NEQ s41768 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 9420 steps with 4710 reset in 10011 ms.
Product exploration timeout after 8690 steps with 4345 reset in 10006 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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-12 finished in 195589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 6 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 166 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:26:30] [INFO ] Invariants computation overflowed in 63698 ms
[2024-06-01 05:26:40] [INFO ] Implicit Places using invariants in 73591 ms returned []
Implicit Place search using SMT only with invariants took 73593 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:27:33] [INFO ] Invariants computation overflowed in 53225 ms
[2024-06-01 05:27:42] [INFO ] Dead Transitions using invariants and state equation in 62425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136192 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (OR (EQ s6120 0) (EQ s6125 0)) (OR (EQ s47502 0) (EQ s47509 0))), p1:(OR (EQ s38412 0) (EQ s38415 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 9400 steps with 4700 reset in 10003 ms.
Product exploration timeout after 8630 steps with 4315 reset in 10002 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 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 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-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-14 finished in 185286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(p1))))'
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 52 are kept as prefixes of interest. Removing 49154 places using SCC suffix rule.49 ms
Discarding 49154 places :
Also discarding 68790 output transitions
Drop transitions removed 68790 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 51 transition count 90
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 21 place count 37 transition count 54
Iterating global reduction 1 with 14 rules applied. Total rules applied 35 place count 37 transition count 54
Graph (complete) has 21 edges and 37 vertex of which 36 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 36 place count 36 transition count 53
Applied a total of 36 rules in 189 ms. Remains 36 /49206 variables (removed 49170) and now considering 53/68887 (removed 68834) transitions.
// Phase 1: matrix 53 rows 36 cols
[2024-06-01 05:28:32] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:28:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 05:28:32] [INFO ] Invariant cache hit.
[2024-06-01 05:28:32] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-06-01 05:28:32] [INFO ] Redundant transitions in 21 ms returned [4, 38, 47, 51]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 49 rows 36 cols
[2024-06-01 05:28:32] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:28:32] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/49206 places, 49/68887 transitions.
Graph (complete) has 20 edges and 36 vertex of which 32 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 3 ms. Remains 32 /36 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 32 cols
[2024-06-01 05:28:32] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:28:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 05:28:32] [INFO ] Invariant cache hit.
[2024-06-01 05:28:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/49206 places, 45/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 505 ms. Remains : 32/49206 places, 45/68887 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s26 1) (EQ s29 1)), p0:(AND (EQ s14 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-15 finished in 773 ms.
All properties solved by simple procedures.
Total runtime 1410368 ms.

BK_STOP 1717219714124

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r461-smll-171701123100213"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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