About the Execution of LTSMin+red for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1231.560 | 161709.00 | 214497.00 | 455.10 | T??TFFFT?FFTT?T? | 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-171662337700049.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-32, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 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.6K 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 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 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 131K 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-32-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717218604147
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:10:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:10:05] [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 05:10:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:10:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2024-06-01 05:10:06] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-06-01 05:10:06] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 05:10:06] [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 1 formulas.
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 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 40074 steps (919 resets) in 817 ms. (48 steps per ms) remains 57/82 properties
BEST_FIRST walk for 4003 steps (29 resets) in 102 ms. (38 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (27 resets) in 84 ms. (47 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (27 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (28 resets) in 55 ms. (71 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 54 ms. (72 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (32 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (27 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (48 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4000 steps (48 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4013 steps (28 resets) in 16 ms. (236 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (29 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4014 steps (28 resets) in 16 ms. (236 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (29 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (29 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4008 steps (28 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (24 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4009 steps (48 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4015 steps (28 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4012 steps (28 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (20 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4008 steps (48 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:10:07] [INFO ] Computed 5 invariants in 7 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 36 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/54 variables, 28/33 constraints. Problems are: Problem set: 45 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 45 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/56 variables, 2/35 constraints. Problems are: Problem set: 45 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 45 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 45 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 45 solved, 12 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 45 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 45 solved, 12 unsolved
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/24 variables, 4/5 constraints. Problems are: Problem set: 47 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 47 solved, 10 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 48 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 2/31 constraints. Problems are: Problem set: 48 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/31 constraints. Problems are: Problem set: 48 solved, 9 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 7 (OVERLAPS) 6/56 variables, 6/37 constraints. Problems are: Problem set: 49 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 6/43 constraints. Problems are: Problem set: 49 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/43 constraints. Problems are: Problem set: 49 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/43 constraints. Problems are: Problem set: 49 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 43 constraints, problems are : Problem set: 49 solved, 8 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 8/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 804ms problems are : Problem set: 49 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 191 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=95 )
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 8 properties in 323 ms.
Successfully simplified 49 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:10:08] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 05:10:08] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:10:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:10:08] [INFO ] Flatten gal took : 6 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:10:08] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 32 ms.
[2024-06-01 05:10:08] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 3770 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3805 transition count 506
Applied a total of 1 rules in 33 ms. Remains 3805 /3806 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3805 cols
[2024-06-01 05:10:08] [INFO ] Computed 3300 invariants in 133 ms
[2024-06-01 05:10:15] [INFO ] Implicit Places using invariants in 6923 ms returned []
[2024-06-01 05:10:15] [INFO ] Invariant cache hit.
[2024-06-01 05:10:27] [INFO ] Implicit Places using invariants and state equation in 12044 ms returned []
Implicit Place search using SMT with State Equation took 18976 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-06-01 05:10:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4311 variables, and 2208 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/35 constraints, Generalized P Invariants (flows): 2208/3265 constraints, State Equation: 0/3805 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3735 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 70/3805 variables, 35/2243 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3805 variables, 1057/3300 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3805/4311 variables, and 3300 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 3265/3265 constraints, State Equation: 0/3805 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61057ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61068ms
Starting structural reductions in LTL mode, iteration 1 : 3805/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80094 ms. Remains : 3805/3806 places, 506/506 transitions.
Support contains 3770 out of 3805 places after structural reductions.
[2024-06-01 05:11:28] [INFO ] Flatten gal took : 200 ms
[2024-06-01 05:11:28] [INFO ] Flatten gal took : 135 ms
[2024-06-01 05:11:29] [INFO ] Input system was already deterministic with 506 transitions.
RANDOM walk for 40000 steps (1067 resets) in 5103 ms. (7 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 189 ms. (21 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 114308 steps, run timeout after 3005 ms. (steps per millisecond=38 ) properties seen :18 out of 30
Probabilistic random walk after 114308 steps, saw 33865 distinct states, run finished after 3014 ms. (steps per millisecond=37 ) properties seen :18
[2024-06-01 05:11:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 103/1428 variables, 35/35 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1428 variables, 1056/1091 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1428 variables, 0/1091 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 67/1495 variables, 33/1124 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/1124 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2178/3673 variables, 2112/3236 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3673 variables, 0/3236 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 506/4179 variables, 3673/6909 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4179 variables, 0/6909 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 132/4311 variables, 132/7041 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4311 variables, 64/7105 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4311/4311 variables, and 7105 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 3265/3265 constraints, State Equation: 3805/3805 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1290 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/1395 variables, 35/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1395 variables, 1056/1091 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-06-01 05:11:40] [INFO ] Deduced a trap composed of 9 places in 548 ms of which 68 ms to minimize.
[2024-06-01 05:11:41] [INFO ] Deduced a trap composed of 8 places in 536 ms of which 11 ms to minimize.
[2024-06-01 05:11:41] [INFO ] Deduced a trap composed of 9 places in 493 ms of which 9 ms to minimize.
[2024-06-01 05:11:42] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 9 ms to minimize.
[2024-06-01 05:11:42] [INFO ] Deduced a trap composed of 8 places in 490 ms of which 8 ms to minimize.
[2024-06-01 05:11:43] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 9 ms to minimize.
[2024-06-01 05:11:43] [INFO ] Deduced a trap composed of 9 places in 468 ms of which 9 ms to minimize.
[2024-06-01 05:11:44] [INFO ] Deduced a trap composed of 8 places in 437 ms of which 9 ms to minimize.
SMT process timed out in 10428ms, After SMT, problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1288 out of 3805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43440 edges and 3805 vertex of which 3702 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.22 ms
Discarding 103 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 3702 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 3701 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 3700 transition count 466
Ensure Unique test removed 33 places
Iterating post reduction 2 with 33 rules applied. Total rules applied 73 place count 3667 transition count 466
Applied a total of 73 rules in 492 ms. Remains 3667 /3805 variables (removed 138) and now considering 466/506 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 3667/3805 places, 466/506 transitions.
RANDOM walk for 40000 steps (643 resets) in 1279 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 1340 ms. (29 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 229812 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 229812 steps, saw 51485 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 466 rows 3667 cols
[2024-06-01 05:11:48] [INFO ] Computed 3202 invariants in 146 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1288 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1288 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 465/1753 variables, 1288/2312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1753 variables, 0/2312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 4 (OVERLAPS) 2380/4133 variables, 2379/4691 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4133 variables, 2178/6869 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4133 variables, 0/6869 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/4133 variables, 0/6869 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4133/4133 variables, and 6869 constraints, problems are : Problem set: 1 solved, 3 unsolved in 7520 ms.
Refiners :[Generalized P Invariants (flows): 3202/3202 constraints, State Equation: 3667/3667 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1288 variables, 1024/1024 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1288 variables, 0/1024 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 465/1753 variables, 1288/2312 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1753 variables, 0/2312 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2380/4133 variables, 2379/4691 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4133 variables, 2178/6869 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4133 variables, 3/6872 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4133 variables, 0/6872 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/4133 variables, 0/6872 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4133/4133 variables, and 6872 constraints, problems are : Problem set: 2 solved, 2 unsolved in 44224 ms.
Refiners :[Generalized P Invariants (flows): 3202/3202 constraints, State Equation: 3667/3667 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 52210ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 208 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=41 )
Parikh walk visited 2 properties in 86 ms.
Successfully simplified 10 atomic propositions for a total of 7 simplifications.
[2024-06-01 05:12:41] [INFO ] Flatten gal took : 107 ms
[2024-06-01 05:12:41] [INFO ] Flatten gal took : 104 ms
[2024-06-01 05:12:41] [INFO ] Input system was already deterministic with 506 transitions.
Computed a total of 3805 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3805 transition count 506
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.
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43440 edges and 3805 vertex of which 1425 are kept as prefixes of interest. Removing 2380 places using SCC suffix rule.23 ms
Discarding 2380 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
Applied a total of 99 rules in 77 ms. Remains 1424 /3805 variables (removed 2381) and now considering 306/506 (removed 200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 1424/3805 places, 306/506 transitions.
[2024-06-01 05:12:41] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:12:41] [INFO ] Flatten gal took : 31 ms
[2024-06-01 05:12:41] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3737 transition count 506
Applied a total of 68 rules in 301 ms. Remains 3737 /3805 variables (removed 68) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 3737/3805 places, 506/506 transitions.
[2024-06-01 05:12:42] [INFO ] Flatten gal took : 90 ms
[2024-06-01 05:12:42] [INFO ] Flatten gal took : 91 ms
[2024-06-01 05:12:42] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43440 edges and 3805 vertex of which 2547 are kept as prefixes of interest. Removing 1258 places using SCC suffix rule.15 ms
Discarding 1258 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 2546 transition count 372
Applied a total of 66 rules in 116 ms. Remains 2546 /3805 variables (removed 1259) and now considering 372/506 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 117 ms. Remains : 2546/3805 places, 372/506 transitions.
[2024-06-01 05:12:42] [INFO ] Flatten gal took : 48 ms
[2024-06-01 05:12:42] [INFO ] Flatten gal took : 48 ms
[2024-06-01 05:12:42] [INFO ] Input system was already deterministic with 372 transitions.
RANDOM walk for 40000 steps (902 resets) in 1054 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 718 ms. (55 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7180 steps, run visited all 1 properties in 182 ms. (steps per millisecond=39 )
Probabilistic random walk after 7180 steps, saw 7045 distinct states, run finished after 189 ms. (steps per millisecond=37 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3736 transition count 506
Applied a total of 69 rules in 259 ms. Remains 3736 /3805 variables (removed 69) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 3736/3805 places, 506/506 transitions.
[2024-06-01 05:12:43] [INFO ] Flatten gal took : 73 ms
[2024-06-01 05:12:43] [INFO ] Flatten gal took : 76 ms
[2024-06-01 05:12:43] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3770 transition count 506
Applied a total of 35 rules in 130 ms. Remains 3770 /3805 variables (removed 35) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 3770/3805 places, 506/506 transitions.
[2024-06-01 05:12:44] [INFO ] Flatten gal took : 75 ms
[2024-06-01 05:12:44] [INFO ] Flatten gal took : 80 ms
[2024-06-01 05:12:44] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43440 edges and 3805 vertex of which 3769 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.15 ms
Discarding 36 places :
Also discarding 0 output 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 2 place count 3768 transition count 505
Applied a total of 2 rules in 625 ms. Remains 3768 /3805 variables (removed 37) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 625 ms. Remains : 3768/3805 places, 505/506 transitions.
[2024-06-01 05:12:45] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:12:45] [INFO ] Flatten gal took : 78 ms
[2024-06-01 05:12:45] [INFO ] Input system was already deterministic with 505 transitions.
[2024-06-01 05:12:45] [INFO ] Flatten gal took : 79 ms
[2024-06-01 05:12:45] [INFO ] Flatten gal took : 80 ms
[2024-06-01 05:12:45] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 05:12:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3805 places, 506 transitions and 8140 arcs took 11 ms.
Total runtime 160275 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-32-CTLCardinality-2024-01
Could not compute solution for formula : QuasiCertifProtocol-COL-32-CTLCardinality-2024-02
Could not compute solution for formula : QuasiCertifProtocol-COL-32-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-COL-32-CTLCardinality-2024-13
Could not compute solution for formula : QuasiCertifProtocol-COL-32-CTLCardinality-2024-15
BK_STOP 1717218765856
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-COL-32-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/581/ctl_0_
ctl formula name QuasiCertifProtocol-COL-32-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/581/ctl_1_
ctl formula name QuasiCertifProtocol-COL-32-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/581/ctl_2_
ctl formula name QuasiCertifProtocol-COL-32-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/581/ctl_3_
ctl formula name QuasiCertifProtocol-COL-32-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/581/ctl_4_
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-32"
export BK_EXAMINATION="CTLCardinality"
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-32, examination is CTLCardinality"
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-171662337700049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;