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-171690531700167.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 StigmergyCommit-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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.7M 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 StigmergyCommit-PT-06b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717232167142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:56:08] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2024-06-01 08:56:08] [INFO ] Transformed 2140 places.
[2024-06-01 08:56:08] [INFO ] Transformed 6760 transitions.
[2024-06-01 08:56:08] [INFO ] Found NUPN structural information;
[2024-06-01 08:56:08] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (310 resets) in 2141 ms. (18 steps per ms) remains 14/16 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (44 resets) in 242 ms. (164 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 446 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (46 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 485 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 970 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
// Phase 1: matrix 6760 rows 2140 cols
[2024-06-01 08:56:11] [INFO ] Computed 8 invariants in 132 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyCommit-PT-06b-ReachabilityFireability-2024-07 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-06b-ReachabilityFireability-2024-08 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2038/2140 variables, 8/110 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2140 variables, 2038/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2140 variables, 0/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 6760/8900 variables, 2140/4288 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8900 variables, 0/4288 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8900/8900 variables, and 4288 constraints, problems are : Problem set: 2 solved, 12 unsolved in 5053 ms.
Refiners :[Domain max(s): 2140/2140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 2140/2140 constraints, PredecessorRefiner: 14/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2078/2140 variables, 8/70 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2140 variables, 2078/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2140 variables, 0/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 6760/8900 variables, 2140/4288 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8900 variables, 1/4289 constraints. Problems are: Problem set: 2 solved, 12 unsolved
[2024-06-01 08:56:22] [INFO ] Deduced a trap composed of 399 places in 1579 ms of which 65 ms to minimize.
SMT process timed out in 11480ms, After SMT, problems are : Problem set: 2 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 2038 edges and 2140 vertex of which 126 / 2140 are part of one of the 18 SCC in 13 ms
Free SCC test removed 108 places
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 3348 edges and 2032 vertex of which 2020 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.36 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1540 transitions
Trivial Post-agglo rules discarded 1540 transitions
Performed 1540 trivial Post agglomeration. Transition count delta: 1540
Iterating post reduction 0 with 1546 rules applied. Total rules applied 1548 place count 2020 transition count 5070
Reduce places removed 1540 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 1588 rules applied. Total rules applied 3136 place count 480 transition count 5022
Reduce places removed 18 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 34 rules applied. Total rules applied 3170 place count 462 transition count 5006
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 3190 place count 446 transition count 5002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3192 place count 444 transition count 5002
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 74 Pre rules applied. Total rules applied 3192 place count 444 transition count 4928
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 3340 place count 370 transition count 4928
Discarding 82 places :
Symmetric choice reduction at 5 with 82 rule applications. Total rules 3422 place count 288 transition count 4846
Iterating global reduction 5 with 82 rules applied. Total rules applied 3504 place count 288 transition count 4846
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 3534 place count 258 transition count 4803
Iterating global reduction 5 with 30 rules applied. Total rules applied 3564 place count 258 transition count 4803
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3571 place count 258 transition count 4796
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 3582 place count 247 transition count 4785
Iterating global reduction 6 with 11 rules applied. Total rules applied 3593 place count 247 transition count 4785
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 3601 place count 239 transition count 4777
Iterating global reduction 6 with 8 rules applied. Total rules applied 3609 place count 239 transition count 4777
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3617 place count 239 transition count 4769
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 3669 place count 213 transition count 4743
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3670 place count 213 transition count 4742
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3677 place count 206 transition count 4735
Iterating global reduction 8 with 7 rules applied. Total rules applied 3684 place count 206 transition count 4735
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3691 place count 199 transition count 4728
Iterating global reduction 8 with 7 rules applied. Total rules applied 3698 place count 199 transition count 4728
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3704 place count 193 transition count 4722
Iterating global reduction 8 with 6 rules applied. Total rules applied 3710 place count 193 transition count 4722
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3714 place count 191 transition count 4740
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3717 place count 191 transition count 4737
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 3772 place count 191 transition count 4682
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 3827 place count 136 transition count 4682
Drop transitions (Redundant composition of simpler transitions.) removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 9 with 126 rules applied. Total rules applied 3953 place count 136 transition count 4556
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3957 place count 134 transition count 4566
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3959 place count 134 transition count 4564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3961 place count 132 transition count 4564
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 3970 place count 132 transition count 4564
Applied a total of 3970 rules in 1906 ms. Remains 132 /2140 variables (removed 2008) and now considering 4564/6760 (removed 2196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1919 ms. Remains : 132/2140 places, 4564/6760 transitions.
RANDOM walk for 40000 steps (1987 resets) in 1056 ms. (37 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (116 resets) in 104 ms. (380 steps per ms) remains 10/11 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (247 resets) in 220 ms. (181 steps per ms) remains 9/10 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (265 resets) in 87 ms. (454 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (268 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (239 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 65 ms. (606 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (271 resets) in 55 ms. (714 steps per ms) remains 6/7 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (112 resets) in 116 ms. (341 steps per ms) remains 5/6 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (87 resets) in 90 ms. (439 steps per ms) remains 4/5 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (144 resets) in 102 ms. (388 steps per ms) remains 3/4 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (243 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
// Phase 1: matrix 4564 rows 132 cols
[2024-06-01 08:56:25] [INFO ] Computed 8 invariants in 31 ms
[2024-06-01 08:56:25] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4564/4696 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4696 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4696 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/4696 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4696/4696 variables, and 154 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 132/132 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4564/4696 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4696 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:56:29] [INFO ] Deduced a trap composed of 20 places in 1292 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/4696 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4696 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/4696 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4696/4696 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3157 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 132/132 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 4811ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 112 ms.
Support contains 31 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 4564/4564 transitions.
Graph (trivial) has 56 edges and 132 vertex of which 4 / 132 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 130 transition count 4547
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 117 transition count 4547
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 117 transition count 4545
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 115 transition count 4545
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 113 transition count 3815
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 113 transition count 3815
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 113 transition count 3814
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 54 place count 104 transition count 3805
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 58 place count 104 transition count 3801
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 64 place count 98 transition count 3795
Iterating global reduction 4 with 6 rules applied. Total rules applied 70 place count 98 transition count 3795
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 79 place count 98 transition count 3786
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 81 place count 96 transition count 3784
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 96 transition count 3784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 96 transition count 3783
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 95 transition count 3782
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 95 transition count 3782
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 92 place count 95 transition count 3776
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 94 place count 94 transition count 3786
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 103 place count 94 transition count 3777
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 119 place count 94 transition count 3761
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 135 place count 78 transition count 3761
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 167 place count 78 transition count 3729
Applied a total of 167 rules in 2285 ms. Remains 78 /132 variables (removed 54) and now considering 3729/4564 (removed 835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2285 ms. Remains : 78/132 places, 3729/4564 transitions.
RANDOM walk for 40000 steps (2401 resets) in 507 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (316 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 374405 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 374405 steps, saw 74190 distinct states, run finished after 3004 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 3729 rows 78 cols
[2024-06-01 08:56:35] [INFO ] Computed 8 invariants in 20 ms
[2024-06-01 08:56:37] [INFO ] State equation strengthened by 3210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3729/3807 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3807 variables, 3210/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3807 variables, 0/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3807 variables, 0/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3807/3807 variables, and 3296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8433 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 3210/3210 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3729/3807 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3807 variables, 3210/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3807 variables, 0/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3807 variables, 0/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3807/3807 variables, and 3296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8630 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 3210/3210 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19576ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 31 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 3729/3729 transitions.
Applied a total of 0 rules in 853 ms. Remains 78 /78 variables (removed 0) and now considering 3729/3729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 853 ms. Remains : 78/78 places, 3729/3729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 3729/3729 transitions.
Applied a total of 0 rules in 897 ms. Remains 78 /78 variables (removed 0) and now considering 3729/3729 (removed 0) transitions.
[2024-06-01 08:56:56] [INFO ] Invariant cache hit.
[2024-06-01 08:56:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 08:56:56] [INFO ] Invariant cache hit.
[2024-06-01 08:56:58] [INFO ] State equation strengthened by 3210 read => feed constraints.
[2024-06-01 08:57:05] [INFO ] Implicit Places using invariants and state equation in 8817 ms returned []
Implicit Place search using SMT with State Equation took 8891 ms to find 0 implicit places.
[2024-06-01 08:57:06] [INFO ] Redundant transitions in 252 ms returned []
Running 3705 sub problems to find dead transitions.
[2024-06-01 08:57:06] [INFO ] Invariant cache hit.
[2024-06-01 08:57:08] [INFO ] State equation strengthened by 3210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3705 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3705 unsolved
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 18 places in 820 ms of which 1 ms to minimize.
[2024-06-01 08:58:21] [INFO ] Deduced a trap composed of 18 places in 776 ms of which 1 ms to minimize.
[2024-06-01 08:58:22] [INFO ] Deduced a trap composed of 18 places in 894 ms of which 0 ms to minimize.
[2024-06-01 08:58:23] [INFO ] Deduced a trap composed of 18 places in 808 ms of which 0 ms to minimize.
[2024-06-01 08:58:24] [INFO ] Deduced a trap composed of 17 places in 947 ms of which 1 ms to minimize.
[2024-06-01 08:58:25] [INFO ] Deduced a trap composed of 16 places in 929 ms of which 1 ms to minimize.
[2024-06-01 08:58:26] [INFO ] Deduced a trap composed of 20 places in 760 ms of which 1 ms to minimize.
[2024-06-01 08:58:26] [INFO ] Deduced a trap composed of 16 places in 880 ms of which 1 ms to minimize.
[2024-06-01 08:58:27] [INFO ] Deduced a trap composed of 16 places in 863 ms of which 1 ms to minimize.
[2024-06-01 08:58:28] [INFO ] Deduced a trap composed of 19 places in 859 ms of which 0 ms to minimize.
[2024-06-01 08:58:29] [INFO ] Deduced a trap composed of 18 places in 981 ms of which 2 ms to minimize.
[2024-06-01 08:58:30] [INFO ] Deduced a trap composed of 15 places in 776 ms of which 0 ms to minimize.
[2024-06-01 08:58:31] [INFO ] Deduced a trap composed of 18 places in 847 ms of which 1 ms to minimize.
SMT process timed out in 85260ms, After SMT, problems are : Problem set: 0 solved, 3705 unsolved
Search for dead transitions found 0 dead transitions in 85308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95375 ms. Remains : 78/78 places, 3729/3729 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 78 transition count 3729
Applied a total of 1 rules in 471 ms. Remains 78 /78 variables (removed 0) and now considering 3729/3729 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3729 rows 78 cols
[2024-06-01 08:58:31] [INFO ] Computed 8 invariants in 12 ms
[2024-06-01 08:58:31] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:58:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 08:58:32] [INFO ] After 780ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-06-01 08:58:32] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1441 ms.
[2024-06-01 08:58:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 08:58:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 3729 transitions and 51172 arcs took 39 ms.
[2024-06-01 08:58:33] [INFO ] Flatten gal took : 460 ms
Total runtime 145243 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyCommit-PT-06b-ReachabilityFireability-2024-06

BK_STOP 1717232313769

--------------------
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
mcc2024
rfs formula name StigmergyCommit-PT-06b-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/600/inv_0_
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="StigmergyCommit-PT-06b"
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 StigmergyCommit-PT-06b, 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-171690531700167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;