About the Execution of LTSMin+red for StigmergyElection-PT-07b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
996.376 | 26963.00 | 50911.00 | 80.90 | FTTTFTTTTFFFTFFT | 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.r536-tall-171690532100343.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 StigmergyElection-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532100343
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 StigmergyElection-PT-07b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717247800148
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:16:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:16:41] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2024-06-01 13:16:41] [INFO ] Transformed 971 places.
[2024-06-01 13:16:41] [INFO ] Transformed 5542 transitions.
[2024-06-01 13:16:41] [INFO ] Found NUPN structural information;
[2024-06-01 13:16:41] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 571 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (327 resets) in 1601 ms. (24 steps per ms) remains 14/16 properties
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 509 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (46 resets) in 357 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (48 resets) in 286 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 1084 ms. (36 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 224 ms. (177 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 67 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (48 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 56 ms. (701 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 194 ms. (205 steps per ms) remains 14/14 properties
// Phase 1: matrix 5542 rows 971 cols
[2024-06-01 13:16:43] [INFO ] Computed 8 invariants in 127 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-00 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-09 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-10 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 884/971 variables, 8/95 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 884/979 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 3 solved, 11 unsolved in 4102 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-01 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 889/971 variables, 8/90 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 889/979 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5016 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10027ms problems are : Problem set: 4 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1291 ms.
Support contains 74 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 782 edges and 971 vertex of which 139 / 971 are part of one of the 19 SCC in 5 ms
Free SCC test removed 120 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 1948 edges and 851 vertex of which 841 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.33 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 456 rules applied. Total rules applied 458 place count 841 transition count 4929
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 462 rules applied. Total rules applied 920 place count 390 transition count 4918
Reduce places removed 5 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 2 with 58 rules applied. Total rules applied 978 place count 385 transition count 4865
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1031 place count 332 transition count 4865
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1031 place count 332 transition count 4818
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1125 place count 285 transition count 4818
Discarding 73 places :
Symmetric choice reduction at 4 with 73 rule applications. Total rules 1198 place count 212 transition count 4745
Iterating global reduction 4 with 73 rules applied. Total rules applied 1271 place count 212 transition count 4745
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 1284 place count 212 transition count 4732
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1285 place count 211 transition count 4732
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1285 place count 211 transition count 4730
Deduced a syphon composed of 2 places in 30 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1289 place count 209 transition count 4730
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1298 place count 200 transition count 4708
Iterating global reduction 6 with 9 rules applied. Total rules applied 1307 place count 200 transition count 4708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1308 place count 200 transition count 4707
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1311 place count 197 transition count 4704
Iterating global reduction 7 with 3 rules applied. Total rules applied 1314 place count 197 transition count 4704
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 13 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1350 place count 179 transition count 4686
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1355 place count 174 transition count 4681
Iterating global reduction 7 with 5 rules applied. Total rules applied 1360 place count 174 transition count 4681
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1366 place count 171 transition count 4689
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 1378 place count 171 transition count 4677
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1380 place count 170 transition count 4679
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1382 place count 170 transition count 4677
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1384 place count 168 transition count 4677
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1390 place count 162 transition count 4671
Iterating global reduction 8 with 6 rules applied. Total rules applied 1396 place count 162 transition count 4671
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1400 place count 162 transition count 4671
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1401 place count 162 transition count 4671
Applied a total of 1401 rules in 1384 ms. Remains 162 /971 variables (removed 809) and now considering 4671/5542 (removed 871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1397 ms. Remains : 162/971 places, 4671/5542 transitions.
RANDOM walk for 40000 steps (1182 resets) in 723 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (161 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (147 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (147 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (141 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (148 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (143 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (149 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 241425 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :1 out of 7
Probabilistic random walk after 241425 steps, saw 57473 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 4671 rows 162 cols
[2024-06-01 13:16:59] [INFO ] Computed 8 invariants in 48 ms
[2024-06-01 13:17:00] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 93/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/162 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4671/4833 variables, 162/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4833 variables, 18/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4833 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/4833 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4833/4833 variables, and 188 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 93/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:17:04] [INFO ] Deduced a trap composed of 35 places in 1471 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/162 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 4671/4833 variables, 162/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4833 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4833 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/4833 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4833/4833 variables, and 189 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4117 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 6727ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 60 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 386 ms.
All properties solved without resorting to model-checking.
Total runtime 25743 ms.
ITS solved all properties within timeout
BK_STOP 1717247827111
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
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="StigmergyElection-PT-07b"
export BK_EXAMINATION="ReachabilityFireability"
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 StigmergyElection-PT-07b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532100343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07b.tgz
mv StigmergyElection-PT-07b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;