Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 72K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716762255933

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 22:24:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:24:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 22:24:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:24:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 814 ms
[2024-05-26 22:24:18] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:24:18] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-26 22:24:18] [INFO ] Skeletonized 16 HLPN properties in 9 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-10 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 9 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 10003 steps, including 552 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:24:18] [INFO ] Computed 5 invariants in 10 ms
[2024-05-26 22:24:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-26 22:24:18] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 22:24:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 22:24:18] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 22:24:18] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-26 22:24:18] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
[2024-05-26 22:24:18] [INFO ] Flatten gal took : 18 ms
[2024-05-26 22:24:18] [INFO ] Flatten gal took : 8 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:24:18] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 13 ms.
[2024-05-26 22:24:18] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 358 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 21 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-26 22:24:18] [INFO ] Computed 350 invariants in 25 ms
[2024-05-26 22:24:19] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-26 22:24:19] [INFO ] Invariant cache hit.
[2024-05-26 22:24:19] [INFO ] Implicit Places using invariants and state equation in 338 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 658 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/550 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 690 ms. Remains : 513/550 places, 176/176 transitions.
Support contains 358 out of 513 places after structural reductions.
[2024-05-26 22:24:19] [INFO ] Flatten gal took : 36 ms
[2024-05-26 22:24:19] [INFO ] Flatten gal took : 31 ms
[2024-05-26 22:24:19] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 688 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 176 rows 513 cols
[2024-05-26 22:24:20] [INFO ] Computed 340 invariants in 33 ms
[2024-05-26 22:24:20] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 47 ms returned sat
[2024-05-26 22:24:20] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-26 22:24:21] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2024-05-26 22:24:21] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-26 22:24:22] [INFO ] After 1624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 586 ms.
[2024-05-26 22:24:23] [INFO ] After 2595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 15 properties in 23 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:24:23] [INFO ] Invariant cache hit.
[2024-05-26 22:24:24] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-26 22:24:24] [INFO ] Invariant cache hit.
[2024-05-26 22:24:24] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2024-05-26 22:24:24] [INFO ] Invariant cache hit.
[2024-05-26 22:24:24] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1129 ms. Remains : 513/513 places, 176/176 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s510 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][false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-03 finished in 1411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0))&&F(p1))))'
Support contains 23 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:24:25] [INFO ] Invariant cache hit.
[2024-05-26 22:24:25] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-26 22:24:25] [INFO ] Invariant cache hit.
[2024-05-26 22:24:26] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2024-05-26 22:24:26] [INFO ] Invariant cache hit.
[2024-05-26 22:24:26] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1104 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s397 1) (LT s452 1)) (OR (LT s400 1) (LT s455 1)) (OR (LT s401 1) (LT s456 1)) (OR (LT s404 1) (LT s459 1)) (OR (LT s405 1) (LT s460 1)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 413 ms.
Product exploration explored 100000 steps with 33333 reset in 306 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-04 finished in 2140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(X(G(!p1))))))))'
Support contains 34 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:24:27] [INFO ] Invariant cache hit.
[2024-05-26 22:24:27] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-26 22:24:27] [INFO ] Invariant cache hit.
[2024-05-26 22:24:28] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2024-05-26 22:24:28] [INFO ] Invariant cache hit.
[2024-05-26 22:24:28] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 473 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 6}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}], [{ cond=true, acceptance={} source=10 dest: 11}], [{ cond=(NOT p0), acceptance={} source=11 dest: 8}, { cond=p0, acceptance={} source=11 dest: 9}]], initial=10, aps=[p1:(AND (OR (LT s397 1) (LT s452 1)) (OR (LT s400 1) (LT s455 1)) (OR (LT s401 1) (LT s456 1)) (OR (LT s404 1) (LT s459 1)) (OR (LT s405 1) (LT s460 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-05 finished in 1531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 34 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Discarding 12 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 499 transition count 172
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 499 transition count 172
Applied a total of 4 rules in 54 ms. Remains 499 /513 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 499 cols
[2024-05-26 22:24:28] [INFO ] Computed 330 invariants in 26 ms
[2024-05-26 22:24:29] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-26 22:24:29] [INFO ] Invariant cache hit.
[2024-05-26 22:24:29] [INFO ] Implicit Places using invariants and state equation in 514 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 832 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/513 places, 172/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 905 ms. Remains : 488/513 places, 172/176 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s365 1) (LT s442 1)) (OR (LT s369 1) (LT s446 1)) (OR (LT s373 1) (LT s450 1)) (OR (LT s374 1) (LT s451 1)) (OR (LT s367 1) (LT s444 1)) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6767 reset in 585 ms.
Product exploration explored 100000 steps with 6787 reset in 532 ms.
Computed a total of 488 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-06 finished in 2210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 145 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 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 2 place count 511 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 511 transition count 174
Applied a total of 3 rules in 30 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2024-05-26 22:24:31] [INFO ] Computed 340 invariants in 19 ms
[2024-05-26 22:24:31] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-26 22:24:31] [INFO ] Invariant cache hit.
[2024-05-26 22:24:31] [INFO ] Implicit Places using invariants and state equation in 339 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 581 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 624 ms. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s144 1) (GEQ s145 1) (GEQ s146 1) (GEQ s147 1) (GEQ s148 1) (GEQ s149 1) (GEQ s150 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1)...], 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 15 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-07 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(!p1))||(X(F(!p1))&&p2)))))'
Support contains 12 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 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 499 transition count 172
Applied a total of 3 rules in 22 ms. Remains 499 /513 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 499 cols
[2024-05-26 22:24:31] [INFO ] Computed 330 invariants in 20 ms
[2024-05-26 22:24:32] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-26 22:24:32] [INFO ] Invariant cache hit.
[2024-05-26 22:24:32] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 837 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/513 places, 172/176 transitions.
Applied a total of 0 rules in 30 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 889 ms. Remains : 488/513 places, 172/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s486 1), p0:(AND (LT s484 1) (LT s477 1) (LT s476 1) (LT s475 1) (LT s474 1) (LT s478 1) (LT s479 1) (LT s480 1) (LT s481 1) (LT s482 1) (LT s483 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6772 reset in 153 ms.
Product exploration explored 100000 steps with 6793 reset in 154 ms.
Computed a total of 488 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-11 finished in 1396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U G((p1&&(F(p3)||p2))))))'
Support contains 156 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2024-05-26 22:24:33] [INFO ] Computed 340 invariants in 20 ms
[2024-05-26 22:24:33] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-26 22:24:33] [INFO ] Invariant cache hit.
[2024-05-26 22:24:33] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-05-26 22:24:33] [INFO ] Invariant cache hit.
[2024-05-26 22:24:34] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s507 1), p2:(OR (AND (GEQ s2 1) (GEQ s13 1) (GEQ s24 1) (GEQ s35 1) (GEQ s46 1) (GEQ s57 1) (GEQ s68 1) (GEQ s79 1) (GEQ s90 1) (GEQ s101 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-13 finished in 1200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0))) U (X(X(G(!p0)))&&p1))))'
Support contains 144 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:24:34] [INFO ] Invariant cache hit.
[2024-05-26 22:24:34] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-26 22:24:34] [INFO ] Invariant cache hit.
[2024-05-26 22:24:35] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-05-26 22:24:35] [INFO ] Invariant cache hit.
[2024-05-26 22:24:35] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s386 1) (GEQ s387 1) (GEQ s388 1) (GEQ s389 1) (GEQ s390 1) (GEQ s391 1) (GEQ s392 1) (GEQ s393 1) (GEQ s394 1) (GEQ s395 1) (GEQ s396 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 76175 steps with 5271 reset in 222 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-14 finished in 1366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (((p1 U X(p0)) U p2) U X(p1))))'
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:24:35] [INFO ] Invariant cache hit.
[2024-05-26 22:24:36] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-26 22:24:36] [INFO ] Invariant cache hit.
[2024-05-26 22:24:36] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2024-05-26 22:24:36] [INFO ] Invariant cache hit.
[2024-05-26 22:24:36] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1071 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 582 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) p2 (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 10}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 13}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 14}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 7}, { cond=(NOT p2), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=12 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=13 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=14 dest: 13}, { cond=(NOT p1), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p2:(LT s508 1), p1:(OR (AND (GEQ s422 1) (GEQ s444 1)) (AND (GEQ s425 1) (GEQ s447 1)) (AND (GEQ s426 1) (GEQ s448 1)) (AND (GEQ s429 1) (GEQ s451 1)) (AN...], 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16044 reset in 227 ms.
Product exploration explored 100000 steps with 16026 reset in 234 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 1333 ms. Reduced automaton from 15 states, 31 edges and 3 AP (stutter sensitive) to 11 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 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 86 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-26 22:24:40] [INFO ] Invariant cache hit.
[2024-05-26 22:24:40] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2024-05-26 22:24:40] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-26 22:24:40] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2024-05-26 22:24:40] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2024-05-26 22:24:41] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-26 22:24:41] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 2 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 3 properties in 1 ms.
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 72 are kept as prefixes of interest. Removing 441 places using SCC suffix rule.0 ms
Discarding 441 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Drop transitions removed 68 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 69 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 61 transition count 39
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 81 place count 61 transition count 27
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 34 rules applied. Total rules applied 115 place count 39 transition count 27
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 116 place count 38 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 38 transition count 26
Applied a total of 117 rules in 6 ms. Remains 38 /513 variables (removed 475) and now considering 26/176 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 38/513 places, 26/176 transitions.
Incomplete random walk after 10000 steps, including 769 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 158 steps, run visited all 2 properties in 8 ms. (steps per millisecond=19 )
Probabilistic random walk after 158 steps, saw 147 distinct states, run finished after 8 ms. (steps per millisecond=19 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 3078 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), true, (OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), true, (OR (NOT p1) (AND p0 (NOT p2)))]
[2024-05-26 22:24:44] [INFO ] Invariant cache hit.
[2024-05-26 22:24:45] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 142 ms returned sat
[2024-05-26 22:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:45] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-05-26 22:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:24:45] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 150 ms returned sat
[2024-05-26 22:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:46] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-26 22:24:46] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2024-05-26 22:24:46] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-26 22:24:46] [INFO ] Invariant cache hit.
[2024-05-26 22:24:46] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-26 22:24:46] [INFO ] Invariant cache hit.
[2024-05-26 22:24:47] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2024-05-26 22:24:47] [INFO ] Invariant cache hit.
[2024-05-26 22:24:47] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1095 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 442 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2))), true, (OR (NOT p1) (AND p0 (NOT p2)))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 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 81 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-26 22:24:48] [INFO ] Invariant cache hit.
[2024-05-26 22:24:48] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 49 ms returned sat
[2024-05-26 22:24:48] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2024-05-26 22:24:48] [INFO ] After 168ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-26 22:24:49] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:1
[2024-05-26 22:24:49] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 48 ms returned sat
[2024-05-26 22:24:49] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-26 22:24:49] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-26 22:24:49] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 1 ms.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 70 are kept as prefixes of interest. Removing 443 places using SCC suffix rule.1 ms
Discarding 443 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 59 transition count 27
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 36 place count 59 transition count 4
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 31 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 1 with 77 rules applied. Total rules applied 113 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 114 place count 4 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 115 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 2 transition count 2
Applied a total of 118 rules in 12 ms. Remains 2 /513 variables (removed 511) and now considering 2/176 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 2/513 places, 2/176 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 p2 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 775 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2))), true, (OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2))), true, (OR (NOT p1) (AND p0 (NOT p2)))]
[2024-05-26 22:24:50] [INFO ] Invariant cache hit.
[2024-05-26 22:24:50] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 145 ms returned sat
[2024-05-26 22:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:51] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-26 22:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:24:51] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 138 ms returned sat
[2024-05-26 22:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 22:24:52] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2024-05-26 22:24:52] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-26 22:24:52] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2))), true, (OR (NOT p1) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 15998 reset in 231 ms.
Product exploration explored 100000 steps with 16063 reset in 240 ms.
Built C files in :
/tmp/ltsmin5130557836259504840
[2024-05-26 22:24:53] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5130557836259504840
Running compilation step : cd /tmp/ltsmin5130557836259504840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin5130557836259504840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5130557836259504840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13322584800463138894.hoa' '--buchi-type=spotba'
LTSmin run took 343 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-15 finished in 18407 ms.
All properties solved by simple procedures.
Total runtime 36816 ms.

BK_STOP 1716762295603

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361300013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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