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-171662337700035.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-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 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 22K 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:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 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 104K 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-22-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716658589093

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-25 17:36:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 17:36:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:36:30] [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 17:36:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 17:36:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2024-05-25 17:36:30] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 17:36:31] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 17:36:31] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 10 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 40010 steps (1245 resets) in 801 ms. (49 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40003 steps (425 resets) in 444 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40010 steps (411 resets) in 411 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (422 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (423 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 17:36:31] [INFO ] Computed 5 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/20 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/24 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/56 variables, 6/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 2 solved, 2 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 8 (OVERLAPS) 6/56 variables, 6/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 36 constraints, problems are : Problem set: 3 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 407ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 17:36:32] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-25 17:36:32] [INFO ] Flatten gal took : 18 ms
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 17:36:32] [INFO ] Flatten gal took : 6 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-25 17:36:32] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 25 ms.
[2024-05-25 17:36:32] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 1775 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1941 transition count 356
Applied a total of 25 rules in 29 ms. Remains 1941 /1966 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1941 cols
[2024-05-25 17:36:32] [INFO ] Computed 1586 invariants in 57 ms
[2024-05-25 17:36:33] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-25 17:36:33] [INFO ] Invariant cache hit.
[2024-05-25 17:36:35] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned [1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3316 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1918/1966 places, 356/356 transitions.
Applied a total of 0 rules in 11 ms. Remains 1918 /1918 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3366 ms. Remains : 1918/1966 places, 356/356 transitions.
Support contains 1775 out of 1918 places after structural reductions.
[2024-05-25 17:36:35] [INFO ] Flatten gal took : 116 ms
[2024-05-25 17:36:36] [INFO ] Flatten gal took : 77 ms
[2024-05-25 17:36:36] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (1486 resets) in 2411 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (86 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (88 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 520 ms. (76 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (86 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (91 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (94 resets) in 374 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (120 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (120 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (88 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (88 resets) in 443 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 635282 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :11 out of 12
Probabilistic random walk after 635282 steps, saw 93820 distinct states, run finished after 3009 ms. (steps per millisecond=211 ) properties seen :11
// Phase 1: matrix 356 rows 1918 cols
[2024-05-25 17:36:40] [INFO ] Computed 1563 invariants in 47 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/51 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/74 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 23/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 141/215 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 117/332 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 529/861 variables, 506/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 1669/2274 variables, and 1846 constraints, problems are : Problem set: 1 solved, 0 unsolved in 554 ms.
Refiners :[Generalized P Invariants (flows): 529/1563 constraints, State Equation: 1317/1918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 1918 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1918 transition count 356
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' '!(X(F(p0)))'
Support contains 23 out of 1918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1893 transition count 356
Applied a total of 25 rules in 248 ms. Remains 1893 /1918 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 17:36:42] [INFO ] Computed 1540 invariants in 150 ms
[2024-05-25 17:36:44] [INFO ] Implicit Places using invariants in 2169 ms returned []
[2024-05-25 17:36:44] [INFO ] Invariant cache hit.
[2024-05-25 17:36:57] [INFO ] Implicit Places using invariants and state equation in 13705 ms returned []
Implicit Place search using SMT with State Equation took 15877 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:36:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60568ms
Starting structural reductions in LTL mode, iteration 1 : 1893/1918 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76707 ms. Remains : 1893/1918 places, 356/356 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-01
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 8 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-01 finished in 76981 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)))'
Support contains 49 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1895 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.26 ms
Discarding 23 places :
Also discarding 0 output 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 1893 transition count 354
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 1893 transition count 354
Applied a total of 4 rules in 431 ms. Remains 1893 /1918 variables (removed 25) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1893 cols
[2024-05-25 17:37:59] [INFO ] Computed 1540 invariants in 19 ms
[2024-05-25 17:38:01] [INFO ] Implicit Places using invariants in 2078 ms returned []
[2024-05-25 17:38:01] [INFO ] Invariant cache hit.
[2024-05-25 17:38:06] [INFO ] Implicit Places using invariants and state equation in 5385 ms returned [1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7469 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1918 places, 354/356 transitions.
Applied a total of 0 rules in 93 ms. Remains 1870 /1870 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7995 ms. Remains : 1870/1918 places, 354/356 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-05
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-05 finished in 8087 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 529 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1294 are kept as prefixes of interest. Removing 624 places using SCC suffix rule.9 ms
Discarding 624 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 1293 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 1291 transition count 260
Applied a total of 50 rules in 66 ms. Remains 1291 /1918 variables (removed 627) and now considering 260/356 (removed 96) transitions.
// Phase 1: matrix 260 rows 1291 cols
[2024-05-25 17:38:06] [INFO ] Computed 1034 invariants in 5 ms
[2024-05-25 17:38:07] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-25 17:38:07] [INFO ] Invariant cache hit.
[2024-05-25 17:38:08] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned [1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 1776 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1268/1918 places, 260/356 transitions.
Applied a total of 0 rules in 33 ms. Remains 1268 /1268 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1875 ms. Remains : 1268/1918 places, 260/356 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-07
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-07 finished in 1929 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 U (p1||G(p0)))))'
Support contains 69 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1869 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.5 ms
Discarding 49 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 1866 transition count 351
Applied a total of 5 rules in 150 ms. Remains 1866 /1918 variables (removed 52) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1866 cols
[2024-05-25 17:38:09] [INFO ] Computed 1518 invariants in 135 ms
[2024-05-25 17:38:11] [INFO ] Implicit Places using invariants in 2222 ms returned []
[2024-05-25 17:38:11] [INFO ] Invariant cache hit.
[2024-05-25 17:38:19] [INFO ] Implicit Places using invariants and state equation in 8439 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10667 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1918 places, 351/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10888 ms. Remains : 1843/1918 places, 351/356 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-09 finished in 10953 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 U X(p1))&&X(p0)))&&X(G(p0))))'
Support contains 576 out of 1918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1917 transition count 356
Applied a total of 1 rules in 36 ms. Remains 1917 /1918 variables (removed 1) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2024-05-25 17:38:19] [INFO ] Computed 1563 invariants in 22 ms
[2024-05-25 17:38:21] [INFO ] Implicit Places using invariants in 1781 ms returned []
[2024-05-25 17:38:21] [INFO ] Invariant cache hit.
[2024-05-25 17:38:33] [INFO ] Implicit Places using invariants and state equation in 12038 ms returned []
Implicit Place search using SMT with State Equation took 13821 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:38:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 24/1916 variables, 507/1563 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1916 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 332 unsolved
SMT process timed out in 30507ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30516ms
Starting structural reductions in LTL mode, iteration 1 : 1917/1918 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44384 ms. Remains : 1917/1918 places, 356/356 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-10
Product exploration explored 100000 steps with 3708 reset in 435 ms.
Product exploration explored 100000 steps with 3709 reset in 450 ms.
Computed a total of 1917 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1917 transition count 356
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 (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 187 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1483 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (89 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4686 steps, run visited all 1 properties in 35 ms. (steps per millisecond=133 )
Probabilistic random walk after 4686 steps, saw 4567 distinct states, run finished after 38 ms. (steps per millisecond=123 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-10 finished in 46402 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 48 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1894 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 0 output 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 1892 transition count 354
Applied a total of 3 rules in 139 ms. Remains 1892 /1918 variables (removed 26) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1892 cols
[2024-05-25 17:39:06] [INFO ] Computed 1540 invariants in 40 ms
[2024-05-25 17:39:08] [INFO ] Implicit Places using invariants in 2134 ms returned []
[2024-05-25 17:39:08] [INFO ] Invariant cache hit.
[2024-05-25 17:39:14] [INFO ] Implicit Places using invariants and state equation in 6603 ms returned [1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8746 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1918 places, 354/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1869 /1869 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8957 ms. Remains : 1869/1918 places, 354/356 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-11
Product exploration explored 100000 steps with 3473 reset in 397 ms.
Product exploration explored 100000 steps with 3479 reset in 323 ms.
Computed a total of 1869 stabilizing places and 354 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 354
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 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 49 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-22-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-11 finished in 10140 ms.
All properties solved by simple procedures.
Total runtime 166020 ms.

BK_STOP 1716658756604

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-22"
export BK_EXAMINATION="LTLCardinality"
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-22, examination is LTLCardinality"
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-171662337700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;