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.r312-tall-171662337600004.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 itstools
Input is QuasiCertifProtocol-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 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.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 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 34K 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-02-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716654854257

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-25 16:34:15] [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-25 16:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:34:15] [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-25 16:34:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:34:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 566 ms
[2024-05-25 16:34:16] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 16:34:16] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 16:34:16] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 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).
RANDOM walk for 40000 steps (5337 resets) in 1556 ms. (25 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 166 ms. (239 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1644 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:34:16] [INFO ] Computed 5 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 1 solved, 0 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-25 16:34:17] [INFO ] Flatten gal took : 20 ms
[2024-05-25 16:34:17] [INFO ] Flatten gal took : 4 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:34:17] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 9 ms.
[2024-05-25 16:34:17] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 45 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 12 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-25 16:34:17] [INFO ] Computed 22 invariants in 11 ms
[2024-05-25 16:34:17] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 16:34:17] [INFO ] Invariant cache hit.
[2024-05-25 16:34:17] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 184 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 73/86 places, 56/56 transitions.
Support contains 45 out of 73 places after structural reductions.
[2024-05-25 16:34:17] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:34:17] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:34:17] [INFO ] Input system was already deterministic with 56 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (6567 resets) in 573 ms. (69 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40003 steps (2237 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 28797 steps (736 resets) in 177 ms. (161 steps per ms) remains 0/13 properties
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 34 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 33 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 32 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 32 transition count 28
Applied a total of 15 rules in 21 ms. Remains 32 /73 variables (removed 41) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 32 cols
[2024-05-25 16:34:18] [INFO ] Computed 6 invariants in 3 ms
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 16:34:18] [INFO ] Invariant cache hit.
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [16, 17, 18]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 92 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/73 places, 28/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 29/73 places, 28/56 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-00 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 67 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 67 transition count 52
Applied a total of 4 rules in 9 ms. Remains 67 /73 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-25 16:34:18] [INFO ] Computed 18 invariants in 3 ms
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-25 16:34:18] [INFO ] Invariant cache hit.
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 132 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/73 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 64/73 places, 52/56 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-02 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:34:18] [INFO ] Computed 20 invariants in 3 ms
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-25 16:34:18] [INFO ] Invariant cache hit.
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 868 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 959 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1853ms
Finished structural reductions in LTL mode , in 1 iterations and 1993 ms. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-03 finished in 2117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 51
Applied a total of 5 rules in 9 ms. Remains 66 /73 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 16:34:20] [INFO ] Computed 18 invariants in 3 ms
[2024-05-25 16:34:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 16:34:20] [INFO ] Invariant cache hit.
[2024-05-25 16:34:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 102 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/73 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 63/73 places, 51/56 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-04
Product exploration explored 100000 steps with 18712 reset in 217 ms.
Product exploration explored 100000 steps with 18754 reset in 129 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 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-02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-04 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(G(p1)))))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:34:21] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 16:34:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 16:34:21] [INFO ] Invariant cache hit.
[2024-05-25 16:34:21] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 729 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 963 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1722ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1723ms
Finished structural reductions in LTL mode , in 1 iterations and 1840 ms. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-07 finished in 2007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 51
Applied a total of 5 rules in 6 ms. Remains 66 /73 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 16:34:23] [INFO ] Computed 18 invariants in 2 ms
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 16:34:23] [INFO ] Invariant cache hit.
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 93 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/73 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 63/73 places, 51/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-08
Product exploration explored 100000 steps with 18764 reset in 171 ms.
Product exploration explored 100000 steps with 18746 reset in 135 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-08 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 67 transition count 52
Applied a total of 5 rules in 7 ms. Remains 67 /73 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-25 16:34:23] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-25 16:34:23] [INFO ] Invariant cache hit.
[2024-05-25 16:34:24] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-25 16:34:24] [INFO ] Redundant transitions in 12 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-25 16:34:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 52/118 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/119 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 85 constraints, problems are : Problem set: 0 solved, 48 unsolved in 608 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 52/118 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 133 constraints, problems are : Problem set: 0 solved, 48 unsolved in 795 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1416ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/73 places, 52/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1553 ms. Remains : 67/73 places, 52/56 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-09
Product exploration explored 100000 steps with 16434 reset in 76 ms.
Product exploration explored 100000 steps with 16441 reset in 76 ms.
Computed a total of 67 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 52
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 p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 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-02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-09 finished in 1849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(p0&&X((p0&&(G(p0)||F(!p1))))))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:34:25] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 667 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 932 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1609ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1610ms
Finished structural reductions in LTL mode , in 1 iterations and 1729 ms. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, p1, (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-10 finished in 2252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(X(X(F(!p0)))&&G((F(G(p2))&&p1))))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 16:34:28] [INFO ] Invariant cache hit.
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 16:34:28] [INFO ] Invariant cache hit.
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 707 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 939 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1661ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1663ms
Finished structural reductions in LTL mode , in 1 iterations and 1770 ms. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 192 ms :[p0, (AND p1 p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (AND p0 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-11
Product exploration explored 100000 steps with 22057 reset in 88 ms.
Product exploration explored 100000 steps with 22132 reset in 92 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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) p2), (X p2), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 20 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-11 finished in 2216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(G(p2))||p1))))'
Support contains 19 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 16:34:30] [INFO ] Invariant cache hit.
[2024-05-25 16:34:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 16:34:30] [INFO ] Invariant cache hit.
[2024-05-25 16:34:30] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 677 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 948 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1637ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1638ms
Finished structural reductions in LTL mode , in 1 iterations and 1735 ms. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-13 finished in 1965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 67 transition count 52
Applied a total of 3 rules in 9 ms. Remains 67 /73 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-25 16:34:32] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 16:34:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 16:34:32] [INFO ] Invariant cache hit.
[2024-05-25 16:34:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 93 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/73 places, 52/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 64/73 places, 52/56 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-14
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-14 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:34:32] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 16:34:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 16:34:32] [INFO ] Invariant cache hit.
[2024-05-25 16:34:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 713 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 915 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1638ms
Finished structural reductions in LTL mode , in 1 iterations and 1745 ms. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-15
Product exploration explored 100000 steps with 16427 reset in 75 ms.
Product exploration explored 100000 steps with 16412 reset in 80 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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, (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (6573 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32839 steps (857 resets) in 146 ms. (223 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 16:34:35] [INFO ] Invariant cache hit.
[2024-05-25 16:34:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 16:34:35] [INFO ] Invariant cache hit.
[2024-05-25 16:34:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 681 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 919 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1617ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1617ms
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 73/73 places, 56/56 transitions.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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, (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (6571 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25197 steps (650 resets) in 32 ms. (763 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16432 reset in 77 ms.
Product exploration explored 100000 steps with 16417 reset in 78 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 56
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 6 ms. Remains 69 /73 variables (removed 4) and now considering 56/56 (removed 0) transitions.
[2024-05-25 16:34:38] [INFO ] Redundant transitions in 14 ms returned []
Running 52 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 69 cols
[2024-05-25 16:34:38] [INFO ] Computed 18 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 2 (OVERLAPS) 56/124 variables, 68/86 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 1/87 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 87 constraints, problems are : Problem set: 4 solved, 48 unsolved in 667 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 18/18 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 54/120 variables, 66/84 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 48/132 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/132 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 5/125 variables, 3/135 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 135 constraints, problems are : Problem set: 4 solved, 48 unsolved in 874 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 48/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1562ms problems are : Problem set: 4 solved, 48 unsolved
Search for dead transitions found 4 dead transitions in 1563ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 69/73 places, 52/56 transitions.
Graph (complete) has 131 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 67 /69 variables (removed 2) and now considering 52/52 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/73 places, 52/56 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1597 ms. Remains : 67/73 places, 52/56 transitions.
Built C files in :
/tmp/ltsmin9873965717304942139
[2024-05-25 16:34:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9873965717304942139
Running compilation step : cd /tmp/ltsmin9873965717304942139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin9873965717304942139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9873965717304942139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4971243120924040481.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-15 finished in 8128 ms.
All properties solved by simple procedures.
Total runtime 25159 ms.

BK_STOP 1716654880902

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-02"
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-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-02, 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 r312-tall-171662337600004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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