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.r329-tall-171662361400033.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 QuasiCertifProtocol-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 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 3.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 131K 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 QuasiCertifProtocol-COL-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716766346952

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=QuasiCertifProtocol-COL-32
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 23:32:28] [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-05-26 23:32:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:32:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 23:32:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 23:32:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 735 ms
[2024-05-26 23:32:29] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 23:32:29] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-26 23:32:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10025 steps, including 231 resets, run finished after 130 ms. (steps per millisecond=77 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 23:32:30] [INFO ] Computed 5 invariants in 4 ms
[2024-05-26 23:32:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-26 23:32:30] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:11
[2024-05-26 23:32:30] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:11
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-26 23:32:30] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:11
[2024-05-26 23:32:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:32:30] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-26 23:32:31] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-26 23:32:31] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 10 different solutions.
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 13 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-26 23:32:31] [INFO ] Flatten gal took : 30 ms
[2024-05-26 23:32:31] [INFO ] Flatten gal took : 4 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-05-26 23:32:31] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 31 ms.
[2024-05-26 23:32:31] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 2580 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 170 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:32:31] [INFO ] Computed 3232 invariants in 187 ms
[2024-05-26 23:32:33] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2024-05-26 23:32:33] [INFO ] Invariant cache hit.
[2024-05-26 23:32:37] [INFO ] Implicit Places using invariants and state equation in 4219 ms returned []
Implicit Place search using SMT with State Equation took 5826 ms to find 0 implicit places.
[2024-05-26 23:32:37] [INFO ] Invariant cache hit.
[2024-05-26 23:32:38] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7465 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 2580 out of 3736 places after structural reductions.
[2024-05-26 23:32:39] [INFO ] Flatten gal took : 220 ms
[2024-05-26 23:32:39] [INFO ] Flatten gal took : 149 ms
[2024-05-26 23:32:39] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-26 23:32:40] [INFO ] Invariant cache hit.
[2024-05-26 23:32:42] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 702 ms returned sat
[2024-05-26 23:32:43] [INFO ] After 2164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-26 23:32:44] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 725 ms returned sat
[2024-05-26 23:32:54] [INFO ] After 8385ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-05-26 23:33:00] [INFO ] After 15088ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:695)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
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-05-26 23:33:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-26 23:33:08] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 14 properties in 83 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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' '!(G((F(p0)&&F(G((p1||F(p2)))))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.45 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 773 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-26 23:33:09] [INFO ] Computed 3200 invariants in 75 ms
[2024-05-26 23:33:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 23:33:12] [INFO ] Implicit Places using invariants in 3241 ms returned []
[2024-05-26 23:33:12] [INFO ] Invariant cache hit.
[2024-05-26 23:33:21] [INFO ] Implicit Places using invariants and state equation in 9151 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 12398 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 399 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13571 ms. Remains : 3634/3736 places, 502/506 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 251 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s3632 1), p1:(AND (OR (LT s0 1) (LT s3400 1)) (OR (LT s0 1) (LT s3401 1)) (OR (LT s0 1) (LT s3402 1)) (OR (LT s0 1) (LT s3411 1)) (OR (LT s0 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2465 reset in 696 ms.
Product exploration explored 100000 steps with 2463 reset in 588 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 15895 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&&F(p1))) U X((F(p2) U (p3 U p1)))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 120 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:33:24] [INFO ] Computed 3232 invariants in 72 ms
[2024-05-26 23:33:27] [INFO ] Implicit Places using invariants in 2495 ms returned []
[2024-05-26 23:33:27] [INFO ] Invariant cache hit.
[2024-05-26 23:33:32] [INFO ] Implicit Places using invariants and state equation in 5690 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 8198 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 114 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8433 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s3466 1)) (OR (LT s0 1) (LT s3467 1)) (OR (LT s0 1) (LT s3468 1)) (OR (LT s0 1) (LT s3477 1)) (OR (LT s0 1) (LT s3478 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 8781 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' '!((p0 U G((!p1&&X(!p1)))))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.18 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 573 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-26 23:33:34] [INFO ] Computed 3200 invariants in 74 ms
[2024-05-26 23:33:40] [INFO ] Implicit Places using invariants in 6184 ms returned []
[2024-05-26 23:33:40] [INFO ] Invariant cache hit.
[2024-05-26 23:33:50] [INFO ] Implicit Places using invariants and state equation in 10577 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16774 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 266 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17614 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 118 ms :[p1, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3573 1)) (AND (GEQ s0 1) (GEQ s3572 1)) (AND (GEQ s0 1) (GEQ s3571 1)) (AND (GEQ s0 1) (GEQ s3570 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2455 reset in 784 ms.
Product exploration explored 100000 steps with 2463 reset in 739 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 196 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, p1]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3673 steps, run visited all 1 properties in 28 ms. (steps per millisecond=131 )
Probabilistic random walk after 3673 steps, saw 3605 distinct states, run finished after 29 ms. (steps per millisecond=126 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 14 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-02 finished in 20553 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((X(G(p0))||(G(p1) U !p2))))))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 275 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:33:54] [INFO ] Computed 3232 invariants in 67 ms
[2024-05-26 23:33:57] [INFO ] Implicit Places using invariants in 3192 ms returned []
[2024-05-26 23:33:57] [INFO ] Invariant cache hit.
[2024-05-26 23:34:07] [INFO ] Implicit Places using invariants and state equation in 10553 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13750 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 233 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14259 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 451 ms :[true, (OR (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={} source=9 dest: 8}]], initial=9, aps=[p1:(LT s3701 1), p2:(LT s3700 1), p0:(GEQ s3702 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]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-03 finished in 14736 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&&F(p1)))))'
Support contains 101 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 233 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-26 23:34:08] [INFO ] Invariant cache hit.
[2024-05-26 23:34:12] [INFO ] Implicit Places using invariants in 3128 ms returned []
[2024-05-26 23:34:12] [INFO ] Invariant cache hit.
[2024-05-26 23:34:22] [INFO ] Implicit Places using invariants and state equation in 10782 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13935 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 231 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14402 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3466 1)) (AND (GEQ s0 1) (GEQ s3467 1)) (AND (GEQ s0 1) (GEQ s3468 1)) (AND (GEQ s0 1) (GEQ s3477 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-04 finished in 14569 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&&G(((!p1 U p2) U !p0)))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 524 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-26 23:34:23] [INFO ] Computed 3200 invariants in 74 ms
[2024-05-26 23:34:29] [INFO ] Implicit Places using invariants in 6135 ms returned []
[2024-05-26 23:34:29] [INFO ] Invariant cache hit.
[2024-05-26 23:34:40] [INFO ] Implicit Places using invariants and state equation in 10129 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16266 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 314 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17104 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 172 ms :[p0, p0, (AND p0 (NOT p2)), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3301 1) (GEQ s3302 1) (GEQ s3303 1) (GEQ s3304 1) (GEQ s3305 1) (GEQ s3306 1) (GEQ s3307 1) (GEQ s3308 1) (GEQ s3309 1) (GEQ s3310 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2469 reset in 369 ms.
Product exploration explored 100000 steps with 2469 reset in 376 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 15 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 18678 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)))'
Support contains 1122 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 1425 are kept as prefixes of interest. Removing 2311 places using SCC suffix rule.8 ms
Discarding 2311 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 1422 transition count 304
Applied a total of 103 rules in 81 ms. Remains 1422 /3736 variables (removed 2314) and now considering 304/506 (removed 202) transitions.
// Phase 1: matrix 304 rows 1422 cols
[2024-05-26 23:34:42] [INFO ] Computed 1120 invariants in 6 ms
[2024-05-26 23:34:42] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-26 23:34:42] [INFO ] Invariant cache hit.
[2024-05-26 23:34:43] [INFO ] Implicit Places using invariants and state equation in 859 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 1338 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1389/3736 places, 304/506 transitions.
Applied a total of 0 rules in 12 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1431 ms. Remains : 1389/3736 places, 304/506 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s36 1) (GEQ s69 1) (GEQ s102 1) (GEQ s135 1) (GEQ s168 1) (GEQ s201 1) (GEQ s234 1) (GEQ s267 1) (GEQ s300 1) (GEQ s333 1) (GE...], 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 40 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-07 finished in 1555 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(G(!p0))&&F(!p1)))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 241 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:34:43] [INFO ] Computed 3232 invariants in 82 ms
[2024-05-26 23:34:49] [INFO ] Implicit Places using invariants in 6147 ms returned []
[2024-05-26 23:34:49] [INFO ] Invariant cache hit.
[2024-05-26 23:34:59] [INFO ] Implicit Places using invariants and state equation in 9519 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15675 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 238 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16156 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 131 ms :[p0, true, (OR p0 p1), (OR p1 p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s3700 1), p1:(GEQ s3698 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-08 finished in 16316 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)))'
Support contains 34 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-26 23:35:00] [INFO ] Invariant cache hit.
[2024-05-26 23:35:06] [INFO ] Implicit Places using invariants in 6337 ms returned []
[2024-05-26 23:35:06] [INFO ] Invariant cache hit.
[2024-05-26 23:35:17] [INFO ] Implicit Places using invariants and state equation in 11139 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17490 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 231 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17966 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s3622 1)) (OR (LT s0 1) (LT s3623 1)) (OR (LT s0 1) (LT s3620 1)) (OR (LT s0 1) (LT s3621 1)) (OR (LT s0 1) (LT s3627 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-09 finished in 18061 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)||(X(p1)&&p2))))))'
Support contains 166 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-26 23:35:18] [INFO ] Invariant cache hit.
[2024-05-26 23:35:24] [INFO ] Implicit Places using invariants in 6139 ms returned []
[2024-05-26 23:35:24] [INFO ] Invariant cache hit.
[2024-05-26 23:35:34] [INFO ] Implicit Places using invariants and state equation in 10191 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16333 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16811 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s3318 1) (GEQ s3582 1)) (AND (GEQ s3313 1) (GEQ s3577 1)) (AND (GEQ s3329 1) (GEQ s3593 1)) (AND (GEQ s3328 1) (GEQ s3592 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-10 finished in 17025 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((G(p1)||X(G(p2))||p0)))'
Support contains 1190 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 114 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-26 23:35:34] [INFO ] Invariant cache hit.
[2024-05-26 23:35:38] [INFO ] Implicit Places using invariants in 3840 ms returned []
[2024-05-26 23:35:38] [INFO ] Invariant cache hit.
[2024-05-26 23:35:44] [INFO ] Implicit Places using invariants and state equation in 5599 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 9454 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 116 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9684 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s2146 1) (GEQ s2147 1) (GEQ s2148 1) (GEQ s2149 1) (GEQ s2150 1) (GEQ s2151 1) (GEQ s2152 1) (GEQ s2153 1) (GEQ s2154 1) (GEQ s2155 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2678 reset in 792 ms.
Product exploration explored 100000 steps with 2672 reset in 783 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 840 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 490382 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 490382 steps, saw 85190 distinct states, run finished after 3002 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2024-05-26 23:35:51] [INFO ] Computed 3200 invariants in 457 ms
[2024-05-26 23:35:52] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 701 ms returned sat
[2024-05-26 23:35:52] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 23:35:53] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 737 ms returned sat
[2024-05-26 23:35:56] [INFO ] After 2438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 23:36:05] [INFO ] After 11793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-26 23:36:05] [INFO ] After 12970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 22 factoid took 1132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-12 finished in 31940 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) U p1))'
Support contains 1123 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 1425 are kept as prefixes of interest. Removing 2311 places using SCC suffix rule.12 ms
Discarding 2311 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 1423 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 1423 transition count 305
Applied a total of 102 rules in 67 ms. Remains 1423 /3736 variables (removed 2313) and now considering 305/506 (removed 201) transitions.
// Phase 1: matrix 305 rows 1423 cols
[2024-05-26 23:36:06] [INFO ] Computed 1120 invariants in 10 ms
[2024-05-26 23:36:07] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-26 23:36:07] [INFO ] Invariant cache hit.
[2024-05-26 23:36:08] [INFO ] Implicit Places using invariants and state equation in 825 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 1265 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1390/3736 places, 305/506 transitions.
Applied a total of 0 rules in 11 ms. Remains 1390 /1390 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1343 ms. Remains : 1390/3736 places, 305/506 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ 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=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1387 1), p0:(OR (AND (GEQ s3 1) (GEQ s36 1) (GEQ s69 1) (GEQ s102 1) (GEQ s135 1) (GEQ s168 1) (GEQ s201 1) (GEQ s234 1) (GEQ s267 1) (GEQ s300 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]]
Product exploration explored 100000 steps with 2446 reset in 658 ms.
Product exploration explored 100000 steps with 2438 reset in 727 ms.
Computed a total of 1390 stabilizing places and 305 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1390 transition count 305
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) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 151 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 808214 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 808214 steps, saw 136023 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 305 rows 1390 cols
[2024-05-26 23:36:14] [INFO ] Computed 1088 invariants in 8 ms
[2024-05-26 23:36:14] [INFO ] [Real]Absence check using 0 positive and 1088 generalized place invariants in 186 ms returned sat
[2024-05-26 23:36:15] [INFO ] After 1083ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-26 23:36:16] [INFO ] After 1821ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 1217 ms.
[2024-05-26 23:36:17] [INFO ] After 3566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2024-05-26 23:36:18] [INFO ] [Nat]Absence check using 0 positive and 1088 generalized place invariants in 176 ms returned sat
[2024-05-26 23:36:20] [INFO ] After 2212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 23:36:22] [INFO ] After 4613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1824 ms.
[2024-05-26 23:36:24] [INFO ] After 6966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 152 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=30 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 10 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-13 finished in 18101 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((X(!p2)||p1))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 253 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:36:25] [INFO ] Computed 3232 invariants in 70 ms
[2024-05-26 23:36:31] [INFO ] Implicit Places using invariants in 6161 ms returned []
[2024-05-26 23:36:31] [INFO ] Invariant cache hit.
[2024-05-26 23:36:41] [INFO ] Implicit Places using invariants and state equation in 10110 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16288 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 242 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16783 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, p2, (AND p0 p2), (AND (NOT p1) p2), (AND p2 (NOT p1) p0), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(LT s3700 1), p1:(OR (AND (GEQ s0 1) (GEQ s3574 1)) (AND (GEQ s0 1) (GEQ s3575 1)) (AND (GEQ s0 1) (GEQ s3572 1)) (AND (GEQ s0 1) (GEQ s3573 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2675 reset in 333 ms.
Product exploration explored 100000 steps with 2679 reset in 366 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 p2 (NOT p1) (NOT p0)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 2773 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, p0]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1821 steps, run visited all 1 properties in 7 ms. (steps per millisecond=260 )
Probabilistic random walk after 1821 steps, saw 1788 distinct states, run finished after 7 ms. (steps per millisecond=260 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 34 factoid took 3456 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-14 finished in 24723 ms.
All properties solved by simple procedures.
Total runtime 261153 ms.

BK_STOP 1716766611107

--------------------
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="QuasiCertifProtocol-COL-32"
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 QuasiCertifProtocol-COL-32, 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 r329-tall-171662361400033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 ;