fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912700501284
Last Updated
May 14, 2023

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
7882.808 733668.00 798996.00 6450.10 FFFFFTFFTFFFFFTT 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-167912700501284.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700501284
=====================================================================

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

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=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 202303021504
[2023-03-20 18:26:38] [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]
[2023-03-20 18:26:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:26:40] [INFO ] Load time of PNML (sax parser for PT used): 1192 ms
[2023-03-20 18:26:40] [INFO ] Transformed 49206 places.
[2023-03-20 18:26:40] [INFO ] Transformed 68887 transitions.
[2023-03-20 18:26:40] [INFO ] Parsed PT model containing 49206 places and 68887 transitions and 157456 arcs in 1501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 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 307 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:27:12] [INFO ] Invariants computation overflowed in 31476 ms
[2023-03-20 18:27:17] [INFO ] Implicit Places using invariants in 35769 ms returned []
Implicit Place search using SMT only with invariants took 35794 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:27:56] [INFO ] Invariants computation overflowed in 38985 ms
[2023-03-20 18:27:59] [INFO ] Dead Transitions using invariants and state equation in 42694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78816 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Support contains 52 out of 49206 places after structural reductions.
[2023-03-20 18:28:02] [INFO ] Flatten gal took : 2324 ms
[2023-03-20 18:28:04] [INFO ] Flatten gal took : 1882 ms
[2023-03-20 18:28:08] [INFO ] Input system was already deterministic with 68887 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 3431 ms. (steps per millisecond=2 ) properties (out of 25) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=4 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=4 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=3 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 242 ms. (steps per millisecond=4 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:28:55] [INFO ] Invariants computation overflowed in 39457 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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 18:29:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 18:29:21] [INFO ] After 25309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 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.90 ms
Discarding 48969 places :
Also discarding 68346 output transitions
Drop transitions removed 68346 transitions
Drop transitions removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 394 rules applied. Total rules applied 395 place count 237 transition count 147
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 469 place count 163 transition count 147
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 469 place count 163 transition count 125
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 513 place count 141 transition count 125
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 535 place count 119 transition count 103
Iterating global reduction 2 with 22 rules applied. Total rules applied 557 place count 119 transition count 103
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 585 place count 105 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 586 place count 104 transition count 88
Applied a total of 586 rules in 329 ms. Remains 104 /49206 variables (removed 49102) and now considering 88/68887 (removed 68799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 104/49206 places, 88/68887 transitions.
Finished random walk after 356 steps, including 6 resets, run visited all 18 properties in 7 ms. (steps per millisecond=50 )
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' '!(X(G(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 143 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:05] [INFO ] Invariants computation overflowed in 43448 ms
[2023-03-20 18:30:09] [INFO ] Implicit Places using invariants in 47445 ms returned []
Implicit Place search using SMT only with invariants took 47451 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:30:43] [INFO ] Invariants computation overflowed in 33525 ms
[2023-03-20 18:30:47] [INFO ] Dead Transitions using invariants and state equation in 37605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85206 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-00 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:(AND (GEQ s31886 1) (GEQ s31891 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 14 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-00 finished in 85593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 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 105 are kept as prefixes of interest. Removing 49101 places using SCC suffix rule.68 ms
Discarding 49101 places :
Also discarding 68695 output transitions
Drop transitions removed 68695 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 104 transition count 181
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 72 transition count 101
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 72 transition count 101
Applied a total of 75 rules in 158 ms. Remains 72 /49206 variables (removed 49134) and now considering 101/68887 (removed 68786) transitions.
// Phase 1: matrix 101 rows 72 cols
[2023-03-20 18:30:47] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-20 18:30:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 18:30:47] [INFO ] Invariant cache hit.
[2023-03-20 18:30:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-20 18:30:47] [INFO ] Redundant transitions in 35 ms returned [13, 60, 62, 64, 80, 91]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 95 rows 72 cols
[2023-03-20 18:30:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 18:30:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/49206 places, 95/68887 transitions.
Graph (complete) has 42 edges and 72 vertex of which 66 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 9 ms. Remains 66 /72 variables (removed 6) and now considering 89/95 (removed 6) transitions.
// Phase 1: matrix 89 rows 66 cols
[2023-03-20 18:30:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:30:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 18:30:48] [INFO ] Invariant cache hit.
[2023-03-20 18:30:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/49206 places, 89/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 557 ms. Remains : 66/49206 places, 89/68887 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s59 1)) (AND (GEQ s20 1) (GEQ s23 1) (GEQ s40 1) (GEQ s42 1) (GEQ s57 1) (GEQ s59 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-02 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(p2)||p1)&&p0))))'
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 129 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:31:23] [INFO ] Invariants computation overflowed in 35343 ms
[2023-03-20 18:31:27] [INFO ] Implicit Places using invariants in 39445 ms returned []
Implicit Place search using SMT only with invariants took 39447 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:31:54] [INFO ] Invariants computation overflowed in 26516 ms
[2023-03-20 18:31:57] [INFO ] Dead Transitions using invariants and state equation in 30111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69694 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s47820 1) (LT s47823 1)), p0:(AND (GEQ s47820 1) (GEQ s47823 1) (OR (LT s47820 1) (LT s47823 1) (GEQ s2497 1))), p2:(AND (GEQ s4512 1) (GEQ s45...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 57 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-03 finished in 70054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0)) U (F(G((p2 U p0)))&&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 182 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:32:46] [INFO ] Invariants computation overflowed in 47641 ms
[2023-03-20 18:32:49] [INFO ] Implicit Places using invariants in 51416 ms returned []
Implicit Place search using SMT only with invariants took 51440 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:33:32] [INFO ] Invariants computation overflowed in 42733 ms
[2023-03-20 18:33:36] [INFO ] Dead Transitions using invariants and state equation in 46453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98081 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(OR p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s24776 1) (GEQ s24784 1)), p0:(AND (GEQ s4313 1) (GEQ s4329 1)), p2:(AND (GEQ s30831 1) (GEQ s30837 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 11 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-04 finished in 98558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 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.41 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 136 ms. Remains 43 /49206 variables (removed 49163) and now considering 59/68887 (removed 68828) transitions.
// Phase 1: matrix 59 rows 43 cols
[2023-03-20 18:33:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 18:33:37] [INFO ] Invariant cache hit.
[2023-03-20 18:33:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-20 18:33:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:33:37] [INFO ] Invariant cache hit.
[2023-03-20 18:33:37] [INFO ] Dead Transitions using invariants and state equation in 47 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 279 ms. Remains : 43/49206 places, 59/68887 transitions.
Stuttering acceptance computed with spot in 58 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 (LT s16 1) (LT s19 1)) (OR (LT s36 1) (LT s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6090 reset in 319 ms.
Product exploration explored 100000 steps with 6122 reset in 180 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 :(F (G p0))
Knowledge based reduction with 4 factoid took 110 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 1039 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.35 ms
Discarding 49169 places :
Also discarding 68818 output transitions
Drop transitions removed 68818 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 36 transition count 66
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 23 transition count 33
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 23 transition count 33
Applied a total of 29 rules in 87 ms. Remains 23 /49206 variables (removed 49183) and now considering 33/68887 (removed 68854) transitions.
// Phase 1: matrix 33 rows 23 cols
[2023-03-20 18:33:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 18:33:38] [INFO ] Invariant cache hit.
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-20 18:33:38] [INFO ] Redundant transitions in 10 ms returned [11, 25]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 31 rows 23 cols
[2023-03-20 18:33:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/49206 places, 31/68887 transitions.
Graph (complete) has 13 edges and 23 vertex of which 21 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
Applied a total of 1 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 29/31 (removed 2) transitions.
// Phase 1: matrix 29 rows 21 cols
[2023-03-20 18:33:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 18:33:38] [INFO ] Invariant cache hit.
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants and state equation in 25 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 : 21/49206 places, 29/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 21/49206 places, 29/68887 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-06 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:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-06 finished in 366 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(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.34 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 90 ms. Remains 48 /49206 variables (removed 49158) and now considering 68/68887 (removed 68819) transitions.
// Phase 1: matrix 68 rows 48 cols
[2023-03-20 18:33:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 18:33:38] [INFO ] Invariant cache hit.
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-20 18:33:38] [INFO ] Redundant transitions in 11 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
[2023-03-20 18:33:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 18:33:38] [INFO ] Dead Transitions using invariants and state equation in 38 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 1 ms. Remains 44 /48 variables (removed 4) and now considering 60/64 (removed 4) transitions.
// Phase 1: matrix 60 rows 44 cols
[2023-03-20 18:33:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 18:33:38] [INFO ] Invariant cache hit.
[2023-03-20 18:33:38] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 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 297 ms. Remains : 44/49206 places, 60/68887 transitions.
Stuttering acceptance computed with spot in 78 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:(GEQ s15 1), p0:(OR (LT s31 1) (LT 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 4620 reset in 197 ms.
Product exploration explored 100000 steps with 4611 reset in 170 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 :(F (G p0))
Knowledge based reduction with 7 factoid took 185 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 1002 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||(G(F(p1)) U 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 76 are kept as prefixes of interest. Removing 49130 places using SCC suffix rule.28 ms
Discarding 49130 places :
Also discarding 68749 output transitions
Drop transitions removed 68749 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 75 transition count 131
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 30 place count 52 transition count 73
Iterating global reduction 1 with 23 rules applied. Total rules applied 53 place count 52 transition count 73
Graph (complete) has 30 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 51 transition count 72
Applied a total of 54 rules in 85 ms. Remains 51 /49206 variables (removed 49155) and now considering 72/68887 (removed 68815) transitions.
// Phase 1: matrix 72 rows 51 cols
[2023-03-20 18:33:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 18:33:39] [INFO ] Invariant cache hit.
[2023-03-20 18:33:39] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-20 18:33:39] [INFO ] Redundant transitions in 14 ms returned [6, 10, 26, 53, 70]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 67 rows 51 cols
[2023-03-20 18:33:39] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 18:33:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/49206 places, 67/68887 transitions.
Graph (complete) has 29 edges and 51 vertex of which 46 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 1 ms. Remains 46 /51 variables (removed 5) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 46 cols
[2023-03-20 18:33:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 18:33:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 18:33:39] [INFO ] Invariant cache hit.
[2023-03-20 18:33:39] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/49206 places, 62/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 46/49206 places, 62/68887 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-09 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) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s37 1) (GEQ s40 1)), p1:(AND (GEQ s16 1) (GEQ s18 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 19 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-09 finished in 427 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))&&F(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 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:34:14] [INFO ] Invariants computation overflowed in 34715 ms
[2023-03-20 18:34:18] [INFO ] Implicit Places using invariants in 38264 ms returned []
Implicit Place search using SMT only with invariants took 38265 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:34:52] [INFO ] Invariants computation overflowed in 34818 ms
[2023-03-20 18:34:56] [INFO ] Dead Transitions using invariants and state equation in 38574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76981 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s46260 1) (LT s46269 1)), p1:(AND (GEQ s20525 1) (GEQ s20532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 35 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-10 finished in 77269 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)||X(p1)||(p2&&X(F(p3))))))'
Support contains 7 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 115 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:35:33] [INFO ] Invariants computation overflowed in 36662 ms
[2023-03-20 18:35:37] [INFO ] Implicit Places using invariants in 40725 ms returned []
Implicit Place search using SMT only with invariants took 40728 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:36:12] [INFO ] Invariants computation overflowed in 35149 ms
[2023-03-20 18:36:16] [INFO ] Dead Transitions using invariants and state equation in 38833 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79689 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 402 ms :[true, (NOT p1), (NOT p3), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=4, aps=[p1:(AND (GEQ s3713 1) (GEQ s3721 1)), p3:(GEQ s22841 1), p0:(OR (LT s6386 1) (LT s6407 1)), p2:(OR (LT s47661 1) (LT s47663 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9111 steps with 58 reset in 2345 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-11 finished in 82569 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))&&(X(p1)||G(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 149 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:36:58] [INFO ] Invariants computation overflowed in 38687 ms
[2023-03-20 18:37:01] [INFO ] Implicit Places using invariants in 42190 ms returned []
Implicit Place search using SMT only with invariants took 42204 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:37:34] [INFO ] Invariants computation overflowed in 32789 ms
[2023-03-20 18:37:38] [INFO ] Dead Transitions using invariants and state equation in 36718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79095 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s14050 1) (GEQ s14052 1)), p0:(AND (GEQ s19221 1) (GEQ s19224 1)), p1:(AND (GEQ s12102 1) (GEQ s12129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 10 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-12 finished in 79443 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(p0)&&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 134 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:38:14] [INFO ] Invariants computation overflowed in 34894 ms
[2023-03-20 18:38:17] [INFO ] Implicit Places using invariants in 38463 ms returned []
Implicit Place search using SMT only with invariants took 38468 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 18:38:44] [INFO ] Invariants computation overflowed in 26999 ms
[2023-03-20 18:38:48] [INFO ] Dead Transitions using invariants and state equation in 30630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69236 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s39650 1) (GEQ s39656 1)), p0:(AND (GEQ s4424 1) (GEQ s4445 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 10 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLFireability-13 finished in 69566 ms.
All properties solved by simple procedures.
Total runtime 729553 ms.

BK_STOP 1679337529804

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="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 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 r485-tall-167912700501284"
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 ;