About the Execution of LTSMin+red for QuasiCertifProtocol-COL-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 366.479 | 21926.00 | 41188.00 | 87.90 | ???F?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-171662337600010.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 03:49 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.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 11K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 03:53 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 61K 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-06-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717217916194
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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:37] [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:58:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:58:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 557 ms
[2024-06-01 04:58:38] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2024-06-01 04:58:38] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 04:58:38] [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 9 formulas.
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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).
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40003 steps (3042 resets) in 1670 ms. (23 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40004 steps (1049 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1051 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1248 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1077 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1055 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1192 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1381 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1255 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:58:39] [INFO ] Computed 5 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/28 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/54 variables, 28/33 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 5 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/17 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/34 variables, 17/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/23 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (OVERLAPS) 17/51 variables, 9/32 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 2/34 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/55 variables, 1/35 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 2/37 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 04:58:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 1/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/56 variables, 2/40 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 40 constraints, problems are : Problem set: 4 solved, 4 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 527ms problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 7 ms.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2024-06-01 04:58:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 04:58:39] [INFO ] Flatten gal took : 20 ms
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:58:39] [INFO ] Flatten gal took : 5 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:58:39] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 12 ms.
[2024-06-01 04:58:39] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 252 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 13 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-06-01 04:58:39] [INFO ] Computed 138 invariants in 26 ms
[2024-06-01 04:58:39] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 04:58:39] [INFO ] Invariant cache hit.
[2024-06-01 04:58:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 04:58:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/368 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4453 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 108/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/368 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 498 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6131 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10682ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10695ms
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10974 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 252 out of 252 places after structural reductions.
[2024-06-01 04:58:50] [INFO ] Flatten gal took : 45 ms
[2024-06-01 04:58:50] [INFO ] Flatten gal took : 39 ms
[2024-06-01 04:58:51] [INFO ] Input system was already deterministic with 116 transitions.
Reduction of identical properties reduced properties to check from 42 to 37
RANDOM walk for 40000 steps (3933 resets) in 1023 ms. (39 steps per ms) remains 32/37 properties
BEST_FIRST walk for 4002 steps (42 resets) in 113 ms. (35 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 58 ms. (67 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (41 resets) in 51 ms. (76 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (71 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (70 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (68 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (71 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (69 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (41 resets) in 43 ms. (91 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (69 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (41 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (70 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (70 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (67 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (43 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (67 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (64 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (66 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (70 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (68 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (70 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (66 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (69 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (66 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4003 steps (72 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
[2024-06-01 04:58:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 7/250 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 4 (OVERLAPS) 115/365 variables, 250/388 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/388 constraints. Problems are: Problem set: 6 solved, 20 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/368 variables, 2/390 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 8 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 8 solved, 18 unsolved in 1593 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 126/126 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/126 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 7/221 variables, 6/132 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/132 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 105/326 variables, 221/353 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 18/371 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/371 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 24/350 variables, 15/386 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/386 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 17/367 variables, 15/401 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 6/407 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/407 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 1/368 variables, 1/408 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/408 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 0/368 variables, 0/408 constraints. Problems are: Problem set: 8 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 408 constraints, problems are : Problem set: 8 solved, 18 unsolved in 3388 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 18/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 5042ms problems are : Problem set: 8 solved, 18 unsolved
Fused 18 Parikh solutions to 14 different solutions.
Finished Parikh walk after 4576 steps, including 100 resets, run visited all 1 properties in 14 ms. (steps per millisecond=326 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 65 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
[2024-06-01 04:58:56] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:58:56] [INFO ] Flatten gal took : 16 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 21 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 16 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 18 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 13 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 244 transition count 114
Applied a total of 3 rules in 27 ms. Remains 244 /252 variables (removed 8) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 244/252 places, 114/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 22 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 12 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 7 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 7 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 7 ms. Remains 244 /252 variables (removed 8) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 244/252 places, 114/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 6 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 6 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 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 252 transition count 116
Applied a total of 1 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 6 ms
[2024-06-01 04:58:57] [INFO ] Input system was already deterministic with 116 transitions.
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:57] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:57] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 04:58:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 3 ms.
Total runtime 20427 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-06-CTLFireability-2024-00
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-01
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-02
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-04
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-06
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-08
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-09
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-10
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-11
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-12
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-13
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-2024-15
BK_STOP 1717217938120
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/527/ctl_0_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/527/ctl_1_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/527/ctl_2_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/527/ctl_3_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/527/ctl_4_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/527/ctl_5_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/527/ctl_6_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/527/ctl_7_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/527/ctl_8_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/527/ctl_9_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/527/ctl_10_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/527/ctl_11_
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-06"
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-06, 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-171662337600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;