About the Execution of LTSMin+red for QuasiCertifProtocol-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 595.424 | 49507.00 | 72497.00 | 313.90 | F??FF??F??T??F?? | normal |
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.r520-tall-171662337600018.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 ltsminxred
Input is QuasiCertifProtocol-COL-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 72K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717217951210
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:12] [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-06-01 04:59:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:59:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2024-06-01 04:59:13] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2024-06-01 04:59:13] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-06-01 04:59:13] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
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).
AF dead knowledge conclusive for 13 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 7 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 40014 steps (2220 resets) in 793 ms. (50 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (468 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (698 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (702 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (831 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:59:13] [INFO ] Computed 5 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/25 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/56 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (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 217 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/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/55 variables, 7/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/56 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 2 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 8 ms.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
[2024-06-01 04:59:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 04:59:14] [INFO ] Flatten gal took : 16 ms
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:14] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:59:14] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 17 ms.
[2024-06-01 04:59:14] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 524 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 16 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-06-01 04:59:14] [INFO ] Computed 350 invariants in 37 ms
[2024-06-01 04:59:14] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 04:59:14] [INFO ] Invariant cache hit.
[2024-06-01 04:59:14] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 04:59:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/700 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/700 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 874 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11794 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 164/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/700 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 1038 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17923 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 29873ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 29882ms
Starting structural reductions in LTL mode, iteration 1 : 524/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30349 ms. Remains : 524/550 places, 176/176 transitions.
Support contains 524 out of 524 places after structural reductions.
[2024-06-01 04:59:44] [INFO ] Flatten gal took : 72 ms
[2024-06-01 04:59:45] [INFO ] Flatten gal took : 52 ms
[2024-06-01 04:59:45] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 52 to 45
RANDOM walk for 40000 steps (2761 resets) in 1171 ms. (34 steps per ms) remains 37/45 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 90 ms. (44 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (22 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 142 ms. (27 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (33 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (23 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (22 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (40 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
[2024-06-01 04:59:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (OVERLAPS) 176/667 variables, 491/831 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/667 variables, 0/831 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 33/700 variables, 33/864 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 10/874 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/874 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/874 constraints. Problems are: Problem set: 8 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 874 constraints, problems are : Problem set: 8 solved, 28 unsolved in 4334 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 340/340 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 175/665 variables, 490/830 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/665 variables, 24/854 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/854 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 35/700 variables, 34/888 constraints. Problems are: Problem set: 8 solved, 28 unsolved
SMT process timed out in 9535ms, After SMT, problems are : Problem set: 8 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 490 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 524 transition count 175
Applied a total of 1 rules in 15 ms. Remains 524 /524 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 524/524 places, 175/176 transitions.
RANDOM walk for 40000 steps (2973 resets) in 793 ms. (50 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (36 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (36 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
Probabilistic random walk after 1000001 steps, saw 133451 distinct states, run finished after 2186 ms. (steps per millisecond=457 ) properties seen :27
// Phase 1: matrix 175 rows 524 cols
[2024-06-01 04:59:58] [INFO ] Computed 351 invariants in 16 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/81 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 389/470 variables, 277/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 100/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/481 variables, 110/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 11/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 121/602 variables, 110/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 121/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 69/671 variables, 56/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/671 variables, 10/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/671 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/697 variables, 23/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/697 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/698 variables, 11/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/698 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/698 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/699 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/699 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/699 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 875 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/81 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 389/470 variables, 277/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 100/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/481 variables, 110/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 11/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/602 variables, 110/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 121/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 69/671 variables, 56/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/671 variables, 10/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 26/697 variables, 23/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/697 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/698 variables, 11/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/698 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/698 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/699 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/699 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 699/699 variables, and 876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 36 ms
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 31 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 40 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 15 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 04:59:59] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
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 1 place count 523 transition count 175
Applied a total of 1 rules in 34 ms. Remains 523 /524 variables (removed 1) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 523/524 places, 175/176 transitions.
[2024-06-01 04:59:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:00:00] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:00:00] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:00:00] [INFO ] Input system was already deterministic with 176 transitions.
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 22 ms
[2024-06-01 05:00:00] [INFO ] Flatten gal took : 22 ms
[2024-06-01 05:00:00] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2024-06-01 05:00:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 524 places, 176 transitions and 1182 arcs took 5 ms.
Total runtime 48025 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-01
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-02
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-05
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-06
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-08
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-09
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-11
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-12
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-14
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLFireability-2024-15
BK_STOP 1717218000717
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/543/ctl_0_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/543/ctl_1_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/543/ctl_2_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/543/ctl_3_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/543/ctl_4_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/543/ctl_5_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/543/ctl_6_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/543/ctl_7_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/543/ctl_8_
ctl formula name QuasiCertifProtocol-COL-10-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/543/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-COL-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337600018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;