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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 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 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K 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 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 1678989361829

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=QuasiCertifProtocol-COL-32
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 17:56:03] [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-16 17:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:56:03] [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.
[2023-03-16 17:56:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 17:56:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 479 ms
[2023-03-16 17:56:03] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 17:56:04] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 303 ms.
[2023-03-16 17:56:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE 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 11 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 10007 steps, including 231 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 17:56:05] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-16 17:56:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 17:56:05] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 17:56:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 17:56:05] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-16 17:56:05] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-16 17:56:05] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Parikh walk visited 9 properties in 6 ms.
[2023-03-16 17:56:05] [INFO ] Flatten gal took : 28 ms
[2023-03-16 17:56:05] [INFO ] Flatten gal took : 4 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-16 17:56:05] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 29 ms.
[2023-03-16 17:56:05] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 3637 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 28 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 17:56:05] [INFO ] Computed 3232 place invariants in 205 ms
[2023-03-16 17:56:06] [INFO ] Implicit Places using invariants in 1387 ms returned []
[2023-03-16 17:56:06] [INFO ] Invariant cache hit.
[2023-03-16 17:56:09] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 3980 ms to find 0 implicit places.
[2023-03-16 17:56:09] [INFO ] Invariant cache hit.
[2023-03-16 17:56:10] [INFO ] Dead Transitions using invariants and state equation in 1386 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 5396 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3637 out of 3736 places after structural reductions.
[2023-03-16 17:56:11] [INFO ] Flatten gal took : 233 ms
[2023-03-16 17:56:11] [INFO ] Flatten gal took : 162 ms
[2023-03-16 17:56:12] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-16 17:56:12] [INFO ] Invariant cache hit.
[2023-03-16 17:56:15] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 715 ms returned sat
[2023-03-16 17:56:15] [INFO ] After 2558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-16 17:56:17] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 669 ms returned sat
[2023-03-16 17:56:40] [INFO ] After 21500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-16 17:56:40] [INFO ] After 22191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 17:56:40] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 16 Parikh solutions to 14 different solutions.
Finished Parikh walk after 237 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=39 )
Parikh walk visited 16 properties in 50 ms.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(G(p2))||p1))))'
Support contains 1222 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.43 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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3700 transition count 502
Applied a total of 4 rules in 821 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-16 17:56:42] [INFO ] Computed 3200 place invariants in 117 ms
[2023-03-16 17:56:46] [INFO ] Implicit Places using invariants in 3728 ms returned []
[2023-03-16 17:56:46] [INFO ] Invariant cache hit.
[2023-03-16 17:56:51] [INFO ] Implicit Places using invariants and state equation in 5525 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 9260 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 158 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 10244 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3492 1)) (AND (GEQ s0 1) (GEQ s3490 1)) (AND (GEQ s0 1) (GEQ s3493 1)) (AND (GEQ s0 1) (GEQ s3491 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][true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 10574 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(p1)||G(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.16 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 557 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-16 17:56:52] [INFO ] Computed 3200 place invariants in 93 ms
[2023-03-16 17:56:58] [INFO ] Implicit Places using invariants in 6154 ms returned []
[2023-03-16 17:56:58] [INFO ] Invariant cache hit.
[2023-03-16 17:57:09] [INFO ] Implicit Places using invariants and state equation in 11230 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 17395 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 308 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 18262 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s3600 1) (LT s3601 1) (LT s3598 1) (LT s3599 1) (LT s3608 1) (LT s3609 1) (LT s3606 1) (LT s3607 1) (LT s3604 1) (LT s3605 1) (LT s3602 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2464 reset in 703 ms.
Product exploration explored 100000 steps with 2462 reset in 642 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 300 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 20577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 1156 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 119 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 17:57:12] [INFO ] Computed 3232 place invariants in 65 ms
[2023-03-16 17:57:17] [INFO ] Implicit Places using invariants in 4858 ms returned []
[2023-03-16 17:57:17] [INFO ] Invariant cache hit.
[2023-03-16 17:57:25] [INFO ] Implicit Places using invariants and state equation in 7571 ms returned []
Implicit Place search using SMT with State Equation took 12438 ms to find 0 implicit places.
[2023-03-16 17:57:25] [INFO ] Invariant cache hit.
[2023-03-16 17:57:26] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13933 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-02 finished in 14121 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((G(p1)||p0))))'
Support contains 1156 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.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 282 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-16 17:57:27] [INFO ] Computed 3200 place invariants in 64 ms
[2023-03-16 17:57:29] [INFO ] Implicit Places using invariants in 2115 ms returned []
[2023-03-16 17:57:29] [INFO ] Invariant cache hit.
[2023-03-16 17:57:37] [INFO ] Implicit Places using invariants and state equation in 8250 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]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 10370 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3666/3736 places, 501/506 transitions.
Applied a total of 0 rules in 147 ms. Remains 3666 /3666 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10800 ms. Remains : 3666/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03 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:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], 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 38 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 10887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p1))))'
Support contains 67 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 230 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 17:57:37] [INFO ] Computed 3232 place invariants in 72 ms
[2023-03-16 17:57:43] [INFO ] Implicit Places using invariants in 5965 ms returned []
[2023-03-16 17:57:43] [INFO ] Invariant cache hit.
[2023-03-16 17:57:54] [INFO ] Implicit Places using invariants and state equation in 10906 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 16893 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 17363 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 137 ms :[p1, p1, true, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s3666 1) (LT s3667 1) (LT s3664 1) (LT s3665 1) (LT s3674 1) (LT s3675 1) (LT s3672 1) (LT s3673 1) (LT s3670 1) (LT s3671 1) (LT s3668 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 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 17526 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(((p1&&X(p1))||p0))&&(X(G(p2))||F(p3))))'
Support contains 2245 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 41 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-16 17:57:55] [INFO ] Invariant cache hit.
[2023-03-16 17:57:58] [INFO ] Implicit Places using invariants in 3674 ms returned []
[2023-03-16 17:57:58] [INFO ] Invariant cache hit.
[2023-03-16 17:58:05] [INFO ] Implicit Places using invariants and state equation in 6212 ms returned []
Implicit Place search using SMT with State Equation took 9889 ms to find 0 implicit places.
[2023-03-16 17:58:05] [INFO ] Invariant cache hit.
[2023-03-16 17:58:06] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11306 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 262 steps with 93 reset in 8 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-05 finished in 11566 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)) U G(p0)))'
Support contains 99 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 229 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-16 17:58:06] [INFO ] Invariant cache hit.
[2023-03-16 17:58:12] [INFO ] Implicit Places using invariants in 5904 ms returned []
[2023-03-16 17:58:12] [INFO ] Invariant cache hit.
[2023-03-16 17:58:23] [INFO ] Implicit Places using invariants and state equation in 10958 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 16865 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 224 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 17319 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s3666 1) (LT s3667 1) (LT s3664 1) (LT s3665 1) (LT s3674 1) (LT s3675 1) (LT s3672 1) (LT s3673 1) (LT s3670 1) (LT s3671 1) (LT s3668 1) (LT...], 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]]
Product exploration explored 100000 steps with 2674 reset in 492 ms.
Product exploration explored 100000 steps with 2678 reset in 473 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 p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 370 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9356 steps, run visited all 1 properties in 122 ms. (steps per millisecond=76 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 124 ms. (steps per millisecond=75 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 374 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 226 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-16 17:58:27] [INFO ] Computed 3200 place invariants in 443 ms
[2023-03-16 17:58:33] [INFO ] Implicit Places using invariants in 6606 ms returned []
[2023-03-16 17:58:33] [INFO ] Invariant cache hit.
[2023-03-16 17:58:46] [INFO ] Implicit Places using invariants and state equation in 12900 ms returned []
Implicit Place search using SMT with State Equation took 19510 ms to find 0 implicit places.
[2023-03-16 17:58:46] [INFO ] Invariant cache hit.
[2023-03-16 17:58:47] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21099 ms. Remains : 3703/3703 places, 506/506 transitions.
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9356 steps, run visited all 1 properties in 117 ms. (steps per millisecond=79 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 119 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2677 reset in 441 ms.
Product exploration explored 100000 steps with 2678 reset in 469 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 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
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3669 transition count 506
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 635 ms. Remains 3669 /3703 variables (removed 34) and now considering 506/506 (removed 0) transitions.
[2023-03-16 17:58:51] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 506 rows 3669 cols
[2023-03-16 17:58:51] [INFO ] Computed 3168 place invariants in 602 ms
[2023-03-16 17:58:53] [INFO ] Dead Transitions using invariants and state equation in 1965 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3703 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2675 ms. Remains : 3669/3703 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin6685250991241308921
[2023-03-16 17:58:53] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6685250991241308921
Running compilation step : cd /tmp/ltsmin6685250991241308921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2257 ms.
Running link step : cd /tmp/ltsmin6685250991241308921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6685250991241308921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9820967680927450444.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 332 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-16 17:59:09] [INFO ] Computed 3200 place invariants in 440 ms
[2023-03-16 17:59:15] [INFO ] Implicit Places using invariants in 6679 ms returned []
[2023-03-16 17:59:15] [INFO ] Invariant cache hit.
[2023-03-16 17:59:28] [INFO ] Implicit Places using invariants and state equation in 12996 ms returned []
Implicit Place search using SMT with State Equation took 19679 ms to find 0 implicit places.
[2023-03-16 17:59:28] [INFO ] Invariant cache hit.
[2023-03-16 17:59:30] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21375 ms. Remains : 3703/3703 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin330112704352431840
[2023-03-16 17:59:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin330112704352431840
Running compilation step : cd /tmp/ltsmin330112704352431840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2196 ms.
Running link step : cd /tmp/ltsmin330112704352431840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin330112704352431840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8637831252266094267.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:59:45] [INFO ] Flatten gal took : 102 ms
[2023-03-16 17:59:45] [INFO ] Flatten gal took : 97 ms
[2023-03-16 17:59:45] [INFO ] Time to serialize gal into /tmp/LTL12172519033340574791.gal : 21 ms
[2023-03-16 17:59:45] [INFO ] Time to serialize properties into /tmp/LTL2350643288388766743.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12172519033340574791.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4955362656186368384.hoa' '-atoms' '/tmp/LTL2350643288388766743.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2350643288388766743.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4955362656186368384.hoa
Detected timeout of ITS tools.
[2023-03-16 18:00:00] [INFO ] Flatten gal took : 97 ms
[2023-03-16 18:00:01] [INFO ] Flatten gal took : 90 ms
[2023-03-16 18:00:01] [INFO ] Time to serialize gal into /tmp/LTL17539572387443141432.gal : 12 ms
[2023-03-16 18:00:01] [INFO ] Time to serialize properties into /tmp/LTL3792791831478289797.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17539572387443141432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3792791831478289797.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((X(G("(((((((s6_2<1)&&(s6_3<1))&&((s6_0<1)&&(s6_1<1)))&&(((s6_10<1)&&(s6_11<1))&&((s6_8<1)&&(s6_9<1))))&&((((s6_6<1)&&(s6_7<1))&&(...1785
Formula 0 simplified : (XF!"(((((((s6_2<1)&&(s6_3<1))&&((s6_0<1)&&(s6_1<1)))&&(((s6_10<1)&&(s6_11<1))&&((s6_8<1)&&(s6_9<1))))&&((((s6_6<1)&&(s6_7<1))&&((s6...1774
Detected timeout of ITS tools.
[2023-03-16 18:00:16] [INFO ] Flatten gal took : 89 ms
[2023-03-16 18:00:16] [INFO ] Applying decomposition
[2023-03-16 18:00:16] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph585917029593040526.txt' '-o' '/tmp/graph585917029593040526.bin' '-w' '/tmp/graph585917029593040526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph585917029593040526.bin' '-l' '-1' '-v' '-w' '/tmp/graph585917029593040526.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:00:16] [INFO ] Decomposing Gal with order
[2023-03-16 18:00:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:00:17] [INFO ] Removed a total of 327 redundant transitions.
[2023-03-16 18:00:17] [INFO ] Flatten gal took : 498 ms
[2023-03-16 18:00:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 184 ms.
[2023-03-16 18:00:17] [INFO ] Time to serialize gal into /tmp/LTL9551554828237492569.gal : 28 ms
[2023-03-16 18:00:17] [INFO ] Time to serialize properties into /tmp/LTL2302100745155909225.ltl : 254 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9551554828237492569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2302100745155909225.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((X(G("(((((((u161.s6_2<1)&&(u162.s6_3<1))&&((u159.s6_0<1)&&(u160.s6_1<1)))&&(((u169.s6_10<1)&&(u170.s6_11<1))&&((u167.s6_8<1)&&(u1...2729
Formula 0 simplified : (XF!"(((((((u161.s6_2<1)&&(u162.s6_3<1))&&((u159.s6_0<1)&&(u160.s6_1<1)))&&(((u169.s6_10<1)&&(u170.s6_11<1))&&((u167.s6_8<1)&&(u168....2718
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2936858838595265670
[2023-03-16 18:00:32] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2936858838595265670
Running compilation step : cd /tmp/ltsmin2936858838595265670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2193 ms.
Running link step : cd /tmp/ltsmin2936858838595265670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2936858838595265670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 161376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(!p0) U p1) U p2)||G((G(p3)||X(p1))))))'
Support contains 1158 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 149 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 18:00:48] [INFO ] Computed 3232 place invariants in 64 ms
[2023-03-16 18:00:53] [INFO ] Implicit Places using invariants in 4962 ms returned []
[2023-03-16 18:00:53] [INFO ] Invariant cache hit.
[2023-03-16 18:01:03] [INFO ] Implicit Places using invariants and state equation in 10025 ms returned []
Implicit Place search using SMT with State Equation took 15002 ms to find 0 implicit places.
[2023-03-16 18:01:03] [INFO ] Invariant cache hit.
[2023-03-16 18:01:04] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16556 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 1143 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 11}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 10}], [{ cond=p0, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 8}, { cond=(NOT p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s3607 1)) (AND (GEQ s0 1) (GEQ s3608 1)) (AND (GEQ s0 1) (GEQ s3605 1)) (AND (GEQ s0 1) (GEQ s3606 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37 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 17755 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((X(G(p1))&&p0)))'
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.9 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 567 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-16 18:01:06] [INFO ] Computed 3200 place invariants in 62 ms
[2023-03-16 18:01:12] [INFO ] Implicit Places using invariants in 6087 ms returned []
[2023-03-16 18:01:12] [INFO ] Invariant cache hit.
[2023-03-16 18:01:23] [INFO ] Implicit Places using invariants and state equation in 10667 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 16756 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 283 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 17607 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s3573 1)) (OR (LT s0 1) (LT s3572 1)) (OR (LT s0 1) (LT s3571 1)) (OR (LT s0 1) (LT s3570 1)) (OR (LT s0 1) (LT s3577 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2460 reset in 748 ms.
Product exploration explored 100000 steps with 2465 reset in 824 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 474 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 527549 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 527549 steps, saw 89253 distinct states, run finished after 3002 ms. (steps per millisecond=175 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-16 18:01:30] [INFO ] Computed 3136 place invariants in 657 ms
[2023-03-16 18:01:31] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 683 ms returned sat
[2023-03-16 18:01:32] [INFO ] After 2447ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 507 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 35 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 279 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-16 18:01:33] [INFO ] Invariant cache hit.
[2023-03-16 18:01:39] [INFO ] Implicit Places using invariants in 5942 ms returned []
[2023-03-16 18:01:39] [INFO ] Invariant cache hit.
[2023-03-16 18:01:51] [INFO ] Implicit Places using invariants and state equation in 11604 ms returned []
Implicit Place search using SMT with State Equation took 17548 ms to find 0 implicit places.
[2023-03-16 18:01:51] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-16 18:01:51] [INFO ] Invariant cache hit.
[2023-03-16 18:01:52] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19188 ms. Remains : 3634/3634 places, 502/502 transitions.
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), (X p0), (X p1), (X (X p0)), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-08 finished in 47551 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 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.8 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 0 with 4 rules applied. Total rules applied 5 place count 3700 transition count 502
Applied a total of 5 rules in 540 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-16 18:01:53] [INFO ] Computed 3200 place invariants in 60 ms
[2023-03-16 18:02:00] [INFO ] Implicit Places using invariants in 6246 ms returned []
[2023-03-16 18:02:00] [INFO ] Invariant cache hit.
[2023-03-16 18:02:11] [INFO ] Implicit Places using invariants and state equation in 10909 ms returned [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 33 places :
Implicit Place search using SMT with State Equation took 17158 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3667/3736 places, 502/506 transitions.
Applied a total of 0 rules in 270 ms. Remains 3667 /3667 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17969 ms. Remains : 3667/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3525 1)) (AND (GEQ s0 1) (GEQ s3523 1)) (AND (GEQ s0 1) (GEQ s3526 1)) (AND (GEQ s0 1) (GEQ s3524 1)) (AND (GEQ s0 1) (GEQ s3...], 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 35 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 18024 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((p0 U (p1||G(p0))))))'
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 261 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 18:02:11] [INFO ] Computed 3232 place invariants in 65 ms
[2023-03-16 18:02:18] [INFO ] Implicit Places using invariants in 6501 ms returned []
[2023-03-16 18:02:18] [INFO ] Invariant cache hit.
[2023-03-16 18:02:29] [INFO ] Implicit Places using invariants and state equation in 11352 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 17861 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 255 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 18378 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 365 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s3700 1) (LT s3701 1)), p0:(LT s3700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22321 reset in 1012 ms.
Product exploration explored 100000 steps with 22557 reset in 1035 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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-16 18:02:33] [INFO ] Computed 3200 place invariants in 402 ms
[2023-03-16 18:02:34] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 694 ms returned sat
[2023-03-16 18:02:35] [INFO ] After 1289ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:02:35] [INFO ] After 1418ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-16 18:02:36] [INFO ] After 2575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 259 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-16 18:02:36] [INFO ] Invariant cache hit.
[2023-03-16 18:02:43] [INFO ] Implicit Places using invariants in 6393 ms returned []
[2023-03-16 18:02:43] [INFO ] Invariant cache hit.
[2023-03-16 18:02:56] [INFO ] Implicit Places using invariants and state equation in 13731 ms returned []
Implicit Place search using SMT with State Equation took 20126 ms to find 0 implicit places.
[2023-03-16 18:02:56] [INFO ] Invariant cache hit.
[2023-03-16 18:02:58] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21764 ms. Remains : 3703/3703 places, 506/506 transitions.
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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-03-16 18:02:59] [INFO ] Invariant cache hit.
[2023-03-16 18:03:00] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 730 ms returned sat
[2023-03-16 18:03:01] [INFO ] After 1336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:03:01] [INFO ] After 1461ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-16 18:03:01] [INFO ] After 2674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22386 reset in 1037 ms.
Product exploration explored 100000 steps with 22462 reset in 1049 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 103 are kept as prefixes of interest. Removing 3600 places using SCC suffix rule.8 ms
Discarding 3600 places :
Also discarding 237 output transitions
Drop transitions removed 237 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 103 transition count 71
Applied a total of 199 rules in 15 ms. Remains 103 /3703 variables (removed 3600) and now considering 71/506 (removed 435) transitions.
[2023-03-16 18:03:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 103 cols
[2023-03-16 18:03:04] [INFO ] Computed 32 place invariants in 0 ms
[2023-03-16 18:03:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/3703 places, 71/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 103/3703 places, 71/506 transitions.
Built C files in :
/tmp/ltsmin754688620885614617
[2023-03-16 18:03:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin754688620885614617
Running compilation step : cd /tmp/ltsmin754688620885614617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2260 ms.
Running link step : cd /tmp/ltsmin754688620885614617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin754688620885614617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15040147112292064759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 263 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-16 18:03:20] [INFO ] Computed 3200 place invariants in 428 ms
[2023-03-16 18:03:27] [INFO ] Implicit Places using invariants in 6836 ms returned []
[2023-03-16 18:03:27] [INFO ] Invariant cache hit.
[2023-03-16 18:03:40] [INFO ] Implicit Places using invariants and state equation in 13436 ms returned []
Implicit Place search using SMT with State Equation took 20276 ms to find 0 implicit places.
[2023-03-16 18:03:40] [INFO ] Invariant cache hit.
[2023-03-16 18:03:42] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22024 ms. Remains : 3703/3703 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin12113756620535687979
[2023-03-16 18:03:42] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12113756620535687979
Running compilation step : cd /tmp/ltsmin12113756620535687979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2310 ms.
Running link step : cd /tmp/ltsmin12113756620535687979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12113756620535687979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18239001847009743519.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:03:57] [INFO ] Flatten gal took : 90 ms
[2023-03-16 18:03:57] [INFO ] Flatten gal took : 81 ms
[2023-03-16 18:03:57] [INFO ] Time to serialize gal into /tmp/LTL18127196166386586779.gal : 10 ms
[2023-03-16 18:03:57] [INFO ] Time to serialize properties into /tmp/LTL8545459324685377549.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18127196166386586779.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18164577139136135047.hoa' '-atoms' '/tmp/LTL8545459324685377549.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8545459324685377549.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18164577139136135047.hoa
Detected timeout of ITS tools.
[2023-03-16 18:04:12] [INFO ] Flatten gal took : 91 ms
[2023-03-16 18:04:12] [INFO ] Flatten gal took : 79 ms
[2023-03-16 18:04:12] [INFO ] Time to serialize gal into /tmp/LTL5931811307252874222.gal : 9 ms
[2023-03-16 18:04:12] [INFO ] Time to serialize properties into /tmp/LTL5742047278097860104.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5931811307252874222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5742047278097860104.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(("(a2_0<1)")U((G("(a2_0<1)"))||("((a2_0<1)&&(a1_0<1))"))))))
Formula 0 simplified : XX(!"(a2_0<1)" M !"((a2_0<1)&&(a1_0<1))")
Detected timeout of ITS tools.
[2023-03-16 18:04:27] [INFO ] Flatten gal took : 79 ms
[2023-03-16 18:04:27] [INFO ] Applying decomposition
[2023-03-16 18:04:27] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph327778238489836982.txt' '-o' '/tmp/graph327778238489836982.bin' '-w' '/tmp/graph327778238489836982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph327778238489836982.bin' '-l' '-1' '-v' '-w' '/tmp/graph327778238489836982.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:04:28] [INFO ] Decomposing Gal with order
[2023-03-16 18:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:04:28] [INFO ] Removed a total of 329 redundant transitions.
[2023-03-16 18:04:28] [INFO ] Flatten gal took : 246 ms
[2023-03-16 18:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 96 ms.
[2023-03-16 18:04:28] [INFO ] Time to serialize gal into /tmp/LTL1003325320213575668.gal : 39 ms
[2023-03-16 18:04:28] [INFO ] Time to serialize properties into /tmp/LTL6273762058299315187.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1003325320213575668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6273762058299315187.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i13.i1.u191.a2_0<1)")U((G("(i13.i1.u191.a2_0<1)"))||("((i13.i1.u191.a2_0<1)&&(i13.i1.u192.a1_0<1))"))))))
Formula 0 simplified : XX(!"(i13.i1.u191.a2_0<1)" M !"((i13.i1.u191.a2_0<1)&&(i13.i1.u192.a1_0<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6920320508652783962
[2023-03-16 18:04:43] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6920320508652783962
Running compilation step : cd /tmp/ltsmin6920320508652783962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2252 ms.
Running link step : cd /tmp/ltsmin6920320508652783962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6920320508652783962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-11 finished in 167610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(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 267 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-16 18:04:59] [INFO ] Computed 3232 place invariants in 71 ms
[2023-03-16 18:05:05] [INFO ] Implicit Places using invariants in 6215 ms returned []
[2023-03-16 18:05:05] [INFO ] Invariant cache hit.
[2023-03-16 18:05:17] [INFO ] Implicit Places using invariants and state equation in 11553 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 17773 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 258 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 18298 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s0 1) (LT s3499 1)) (OR (LT s0 1) (LT s3509 1)) (OR (LT s0 1) (LT s3508 1)) (OR (LT s0 1) (LT s3511 1)) (OR (LT s0 1) (LT s3510 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3997 reset in 487 ms.
Product exploration explored 100000 steps with 4005 reset in 498 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 : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-12 finished in 20146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 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 256 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-16 18:05:19] [INFO ] Invariant cache hit.
[2023-03-16 18:05:22] [INFO ] Implicit Places using invariants in 3105 ms returned []
[2023-03-16 18:05:22] [INFO ] Invariant cache hit.
[2023-03-16 18:05:34] [INFO ] Implicit Places using invariants and state equation in 12351 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 15460 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 250 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 15967 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s3700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1234 ms.
Product exploration explored 100000 steps with 33333 reset in 1244 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 : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-13 finished in 19186 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((X((X((!p1 U (p2||G(!p1)))) U (p1&&X((!p1 U (p2||G(!p1)))))))||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 262 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-16 18:05:38] [INFO ] Invariant cache hit.
[2023-03-16 18:05:41] [INFO ] Implicit Places using invariants in 3083 ms returned []
[2023-03-16 18:05:41] [INFO ] Invariant cache hit.
[2023-03-16 18:05:52] [INFO ] Implicit Places using invariants and state equation in 11269 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 14357 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 248 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 14867 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p2)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s3601 1) (GEQ s3600 1) (GEQ s3603 1) (GEQ s3602 1) (GEQ s3599 1) (GEQ s3598 1) (GEQ s3609 1) (GEQ s3608 1) (GEQ s3611 1) (GEQ s3610 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13067 reset in 873 ms.
Product exploration explored 100000 steps with 12946 reset in 888 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 (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 458 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (AND (NOT p2) p1), true, false, false]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-16 18:05:57] [INFO ] Computed 3200 place invariants in 399 ms
[2023-03-16 18:05:58] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 688 ms returned sat
[2023-03-16 18:05:58] [INFO ] After 1229ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2023-03-16 18:05:59] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 688 ms returned sat
[2023-03-16 18:06:01] [INFO ] After 1523ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-16 18:06:01] [INFO ] After 1957ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-16 18:06:02] [INFO ] After 3542ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 74 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 5 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2)), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (OR p0 p2 (NOT p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p1), (F (AND (NOT p2) p1)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 658 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
[2023-03-16 18:06:02] [INFO ] Invariant cache hit.
[2023-03-16 18:06:09] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 5903 ms returned sat
[2023-03-16 18:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:06:17] [INFO ] [Real]Absence check using state equation in 7978 ms returned unknown
Could not prove EG (NOT p1)
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 266 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-16 18:06:18] [INFO ] Invariant cache hit.
[2023-03-16 18:06:24] [INFO ] Implicit Places using invariants in 6327 ms returned []
[2023-03-16 18:06:24] [INFO ] Invariant cache hit.
[2023-03-16 18:06:37] [INFO ] Implicit Places using invariants and state equation in 12960 ms returned []
Implicit Place search using SMT with State Equation took 19295 ms to find 0 implicit places.
[2023-03-16 18:06:37] [INFO ] Invariant cache hit.
[2023-03-16 18:06:38] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20945 ms. Remains : 3703/3703 places, 506/506 transitions.
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)), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511150 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511150 steps, saw 87590 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:06:42] [INFO ] Invariant cache hit.
[2023-03-16 18:06:43] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Property proved to be false thanks to knowledge :(G (OR p0 (NOT p1)))
Knowledge based reduction with 8 factoid took 273 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) 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 65102 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)) U G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-32-LTLFireability-06
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_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 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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3700 transition count 502
Applied a total of 4 rules in 798 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-16 18:06:44] [INFO ] Computed 3200 place invariants in 64 ms
[2023-03-16 18:06:50] [INFO ] Implicit Places using invariants in 6024 ms returned []
[2023-03-16 18:06:50] [INFO ] Invariant cache hit.
[2023-03-16 18:07:04] [INFO ] Implicit Places using invariants and state equation in 14501 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 20533 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 259 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 21591 ms. Remains : 3634/3736 places, 502/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s3600 1) (LT s3601 1) (LT s3598 1) (LT s3599 1) (LT s3608 1) (LT s3609 1) (LT s3606 1) (LT s3607 1) (LT s3604 1) (LT s3605 1) (LT s3602 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2467 reset in 477 ms.
Product exploration explored 100000 steps with 2460 reset in 503 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 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 371 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1520124 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :{}
Probabilistic random walk after 1520124 steps, saw 234318 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-16 18:07:10] [INFO ] Computed 3136 place invariants in 472 ms
[2023-03-16 18:07:11] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 677 ms returned sat
[2023-03-16 18:07:11] [INFO ] After 1068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:07:12] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 659 ms returned sat
[2023-03-16 18:07:14] [INFO ] After 1490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:07:14] [INFO ] After 1628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-16 18:07:14] [INFO ] After 2761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3634 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 232 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-16 18:07:15] [INFO ] Invariant cache hit.
[2023-03-16 18:07:21] [INFO ] Implicit Places using invariants in 5863 ms returned []
[2023-03-16 18:07:21] [INFO ] Invariant cache hit.
[2023-03-16 18:07:33] [INFO ] Implicit Places using invariants and state equation in 12015 ms returned []
Implicit Place search using SMT with State Equation took 17883 ms to find 0 implicit places.
[2023-03-16 18:07:33] [INFO ] Invariant cache hit.
[2023-03-16 18:07:34] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19459 ms. Remains : 3634/3634 places, 502/502 transitions.
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1513192 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :{}
Probabilistic random walk after 1513192 steps, saw 233222 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:07:38] [INFO ] Invariant cache hit.
[2023-03-16 18:07:39] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 682 ms returned sat
[2023-03-16 18:07:39] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:07:40] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 678 ms returned sat
[2023-03-16 18:07:42] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:07:42] [INFO ] After 1625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-16 18:07:42] [INFO ] After 2755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2458 reset in 481 ms.
Product exploration explored 100000 steps with 2464 reset in 506 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3634 transition count 502
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 309 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-16 18:07:44] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2023-03-16 18:07:44] [INFO ] Computed 3136 place invariants in 465 ms
[2023-03-16 18:07:46] [INFO ] Dead Transitions using invariants and state equation in 1813 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3634 places, 502/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2167 ms. Remains : 3634/3634 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin15056429896280490574
[2023-03-16 18:07:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15056429896280490574
Running compilation step : cd /tmp/ltsmin15056429896280490574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2212 ms.
Running link step : cd /tmp/ltsmin15056429896280490574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15056429896280490574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1190268492772279840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 247 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-16 18:08:01] [INFO ] Computed 3136 place invariants in 472 ms
[2023-03-16 18:08:07] [INFO ] Implicit Places using invariants in 6463 ms returned []
[2023-03-16 18:08:07] [INFO ] Invariant cache hit.
[2023-03-16 18:08:20] [INFO ] Implicit Places using invariants and state equation in 12915 ms returned []
Implicit Place search using SMT with State Equation took 19384 ms to find 0 implicit places.
[2023-03-16 18:08:20] [INFO ] Invariant cache hit.
[2023-03-16 18:08:22] [INFO ] Dead Transitions using invariants and state equation in 1314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20948 ms. Remains : 3634/3634 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin1644759119834861083
[2023-03-16 18:08:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1644759119834861083
Running compilation step : cd /tmp/ltsmin1644759119834861083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2410 ms.
Running link step : cd /tmp/ltsmin1644759119834861083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1644759119834861083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3080211469724832377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:08:37] [INFO ] Flatten gal took : 75 ms
[2023-03-16 18:08:37] [INFO ] Flatten gal took : 76 ms
[2023-03-16 18:08:37] [INFO ] Time to serialize gal into /tmp/LTL12744314603742673100.gal : 9 ms
[2023-03-16 18:08:37] [INFO ] Time to serialize properties into /tmp/LTL3438372738956941467.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12744314603742673100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12604658778393378951.hoa' '-atoms' '/tmp/LTL3438372738956941467.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3438372738956941467.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12604658778393378951.hoa
Detected timeout of ITS tools.
[2023-03-16 18:08:52] [INFO ] Flatten gal took : 75 ms
[2023-03-16 18:08:52] [INFO ] Flatten gal took : 88 ms
[2023-03-16 18:08:52] [INFO ] Time to serialize gal into /tmp/LTL7987094990464065012.gal : 9 ms
[2023-03-16 18:08:52] [INFO ] Time to serialize properties into /tmp/LTL4693536054525631640.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7987094990464065012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4693536054525631640.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((X(G("(((((((s6_2<1)&&(s6_3<1))&&((s6_0<1)&&(s6_1<1)))&&(((s6_10<1)&&(s6_11<1))&&((s6_8<1)&&(s6_9<1))))&&((((s6_6<1)&&(s6_7<1))&&(...1785
Formula 0 simplified : (XF!"(((((((s6_2<1)&&(s6_3<1))&&((s6_0<1)&&(s6_1<1)))&&(((s6_10<1)&&(s6_11<1))&&((s6_8<1)&&(s6_9<1))))&&((((s6_6<1)&&(s6_7<1))&&((s6...1774
Detected timeout of ITS tools.
[2023-03-16 18:09:07] [INFO ] Flatten gal took : 75 ms
[2023-03-16 18:09:07] [INFO ] Applying decomposition
[2023-03-16 18:09:08] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10878993301925556250.txt' '-o' '/tmp/graph10878993301925556250.bin' '-w' '/tmp/graph10878993301925556250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10878993301925556250.bin' '-l' '-1' '-v' '-w' '/tmp/graph10878993301925556250.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:09:08] [INFO ] Decomposing Gal with order
[2023-03-16 18:09:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:09:08] [INFO ] Removed a total of 362 redundant transitions.
[2023-03-16 18:09:08] [INFO ] Flatten gal took : 225 ms
[2023-03-16 18:09:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 77 ms.
[2023-03-16 18:09:08] [INFO ] Time to serialize gal into /tmp/LTL674245991054881816.gal : 16 ms
[2023-03-16 18:09:08] [INFO ] Time to serialize properties into /tmp/LTL10387075159607642733.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL674245991054881816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10387075159607642733.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((X(G("(((((((u102.s6_2<1)&&(u103.s6_3<1))&&((u100.s6_0<1)&&(u101.s6_1<1)))&&(((u110.s6_10<1)&&(u111.s6_11<1))&&((u108.s6_8<1)&&(u1...2607
Formula 0 simplified : (XF!"(((((((u102.s6_2<1)&&(u103.s6_3<1))&&((u100.s6_0<1)&&(u101.s6_1<1)))&&(((u110.s6_10<1)&&(u111.s6_11<1))&&((u108.s6_8<1)&&(u109....2596
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11460255976432101047
[2023-03-16 18:09:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11460255976432101047
Running compilation step : cd /tmp/ltsmin11460255976432101047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2384 ms.
Running link step : cd /tmp/ltsmin11460255976432101047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11460255976432101047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 175469 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((p0 U (p1||G(p0))))))'
[2023-03-16 18:09:39] [INFO ] Flatten gal took : 84 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8873090312974386969
[2023-03-16 18:09:39] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2023-03-16 18:09:39] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:09:39] [INFO ] Applying decomposition
[2023-03-16 18:09:39] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2023-03-16 18:09:39] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:09:39] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2023-03-16 18:09:39] [INFO ] Flatten gal took : 77 ms
[2023-03-16 18:09:39] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:09:39] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8873090312974386969
Running compilation step : cd /tmp/ltsmin8873090312974386969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16191915161268085363.txt' '-o' '/tmp/graph16191915161268085363.bin' '-w' '/tmp/graph16191915161268085363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16191915161268085363.bin' '-l' '-1' '-v' '-w' '/tmp/graph16191915161268085363.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:09:39] [INFO ] Decomposing Gal with order
[2023-03-16 18:09:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:09:39] [INFO ] Removed a total of 329 redundant transitions.
[2023-03-16 18:09:39] [INFO ] Flatten gal took : 194 ms
[2023-03-16 18:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 158 ms.
[2023-03-16 18:09:40] [INFO ] Time to serialize gal into /tmp/LTLFireability5702206639141556053.gal : 41 ms
[2023-03-16 18:09:40] [INFO ] Time to serialize properties into /tmp/LTLFireability18309688917419894833.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5702206639141556053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18309688917419894833.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((((X(G("(((((((i34.u196.s6_2<1)&&(i57.u197.s6_3<1))&&((i56.u194.s6_0<1)&&(i46.u195.s6_1<1)))&&(((i48.u204.s6_10<1)&&(i49.u205.s6_11<...3007
Formula 0 simplified : (XF!"(((((((i34.u196.s6_2<1)&&(i57.u197.s6_3<1))&&((i56.u194.s6_0<1)&&(i46.u195.s6_1<1)))&&(((i48.u204.s6_10<1)&&(i49.u205.s6_11<1))...2996
Compilation finished in 2684 ms.
Running link step : cd /tmp/ltsmin8873090312974386969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8873090312974386969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.071: LTL layer: formula: ((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.071: "((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.072: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.127: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.137: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.830: DFS-FIFO for weak LTL, using special progress label 511
pins2lts-mc-linux64( 0/ 8), 0.830: There are 512 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.830: State length is 3737, there are 515 groups
pins2lts-mc-linux64( 0/ 8), 0.830: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.830: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.830: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.830: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.199: ~1 levels ~960 states ~31328 transitions
pins2lts-mc-linux64( 0/ 8), 1.589: ~1 levels ~1920 states ~78384 transitions
pins2lts-mc-linux64( 6/ 8), 2.017: ~1 levels ~3840 states ~136728 transitions
pins2lts-mc-linux64( 6/ 8), 2.770: ~1 levels ~7680 states ~273032 transitions
pins2lts-mc-linux64( 3/ 8), 4.351: ~1 levels ~15360 states ~529536 transitions
pins2lts-mc-linux64( 4/ 8), 7.161: ~1 levels ~30720 states ~1074544 transitions
pins2lts-mc-linux64( 4/ 8), 12.175: ~1 levels ~61440 states ~2192664 transitions
pins2lts-mc-linux64( 3/ 8), 23.020: ~1 levels ~122880 states ~4564736 transitions
pins2lts-mc-linux64( 4/ 8), 47.568: ~1 levels ~245760 states ~11321944 transitions
pins2lts-mc-linux64( 4/ 8), 93.326: ~1 levels ~491520 states ~22547200 transitions
pins2lts-mc-linux64( 0/ 8), 98.660: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 99.610:
pins2lts-mc-linux64( 0/ 8), 99.610: mean standard work distribution: 8.3% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 99.610:
pins2lts-mc-linux64( 0/ 8), 99.610: Explored 454597 states 23555629 transitions, fanout: 51.817
pins2lts-mc-linux64( 0/ 8), 99.610: Total exploration time 98.780 sec (97.870 sec minimum, 98.255 sec on average)
pins2lts-mc-linux64( 0/ 8), 99.610: States per second: 4602, Transitions per second: 238466
pins2lts-mc-linux64( 0/ 8), 99.610:
pins2lts-mc-linux64( 0/ 8), 99.610: Progress states detected: 7383447
pins2lts-mc-linux64( 0/ 8), 99.610: Redundant explorations: -93.8432
pins2lts-mc-linux64( 0/ 8), 99.610:
pins2lts-mc-linux64( 0/ 8), 99.610: Queue width: 8B, total height: 8109988, memory: 61.87MB
pins2lts-mc-linux64( 0/ 8), 99.610: Tree memory: 312.3MB, 44.4 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 99.610: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 99.610: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 99.610: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 99.610: Est. total memory use: 374.2MB (~1085.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8873090312974386969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8873090312974386969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X([]((LTLAPp0==true)))&&<>((LTLAPp1==true))) U []((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 18:34:48] [INFO ] Applying decomposition
[2023-03-16 18:34:49] [INFO ] Flatten gal took : 661 ms
[2023-03-16 18:34:49] [INFO ] Decomposing Gal with order
[2023-03-16 18:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:35:09] [INFO ] Removed a total of 296 redundant transitions.
[2023-03-16 18:35:09] [INFO ] Flatten gal took : 680 ms
[2023-03-16 18:35:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 317 ms.
[2023-03-16 18:35:10] [INFO ] Time to serialize gal into /tmp/LTLFireability4906612166098507682.gal : 104 ms
[2023-03-16 18:35:10] [INFO ] Time to serialize properties into /tmp/LTLFireability9594928831704936887.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4906612166098507682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9594928831704936887.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((((X(G("(((((((tsid2.s6_2<1)&&(tsid3.s6_3<1))&&((tsid0.s6_0<1)&&(tsid1.s6_1<1)))&&(((tsid10.s6_10<1)&&(tsid11.s6_11<1))&&((tsid8.s6_...2669
Formula 0 simplified : (XF!"(((((((tsid2.s6_2<1)&&(tsid3.s6_3<1))&&((tsid0.s6_0<1)&&(tsid1.s6_1<1)))&&(((tsid10.s6_10<1)&&(tsid11.s6_11<1))&&((tsid8.s6_8<1...2658
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 136456 kB
After kill :
MemTotal: 16393232 kB
MemFree: 11231980 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="QuasiCertifProtocol-COL-32"
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 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 r293-tall-167873946000852"
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 ;