About the Execution of LTSMin+red for CloudDeployment-PT-6b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5553.104 | 205775.00 | 269088.00 | 581.00 | ????TTF??TFT???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.r476-tall-171620506200610.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 CloudDeployment-PT-6b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200610
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 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 CloudDeployment-PT-6b-CTLFireability-2024-00
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-01
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-02
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-03
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-04
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-05
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-06
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-07
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-08
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-09
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-10
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2024-11
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717209159259
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:32:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:32:40] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2024-06-01 02:32:40] [INFO ] Transformed 1888 places.
[2024-06-01 02:32:40] [INFO ] Transformed 6804 transitions.
[2024-06-01 02:32:40] [INFO ] Found NUPN structural information;
[2024-06-01 02:32:40] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 89 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1882 transition count 6804
Discarding 511 places :
Symmetric choice reduction at 1 with 511 rule applications. Total rules 517 place count 1371 transition count 6293
Iterating global reduction 1 with 511 rules applied. Total rules applied 1028 place count 1371 transition count 6293
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 1229 place count 1170 transition count 6092
Iterating global reduction 1 with 201 rules applied. Total rules applied 1430 place count 1170 transition count 6092
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1458 place count 1170 transition count 6064
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1477 place count 1151 transition count 6045
Iterating global reduction 2 with 19 rules applied. Total rules applied 1496 place count 1151 transition count 6045
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1498 place count 1149 transition count 6043
Iterating global reduction 2 with 2 rules applied. Total rules applied 1500 place count 1149 transition count 6043
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1501 place count 1148 transition count 6042
Iterating global reduction 2 with 1 rules applied. Total rules applied 1502 place count 1148 transition count 6042
Applied a total of 1502 rules in 638 ms. Remains 1148 /1888 variables (removed 740) and now considering 6042/6804 (removed 762) transitions.
// Phase 1: matrix 6042 rows 1148 cols
[2024-06-01 02:32:41] [INFO ] Computed 19 invariants in 108 ms
[2024-06-01 02:32:42] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-06-01 02:32:42] [INFO ] Invariant cache hit.
[2024-06-01 02:32:44] [INFO ] Implicit Places using invariants and state equation in 2475 ms returned []
Implicit Place search using SMT with State Equation took 3102 ms to find 0 implicit places.
Running 6041 sub problems to find dead transitions.
[2024-06-01 02:32:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1147 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1147/7190 variables, and 19 constraints, problems are : Problem set: 0 solved, 6041 unsolved in 30140 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1148 constraints, PredecessorRefiner: 6041/1945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1147 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6041 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/7190 variables, and 19 constraints, problems are : Problem set: 0 solved, 6041 unsolved in 30078 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1148 constraints, PredecessorRefiner: 4096/1945 constraints, Known Traps: 0/0 constraints]
After SMT, in 143485ms problems are : Problem set: 0 solved, 6041 unsolved
Search for dead transitions found 0 dead transitions in 143625ms
Starting structural reductions in LTL mode, iteration 1 : 1148/1888 places, 6042/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147445 ms. Remains : 1148/1888 places, 6042/6804 transitions.
Support contains 89 out of 1148 places after structural reductions.
[2024-06-01 02:35:10] [INFO ] Flatten gal took : 1184 ms
[2024-06-01 02:35:11] [INFO ] Flatten gal took : 819 ms
[2024-06-01 02:35:12] [INFO ] Input system was already deterministic with 6042 transitions.
Support contains 88 out of 1148 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (214 resets) in 4402 ms. (9 steps per ms) remains 74/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
[2024-06-01 02:35:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 216/290 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 5088/5378 variables, 290/309 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5378/7190 variables, and 309 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 290/1148 constraints, PredecessorRefiner: 74/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 216/290 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 5088/5378 variables, 290/309 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5378 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5378/7190 variables, and 311 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 290/1148 constraints, PredecessorRefiner: 60/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 11509ms problems are : Problem set: 0 solved, 74 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 1148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Graph (trivial) has 1099 edges and 1148 vertex of which 351 / 1148 are part of one of the 41 SCC in 8 ms
Free SCC test removed 310 places
Drop transitions (Empty/Sink Transition effects.) removed 394 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 3306 edges and 838 vertex of which 837 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 308 rules applied. Total rules applied 310 place count 837 transition count 5339
Reduce places removed 303 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 323 rules applied. Total rules applied 633 place count 534 transition count 5319
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 650 place count 517 transition count 5319
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 650 place count 517 transition count 5241
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 806 place count 439 transition count 5241
Performed 114 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 1034 place count 325 transition count 5126
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -237
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1110 place count 287 transition count 5363
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1153 place count 287 transition count 5320
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1154 place count 286 transition count 5306
Iterating global reduction 4 with 1 rules applied. Total rules applied 1155 place count 286 transition count 5306
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1167 place count 280 transition count 5366
Drop transitions (Redundant composition of simpler transitions.) removed 101 transitions
Redundant transition composition rules discarded 101 transitions
Iterating global reduction 4 with 101 rules applied. Total rules applied 1268 place count 280 transition count 5265
Free-agglomeration rule applied 39 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 1307 place count 280 transition count 5224
Reduce places removed 39 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 4 with 104 rules applied. Total rules applied 1411 place count 241 transition count 5159
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1412 place count 240 transition count 5152
Iterating global reduction 5 with 1 rules applied. Total rules applied 1413 place count 240 transition count 5152
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 1441 place count 240 transition count 5124
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1445 place count 240 transition count 5124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1446 place count 240 transition count 5123
Applied a total of 1446 rules in 800 ms. Remains 240 /1148 variables (removed 908) and now considering 5123/6042 (removed 919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 801 ms. Remains : 240/1148 places, 5123/6042 transitions.
RANDOM walk for 40000 steps (700 resets) in 2782 ms. (14 steps per ms) remains 66/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
[2024-06-01 02:35:27] [INFO ] Flow matrix only has 4825 transitions (discarded 298 similar events)
// Phase 1: matrix 4825 rows 240 cols
[2024-06-01 02:35:27] [INFO ] Computed 24 invariants in 74 ms
[2024-06-01 02:35:27] [INFO ] State equation strengthened by 202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 158/224 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 4815/5039 variables, 224/248 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5039 variables, 195/443 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5039 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 7 (OVERLAPS) 23/5062 variables, 14/457 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5062 variables, 7/464 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5062 variables, 0/464 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/5065 variables, 2/466 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5065 variables, 0/466 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/5065 variables, 0/466 constraints. Problems are: Problem set: 52 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5065/5065 variables, and 466 constraints, problems are : Problem set: 52 solved, 14 unsolved in 17957 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 240/240 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 66/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 52 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 169/222 variables, 23/24 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/24 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4809/5031 variables, 222/246 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5031 variables, 195/441 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5031 variables, 6/447 constraints. Problems are: Problem set: 52 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5031 variables, 0/447 constraints. Problems are: Problem set: 52 solved, 14 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 8 (OVERLAPS) 30/5061 variables, 15/462 constraints. Problems are: Problem set: 56 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5061 variables, 7/469 constraints. Problems are: Problem set: 56 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5061 variables, 0/469 constraints. Problems are: Problem set: 56 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 4/5065 variables, 3/472 constraints. Problems are: Problem set: 56 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5065 variables, 4/476 constraints. Problems are: Problem set: 56 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5065 variables, 0/476 constraints. Problems are: Problem set: 56 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/5065 variables, 0/476 constraints. Problems are: Problem set: 56 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5065/5065 variables, and 476 constraints, problems are : Problem set: 56 solved, 10 unsolved in 6948 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 240/240 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 14/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 26240ms problems are : Problem set: 56 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 7 properties in 1457 ms.
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 5123/5123 transitions.
Graph (trivial) has 140 edges and 240 vertex of which 22 / 240 are part of one of the 9 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 4120 transitions
Reduce isomorphic transitions removed 4120 transitions.
Graph (complete) has 1968 edges and 227 vertex of which 194 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 194 transition count 982
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 190 transition count 982
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 27 place count 190 transition count 979
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 187 transition count 979
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 184 transition count 970
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 184 transition count 970
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 184 transition count 968
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 182 transition count 968
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 63 place count 172 transition count 958
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 69 place count 172 transition count 952
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 168 transition count 988
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 94 place count 168 transition count 971
Drop transitions (Redundant composition of simpler transitions.) removed 129 transitions
Redundant transition composition rules discarded 129 transitions
Iterating global reduction 4 with 129 rules applied. Total rules applied 223 place count 168 transition count 842
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 245 place count 168 transition count 814
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 78 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 4 with 123 rules applied. Total rules applied 368 place count 146 transition count 713
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 371 place count 143 transition count 686
Iterating global reduction 5 with 3 rules applied. Total rules applied 374 place count 143 transition count 686
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 376 place count 143 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 6 with 55 rules applied. Total rules applied 431 place count 143 transition count 629
Applied a total of 431 rules in 97 ms. Remains 143 /240 variables (removed 97) and now considering 629/5123 (removed 4494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 143/240 places, 629/5123 transitions.
RANDOM walk for 40000 steps (550 resets) in 213 ms. (186 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-06-01 02:35:55] [INFO ] Flow matrix only has 335 transitions (discarded 294 similar events)
// Phase 1: matrix 335 rows 143 cols
[2024-06-01 02:35:55] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 02:35:55] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/88 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/138 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 333/471 variables, 138/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 201/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/478 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 25/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/478 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 391 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 143/143 constraints, ReadFeed: 226/226 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/88 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/138 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:35:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 333/471 variables, 138/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 201/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/478 variables, 5/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 25/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/478 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 143/143 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 56 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 02:35:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 02:35:56] [INFO ] Flatten gal took : 734 ms
[2024-06-01 02:35:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-6b-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 02:35:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-6b-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 02:35:57] [INFO ] Flatten gal took : 767 ms
[2024-06-01 02:35:58] [INFO ] Input system was already deterministic with 6042 transitions.
Support contains 20 out of 1148 places (down from 67) after GAL structural reductions.
FORMULA CloudDeployment-PT-6b-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 179 stabilizing places and 4753 stable transitions
Graph (complete) has 3774 edges and 1148 vertex of which 1114 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.43 ms
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 1121 transition count 1933
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 1121 transition count 1933
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1121 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 1119 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 1119 transition count 1929
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 1117 transition count 1927
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 1117 transition count 1927
Applied a total of 63 rules in 567 ms. Remains 1117 /1148 variables (removed 31) and now considering 1927/6042 (removed 4115) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 1117/1148 places, 1927/6042 transitions.
[2024-06-01 02:35:59] [INFO ] Flatten gal took : 52 ms
[2024-06-01 02:35:59] [INFO ] Flatten gal took : 53 ms
[2024-06-01 02:35:59] [INFO ] Input system was already deterministic with 1927 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1120 transition count 1932
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 1118 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 1116 transition count 1926
Applied a total of 65 rules in 398 ms. Remains 1116 /1148 variables (removed 32) and now considering 1926/6042 (removed 4116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 1116/1148 places, 1926/6042 transitions.
[2024-06-01 02:35:59] [INFO ] Flatten gal took : 52 ms
[2024-06-01 02:35:59] [INFO ] Flatten gal took : 55 ms
[2024-06-01 02:35:59] [INFO ] Input system was already deterministic with 1926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1120 transition count 1932
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 1118 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 1116 transition count 1926
Applied a total of 65 rules in 248 ms. Remains 1116 /1148 variables (removed 32) and now considering 1926/6042 (removed 4116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 1116/1148 places, 1926/6042 transitions.
[2024-06-01 02:36:00] [INFO ] Flatten gal took : 52 ms
[2024-06-01 02:36:00] [INFO ] Flatten gal took : 54 ms
[2024-06-01 02:36:00] [INFO ] Input system was already deterministic with 1926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1120 transition count 1932
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 1118 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 1116 transition count 1926
Applied a total of 65 rules in 231 ms. Remains 1116 /1148 variables (removed 32) and now considering 1926/6042 (removed 4116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 1116/1148 places, 1926/6042 transitions.
[2024-06-01 02:36:00] [INFO ] Flatten gal took : 51 ms
[2024-06-01 02:36:00] [INFO ] Flatten gal took : 54 ms
[2024-06-01 02:36:00] [INFO ] Input system was already deterministic with 1926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1120 transition count 1932
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 1118 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 1116 transition count 1926
Applied a total of 65 rules in 231 ms. Remains 1116 /1148 variables (removed 32) and now considering 1926/6042 (removed 4116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 1116/1148 places, 1926/6042 transitions.
[2024-06-01 02:36:01] [INFO ] Flatten gal took : 51 ms
[2024-06-01 02:36:01] [INFO ] Flatten gal took : 55 ms
[2024-06-01 02:36:01] [INFO ] Input system was already deterministic with 1926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1120 transition count 1932
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 1118 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 1116 transition count 1926
Applied a total of 65 rules in 231 ms. Remains 1116 /1148 variables (removed 32) and now considering 1926/6042 (removed 4116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 1116/1148 places, 1926/6042 transitions.
[2024-06-01 02:36:01] [INFO ] Flatten gal took : 51 ms
[2024-06-01 02:36:01] [INFO ] Flatten gal took : 54 ms
[2024-06-01 02:36:01] [INFO ] Input system was already deterministic with 1926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 1122 transition count 1934
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 1122 transition count 1934
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 1122 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1121 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1121 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1120 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1120 transition count 1930
Applied a total of 57 rules in 229 ms. Remains 1120 /1148 variables (removed 28) and now considering 1930/6042 (removed 4112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 1120/1148 places, 1930/6042 transitions.
[2024-06-01 02:36:02] [INFO ] Flatten gal took : 51 ms
[2024-06-01 02:36:02] [INFO ] Flatten gal took : 53 ms
[2024-06-01 02:36:02] [INFO ] Input system was already deterministic with 1930 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Graph (trivial) has 1180 edges and 1148 vertex of which 434 / 1148 are part of one of the 48 SCC in 2 ms
Free SCC test removed 386 places
Ensure Unique test removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 3258 edges and 762 vertex of which 728 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 places :
Also discarding 4098 output transitions
Drop transitions (Output transitions of discarded places.) removed 4098 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 727 transition count 1203
Reduce places removed 300 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 301 rules applied. Total rules applied 603 place count 427 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 604 place count 426 transition count 1202
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 604 place count 426 transition count 1143
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 722 place count 367 transition count 1143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 728 place count 361 transition count 1137
Iterating global reduction 3 with 6 rules applied. Total rules applied 734 place count 361 transition count 1137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 736 place count 361 transition count 1135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 736 place count 361 transition count 1134
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 738 place count 360 transition count 1134
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 938 place count 260 transition count 1034
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 962 place count 260 transition count 1010
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 12 rules applied. Total rules applied 974 place count 260 transition count 998
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 986 place count 248 transition count 998
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 998 place count 242 transition count 992
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 999 place count 241 transition count 991
Applied a total of 999 rules in 195 ms. Remains 241 /1148 variables (removed 907) and now considering 991/6042 (removed 5051) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 195 ms. Remains : 241/1148 places, 991/6042 transitions.
[2024-06-01 02:36:02] [INFO ] Flatten gal took : 40 ms
[2024-06-01 02:36:02] [INFO ] Flatten gal took : 43 ms
[2024-06-01 02:36:02] [INFO ] Input system was already deterministic with 991 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1148/1148 places, 6042/6042 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 6042
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1120 transition count 1932
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 1118 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 1116 transition count 1926
Applied a total of 65 rules in 231 ms. Remains 1116 /1148 variables (removed 32) and now considering 1926/6042 (removed 4116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 1116/1148 places, 1926/6042 transitions.
[2024-06-01 02:36:02] [INFO ] Flatten gal took : 54 ms
[2024-06-01 02:36:02] [INFO ] Flatten gal took : 55 ms
[2024-06-01 02:36:03] [INFO ] Input system was already deterministic with 1926 transitions.
[2024-06-01 02:36:03] [INFO ] Flatten gal took : 741 ms
[2024-06-01 02:36:04] [INFO ] Flatten gal took : 790 ms
[2024-06-01 02:36:04] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 02:36:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1148 places, 6042 transitions and 90229 arcs took 57 ms.
Total runtime 204339 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 : CloudDeployment-PT-6b-CTLFireability-2024-00
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2024-01
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2024-02
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2024-03
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2024-07
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2024-08
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2023-12
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2023-13
Could not compute solution for formula : CloudDeployment-PT-6b-CTLFireability-2023-14
BK_STOP 1717209365034
--------------------
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 CloudDeployment-PT-6b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/556/ctl_0_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/556/ctl_1_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/556/ctl_2_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/556/ctl_3_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/556/ctl_4_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/556/ctl_5_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/556/ctl_6_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/556/ctl_7_
ctl formula name CloudDeployment-PT-6b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/556/ctl_8_
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="CloudDeployment-PT-6b"
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 CloudDeployment-PT-6b, 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 r476-tall-171620506200610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b 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 ;