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.r524-tall-171679079500061.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 RingSingleMessageInMbox-PT-d1m005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079500061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 00:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 00:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717218112126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:01:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:01:53] [INFO ] Load time of PNML (sax parser for PT used): 453 ms
[2024-06-01 05:01:53] [INFO ] Transformed 6690 places.
[2024-06-01 05:01:54] [INFO ] Transformed 11934 transitions.
[2024-06-01 05:01:54] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 638 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 4305 places in 36 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 11934 rows 2385 cols
[2024-06-01 05:01:55] [INFO ] Computed 5 invariants in 992 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (1591 resets) in 860 ms. (11 steps per ms)
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (109 resets) in 59 ms. (333 steps per ms)
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:01:56] [INFO ] Invariant cache hit.
[2024-06-01 05:01:56] [INFO ] [Real]Absence check using 2 positive place invariants in 55 ms returned sat
[2024-06-01 05:01:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 47 ms returned sat
[2024-06-01 05:01:59] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2024-06-01 05:02:01] [INFO ] State equation strengthened by 9690 read => feed constraints.
[2024-06-01 05:02:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2385 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1105) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2385/2385 places, 11933/11933 transitions.
Graph (complete) has 16554 edges and 2385 vertex of which 2367 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.26 ms
Discarding 18 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 4 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 2366 transition count 11818
Discarding 1106 places :
Symmetric choice reduction at 1 with 1106 rule applications. Total rules 1219 place count 1260 transition count 2411
Iterating global reduction 1 with 1106 rules applied. Total rules applied 2325 place count 1260 transition count 2411
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2397 place count 1260 transition count 2339
Discarding 942 places :
Symmetric choice reduction at 2 with 942 rule applications. Total rules 3339 place count 318 transition count 1397
Iterating global reduction 2 with 942 rules applied. Total rules applied 4281 place count 318 transition count 1397
Ensure Unique test removed 896 transitions
Reduce isomorphic transitions removed 896 transitions.
Iterating post reduction 2 with 896 rules applied. Total rules applied 5177 place count 318 transition count 501
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 5306 place count 189 transition count 372
Iterating global reduction 3 with 129 rules applied. Total rules applied 5435 place count 189 transition count 372
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5533 place count 189 transition count 274
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 5543 place count 179 transition count 228
Iterating global reduction 4 with 10 rules applied. Total rules applied 5553 place count 179 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 5555 place count 177 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 5557 place count 177 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5558 place count 177 transition count 225
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 5562 place count 173 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 5566 place count 173 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 5570 place count 173 transition count 217
Applied a total of 5570 rules in 488 ms. Remains 173 /2385 variables (removed 2212) and now considering 217/11933 (removed 11716) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 173/2385 places, 217/11933 transitions.
// Phase 1: matrix 217 rows 173 cols
[2024-06-01 05:02:01] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (212313 resets) in 1566 ms. (638 steps per ms)
BEST_FIRST walk for 1000000 steps (73542 resets) in 524 ms. (1904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:02:03] [INFO ] Invariant cache hit.
[2024-06-01 05:02:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 05:02:04] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 05:02:04] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 05:02:04] [INFO ] [Real]Added 53 Read/Feed constraints in 29 ms returned sat
[2024-06-01 05:02:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:02:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 05:02:04] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-01 05:02:04] [INFO ] [Nat]Added 53 Read/Feed constraints in 21 ms returned sat
[2024-06-01 05:02:04] [INFO ] Computed and/alt/rep : 71/190/71 causal constraints (skipped 145 transitions) in 29 ms.
[2024-06-01 05:02:04] [INFO ] Added : 17 causal constraints over 4 iterations in 152 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 217/217 transitions.
Applied a total of 0 rules in 29 ms. Remains 173 /173 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 173/173 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 217/217 transitions.
Applied a total of 0 rules in 8 ms. Remains 173 /173 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-06-01 05:02:04] [INFO ] Invariant cache hit.
[2024-06-01 05:02:04] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 05:02:04] [INFO ] Invariant cache hit.
[2024-06-01 05:02:04] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 05:02:05] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-06-01 05:02:05] [INFO ] Redundant transitions in 7 ms returned []
Running 216 sub problems to find dead transitions.
[2024-06-01 05:02:05] [INFO ] Invariant cache hit.
[2024-06-01 05:02:05] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 05:02:07] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 8 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 05:02:07] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-06-01 05:02:07] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
[2024-06-01 05:02:07] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 204 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 4 (OVERLAPS) 217/389 variables, 172/180 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 53/233 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/233 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/234 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/234 constraints. Problems are: Problem set: 36 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/234 constraints. Problems are: Problem set: 36 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 234 constraints, problems are : Problem set: 36 solved, 180 unsolved in 11875 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 173/173 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 36 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 35/172 variables, 4/4 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 4/8 constraints. Problems are: Problem set: 36 solved, 180 unsolved
[2024-06-01 05:02:18] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:02:18] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:02:18] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/11 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 217/389 variables, 172/183 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 53/236 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 45/281 constraints. Problems are: Problem set: 36 solved, 180 unsolved
[2024-06-01 05:02:20] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:02:21] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 05:02:21] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-06-01 05:02:22] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:02:22] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-01 05:02:23] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:02:23] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 7/288 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-06-01 05:02:27] [INFO ] Deduced a trap composed of 99 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/289 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/289 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 1/390 variables, 1/290 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 127/417 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-06-01 05:02:39] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-06-01 05:02:40] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 3 ms to minimize.
[2024-06-01 05:02:40] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:02:41] [INFO ] Deduced a trap composed of 111 places in 74 ms of which 1 ms to minimize.
[2024-06-01 05:02:41] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:02:43] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:02:43] [INFO ] Deduced a trap composed of 108 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 7/424 constraints. Problems are: Problem set: 46 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 424 constraints, problems are : Problem set: 46 solved, 170 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 173/173 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 172/216 constraints, Known Traps: 22/22 constraints]
After SMT, in 42359ms problems are : Problem set: 46 solved, 170 unsolved
Search for dead transitions found 46 dead transitions in 42369ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 173/173 places, 171/217 transitions.
Graph (complete) has 438 edges and 173 vertex of which 131 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 129 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 127 transition count 151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 127 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 125 transition count 149
Applied a total of 29 rules in 19 ms. Remains 125 /173 variables (removed 48) and now considering 149/171 (removed 22) transitions.
// Phase 1: matrix 149 rows 125 cols
[2024-06-01 05:02:47] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 05:02:47] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 05:02:47] [INFO ] Invariant cache hit.
[2024-06-01 05:02:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 05:02:47] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 125/173 places, 149/217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43340 ms. Remains : 125/173 places, 149/217 transitions.
[2024-06-01 05:02:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (211320 resets) in 1074 ms. (930 steps per ms)
BEST_FIRST walk for 1000001 steps (74711 resets) in 447 ms. (2232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:02:49] [INFO ] Invariant cache hit.
[2024-06-01 05:02:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:02:49] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:02:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 05:02:49] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:02:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:02:49] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:02:49] [INFO ] [Nat]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:02:49] [INFO ] Computed and/alt/rep : 41/82/41 causal constraints (skipped 107 transitions) in 26 ms.
[2024-06-01 05:02:49] [INFO ] Added : 17 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 149/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 149/149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 149/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-06-01 05:02:49] [INFO ] Invariant cache hit.
[2024-06-01 05:02:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 05:02:50] [INFO ] Invariant cache hit.
[2024-06-01 05:02:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 05:02:50] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-06-01 05:02:50] [INFO ] Redundant transitions in 3 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-01 05:02:50] [INFO ] Invariant cache hit.
[2024-06-01 05:02:50] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/273 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 05:02:52] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:02:52] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 177 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 149/273 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 39/215 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 109/325 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 325 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints]
After SMT, in 17528ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 17529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18126 ms. Remains : 125/125 places, 149/149 transitions.
RANDOM walk for 40000 steps (8433 resets) in 588 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2878 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3006 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 46881 steps, run visited all 2 properties in 265 ms. (steps per millisecond=176 )
Probabilistic random walk after 46881 steps, saw 21734 distinct states, run finished after 273 ms. (steps per millisecond=171 ) properties seen :2
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 75213 ms.
ITS solved all properties within timeout

BK_STOP 1717218188669

--------------------
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 UpperBounds -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="RingSingleMessageInMbox-PT-d1m005"
export BK_EXAMINATION="UpperBounds"
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 RingSingleMessageInMbox-PT-d1m005, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679079500061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m005.tgz
mv RingSingleMessageInMbox-PT-d1m005 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;