Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481100333.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481100333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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 DBSingleClientW-PT-d2m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678279632886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 12:47:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 12:47:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:47:14] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-08 12:47:14] [INFO ] Transformed 4763 places.
[2023-03-08 12:47:14] [INFO ] Transformed 2478 transitions.
[2023-03-08 12:47:14] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 12:47:14] [INFO ] Computed 6 place invariants in 168 ms
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
[2023-03-08 12:47:15] [INFO ] Invariant cache hit.
[2023-03-08 12:47:15] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2023-03-08 12:47:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-08 12:47:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:16] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2023-03-08 12:47:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-08 12:47:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2023-03-08 12:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:17] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2023-03-08 12:47:17] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 12:47:18] [INFO ] [Nat]Added 1588 Read/Feed constraints in 905 ms returned sat
[2023-03-08 12:47:19] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 674 ms.
[2023-03-08 12:47:20] [INFO ] Deduced a trap composed of 103 places in 639 ms of which 5 ms to minimize.
[2023-03-08 12:47:21] [INFO ] Deduced a trap composed of 186 places in 622 ms of which 1 ms to minimize.
[2023-03-08 12:47:21] [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: Stream close... 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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [9] Max seen :[0]
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1322 place count 431 transition count 877
Iterating global reduction 2 with 315 rules applied. Total rules applied 1637 place count 431 transition count 877
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 431 transition count 865
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1890 place count 190 transition count 523
Iterating global reduction 3 with 241 rules applied. Total rules applied 2131 place count 190 transition count 523
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2343 place count 190 transition count 311
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2368 place count 165 transition count 271
Iterating global reduction 4 with 25 rules applied. Total rules applied 2393 place count 165 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2399 place count 165 transition count 265
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2416 place count 148 transition count 248
Iterating global reduction 5 with 17 rules applied. Total rules applied 2433 place count 148 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2437 place count 148 transition count 244
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2451 place count 134 transition count 230
Iterating global reduction 6 with 14 rules applied. Total rules applied 2465 place count 134 transition count 230
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2478 place count 134 transition count 217
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2485 place count 127 transition count 181
Iterating global reduction 7 with 7 rules applied. Total rules applied 2492 place count 127 transition count 181
Applied a total of 2492 rules in 318 ms. Remains 127 /1183 variables (removed 1056) and now considering 181/2478 (removed 2297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 127/1183 places, 181/2478 transitions.
// Phase 1: matrix 181 rows 127 cols
[2023-03-08 12:47:22] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229931 resets, run finished after 1239 ms. (steps per millisecond=807 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95351 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 1) seen :0
[2023-03-08 12:47:23] [INFO ] Invariant cache hit.
[2023-03-08 12:47:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:24] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 12:47:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:47:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 12:47:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 12:47:24] [INFO ] [Nat]Added 59 Read/Feed constraints in 12 ms returned sat
[2023-03-08 12:47:24] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 130 transitions) in 18 ms.
[2023-03-08 12:47:24] [INFO ] Added : 21 causal constraints over 6 iterations in 132 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 15 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/127 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 15 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 12:47:24] [INFO ] Invariant cache hit.
[2023-03-08 12:47:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 12:47:24] [INFO ] Invariant cache hit.
[2023-03-08 12:47:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 12:47:24] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-08 12:47:24] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 12:47:24] [INFO ] Invariant cache hit.
[2023-03-08 12:47:24] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 127/127 places, 181/181 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-07
[2023-03-08 12:47:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 12:47:24] [INFO ] Invariant cache hit.
[2023-03-08 12:47:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:24] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 12:47:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:47:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:25] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 12:47:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 12:47:25] [INFO ] [Nat]Added 59 Read/Feed constraints in 11 ms returned sat
[2023-03-08 12:47:25] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 130 transitions) in 14 ms.
[2023-03-08 12:47:25] [INFO ] Added : 21 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 181/181 transitions.
[2023-03-08 12:47:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229887 resets, run finished after 1193 ms. (steps per millisecond=838 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95919 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 1) seen :0
[2023-03-08 12:47:26] [INFO ] Invariant cache hit.
[2023-03-08 12:47:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:27] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 12:47:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:47:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:47:27] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-08 12:47:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 12:47:27] [INFO ] [Nat]Added 59 Read/Feed constraints in 11 ms returned sat
[2023-03-08 12:47:27] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 130 transitions) in 15 ms.
[2023-03-08 12:47:27] [INFO ] Added : 21 causal constraints over 6 iterations in 101 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 12:47:27] [INFO ] Invariant cache hit.
[2023-03-08 12:47:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 12:47:27] [INFO ] Invariant cache hit.
[2023-03-08 12:47:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 12:47:27] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-08 12:47:27] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 12:47:27] [INFO ] Invariant cache hit.
[2023-03-08 12:47:27] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 127/127 places, 181/181 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-07 in 2904 ms.
[2023-03-08 12:47:27] [INFO ] Flatten gal took : 42 ms
[2023-03-08 12:47:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 12:47:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 181 transitions and 715 arcs took 2 ms.
Total runtime 13656 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/524/ub_0_
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678279701023

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DBSingleClientW-PT-d2m09-UpperBounds-07
ub formula formula --maxsum=/tmp/524/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 127 places, 181 transitions and 715 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m09 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 181->172 groups
pnml2lts-sym: Regrouping took 0.040 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 127; there are 172 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 8100849 group checks and 0 next state calls
pnml2lts-sym: reachability took 51.930 real 207.090 user 0.420 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.050 user 0.000 sys
pnml2lts-sym: state space has 237647721 states, 129667 nodes
pnml2lts-sym: Maximum sum of /tmp/524/ub_0_ is: 1
pnml2lts-sym: group_next: 3188 nodes total
pnml2lts-sym: group_explored: 4114 nodes, 5001 short vectors total
pnml2lts-sym: max token count: 9

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="DBSingleClientW-PT-d2m09"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d2m09, 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 r105-tall-167814481100333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m09.tgz
mv DBSingleClientW-PT-d2m09 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 ;