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.r103-tall-167814479101085.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 lolaxred
Input is DatabaseWithMutex-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479101085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 385K Feb 25 13:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 13:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 259K Feb 25 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 129K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 389K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 827K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 538K Feb 25 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 635K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 39K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.7M 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 DatabaseWithMutex-PT-20-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678316767764

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 23:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 23:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 23:06:09] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-08 23:06:09] [INFO ] Transformed 3260 places.
[2023-03-08 23:06:09] [INFO ] Transformed 3200 transitions.
[2023-03-08 23:06:09] [INFO ] Parsed PT model containing 3260 places and 3200 transitions and 23200 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 44 ms.
// Phase 1: matrix 3200 rows 3260 cols
[2023-03-08 23:06:10] [INFO ] Computed 460 place invariants in 261 ms
FORMULA DatabaseWithMutex-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 959 ms. (steps per millisecond=10 ) properties (out of 14) seen :476
FORMULA DatabaseWithMutex-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :108
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :105
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :50
[2023-03-08 23:06:11] [INFO ] Invariant cache hit.
[2023-03-08 23:06:12] [INFO ] [Real]Absence check using 78 positive place invariants in 61 ms returned sat
[2023-03-08 23:06:12] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 223 ms returned sat
[2023-03-08 23:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:13] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2023-03-08 23:06:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:14] [INFO ] [Nat]Absence check using 78 positive place invariants in 55 ms returned sat
[2023-03-08 23:06:14] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 227 ms returned sat
[2023-03-08 23:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:16] [INFO ] [Nat]Absence check using state equation in 1550 ms returned sat
[2023-03-08 23:06:16] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 207 ms.
[2023-03-08 23:06:19] [INFO ] Added : 72 causal constraints over 15 iterations in 2655 ms. Result :unknown
[2023-03-08 23:06:19] [INFO ] [Real]Absence check using 78 positive place invariants in 48 ms returned sat
[2023-03-08 23:06:19] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 232 ms returned sat
[2023-03-08 23:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:21] [INFO ] [Real]Absence check using state equation in 1474 ms returned sat
[2023-03-08 23:06:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:21] [INFO ] [Nat]Absence check using 78 positive place invariants in 44 ms returned sat
[2023-03-08 23:06:21] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 216 ms returned sat
[2023-03-08 23:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:23] [INFO ] [Nat]Absence check using state equation in 1491 ms returned sat
[2023-03-08 23:06:23] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 180 ms.
[2023-03-08 23:06:25] [INFO ] Added : 72 causal constraints over 15 iterations in 2526 ms. Result :sat
[2023-03-08 23:06:26] [INFO ] [Real]Absence check using 78 positive place invariants in 44 ms returned sat
[2023-03-08 23:06:26] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 292 ms returned sat
[2023-03-08 23:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:28] [INFO ] [Real]Absence check using state equation in 1560 ms returned sat
[2023-03-08 23:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:28] [INFO ] [Nat]Absence check using 78 positive place invariants in 46 ms returned sat
[2023-03-08 23:06:29] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 366 ms returned sat
[2023-03-08 23:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:30] [INFO ] [Nat]Absence check using state equation in 1688 ms returned sat
[2023-03-08 23:06:31] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 157 ms.
[2023-03-08 23:06:31] [INFO ] Added : 22 causal constraints over 5 iterations in 1041 ms. Result :sat
[2023-03-08 23:06:32] [INFO ] [Real]Absence check using 78 positive place invariants in 49 ms returned sat
[2023-03-08 23:06:32] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 199 ms returned sat
[2023-03-08 23:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:34] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2023-03-08 23:06:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:34] [INFO ] [Nat]Absence check using 78 positive place invariants in 58 ms returned sat
[2023-03-08 23:06:34] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 188 ms returned sat
[2023-03-08 23:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:36] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2023-03-08 23:06:36] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 142 ms.
[2023-03-08 23:06:36] [INFO ] Added : 0 causal constraints over 0 iterations in 387 ms. Result :sat
[2023-03-08 23:06:37] [INFO ] [Real]Absence check using 78 positive place invariants in 43 ms returned sat
[2023-03-08 23:06:37] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 76 ms returned unsat
[2023-03-08 23:06:37] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2023-03-08 23:06:37] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 167 ms returned unsat
[2023-03-08 23:06:37] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2023-03-08 23:06:38] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 219 ms returned sat
[2023-03-08 23:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:39] [INFO ] [Real]Absence check using state equation in 1468 ms returned sat
[2023-03-08 23:06:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:39] [INFO ] [Nat]Absence check using 78 positive place invariants in 45 ms returned sat
[2023-03-08 23:06:40] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 218 ms returned sat
[2023-03-08 23:06:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:41] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2023-03-08 23:06:41] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 147 ms.
[2023-03-08 23:06:44] [INFO ] Added : 72 causal constraints over 15 iterations in 2431 ms. Result :sat
[2023-03-08 23:06:44] [INFO ] [Real]Absence check using 78 positive place invariants in 45 ms returned unsat
[2023-03-08 23:06:45] [INFO ] [Real]Absence check using 78 positive place invariants in 41 ms returned sat
[2023-03-08 23:06:45] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 134 ms returned unsat
[2023-03-08 23:06:45] [INFO ] [Real]Absence check using 78 positive place invariants in 43 ms returned sat
[2023-03-08 23:06:45] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 182 ms returned sat
[2023-03-08 23:06:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:47] [INFO ] [Real]Absence check using state equation in 1444 ms returned sat
[2023-03-08 23:06:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:47] [INFO ] [Nat]Absence check using 78 positive place invariants in 50 ms returned sat
[2023-03-08 23:06:47] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 163 ms returned sat
[2023-03-08 23:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:49] [INFO ] [Nat]Absence check using state equation in 1504 ms returned sat
[2023-03-08 23:06:49] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 151 ms.
[2023-03-08 23:06:52] [INFO ] Added : 92 causal constraints over 19 iterations in 2984 ms. Result :unknown
[2023-03-08 23:06:52] [INFO ] [Real]Absence check using 78 positive place invariants in 50 ms returned sat
[2023-03-08 23:06:52] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 186 ms returned sat
[2023-03-08 23:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:54] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-08 23:06:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:06:54] [INFO ] [Nat]Absence check using 78 positive place invariants in 48 ms returned sat
[2023-03-08 23:06:54] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 178 ms returned sat
[2023-03-08 23:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:06:56] [INFO ] [Nat]Absence check using state equation in 1515 ms returned sat
[2023-03-08 23:06:56] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 147 ms.
[2023-03-08 23:07:02] [INFO ] Deduced a trap composed of 27 places in 3337 ms of which 9 ms to minimize.
[2023-03-08 23:07:02] [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 10
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)
[2023-03-08 23:07:03] [INFO ] [Real]Absence check using 78 positive place invariants in 43 ms returned sat
[2023-03-08 23:07:03] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 170 ms returned unsat
[2023-03-08 23:07:03] [INFO ] [Real]Absence check using 78 positive place invariants in 47 ms returned sat
[2023-03-08 23:07:03] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 32 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 20, 20, -1, 20, 1, 89, 6, 1, 1] Max seen :[89, 89, 127, 19, 20, 20, 89, 20, 1, 0, 0, 1, 1]
FORMULA DatabaseWithMutex-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1202 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 420 places and 0 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 1 with 820 rules applied. Total rules applied 1220 place count 2840 transition count 2400
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 2 with 400 rules applied. Total rules applied 1620 place count 2440 transition count 2400
Applied a total of 1620 rules in 541 ms. Remains 2440 /3260 variables (removed 820) and now considering 2400/3200 (removed 800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 2440/3260 places, 2400/3200 transitions.
// Phase 1: matrix 2400 rows 2440 cols
[2023-03-08 23:07:08] [INFO ] Computed 440 place invariants in 62 ms
Finished random walk after 375608 steps, including 1 resets, run visited all 7 properties in 30001 ms. (steps per millisecond=12 )
Interrupted Best-First random walk after 264702 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=52 ) properties seen 762
Interrupted Best-First random walk after 274361 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=54 ) properties seen 759
Interrupted Best-First random walk after 287371 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 324
Finished Best-First random walk after 606082 steps, including 1 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=121 )
Interrupted Best-First random walk after 283811 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=56 ) properties seen 819
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3934 ms. (steps per millisecond=254 ) properties (out of 7) seen :395
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3904 ms. (steps per millisecond=256 ) properties (out of 7) seen :494
[2023-03-08 23:08:11] [INFO ] Invariant cache hit.
[2023-03-08 23:08:11] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-08 23:08:11] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 458 ms returned sat
[2023-03-08 23:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:13] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2023-03-08 23:08:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:08:13] [INFO ] [Nat]Absence check using 58 positive place invariants in 34 ms returned sat
[2023-03-08 23:08:13] [INFO ] [Nat]Absence check using 58 positive and 382 generalized place invariants in 477 ms returned sat
[2023-03-08 23:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:14] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2023-03-08 23:08:15] [INFO ] Computed and/alt/rep : 1200/1200/1200 causal constraints (skipped 800 transitions) in 116 ms.
[2023-03-08 23:08:16] [INFO ] Added : 32 causal constraints over 7 iterations in 984 ms. Result :sat
Minimization took 2850 ms.
[2023-03-08 23:08:19] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-08 23:08:19] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 429 ms returned sat
[2023-03-08 23:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:20] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2023-03-08 23:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:08:21] [INFO ] [Nat]Absence check using 58 positive place invariants in 33 ms returned sat
[2023-03-08 23:08:21] [INFO ] [Nat]Absence check using 58 positive and 382 generalized place invariants in 468 ms returned sat
[2023-03-08 23:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:22] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2023-03-08 23:08:22] [INFO ] Computed and/alt/rep : 1200/1200/1200 causal constraints (skipped 800 transitions) in 120 ms.
[2023-03-08 23:08:23] [INFO ] Added : 32 causal constraints over 7 iterations in 978 ms. Result :sat
Minimization took 2780 ms.
[2023-03-08 23:08:26] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-08 23:08:27] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 651 ms returned sat
[2023-03-08 23:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:28] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2023-03-08 23:08:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:08:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 34 ms returned sat
[2023-03-08 23:08:29] [INFO ] [Nat]Absence check using 58 positive and 382 generalized place invariants in 671 ms returned sat
[2023-03-08 23:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:30] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2023-03-08 23:08:31] [INFO ] Computed and/alt/rep : 1200/1200/1200 causal constraints (skipped 800 transitions) in 130 ms.
[2023-03-08 23:08:31] [INFO ] Added : 29 causal constraints over 6 iterations in 930 ms. Result :sat
Minimization took 3021 ms.
[2023-03-08 23:08:35] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-08 23:08:35] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 92 ms returned unsat
[2023-03-08 23:08:35] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-08 23:08:35] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 431 ms returned sat
[2023-03-08 23:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:37] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2023-03-08 23:08:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:08:37] [INFO ] [Nat]Absence check using 58 positive place invariants in 44 ms returned sat
[2023-03-08 23:08:37] [INFO ] [Nat]Absence check using 58 positive and 382 generalized place invariants in 476 ms returned sat
[2023-03-08 23:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:08:39] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2023-03-08 23:08:39] [INFO ] Computed and/alt/rep : 1200/1200/1200 causal constraints (skipped 800 transitions) in 136 ms.
[2023-03-08 23:08:40] [INFO ] Added : 32 causal constraints over 7 iterations in 1027 ms. Result :sat
Minimization took 2872 ms.
[2023-03-08 23:08:43] [INFO ] [Real]Absence check using 58 positive place invariants in 33 ms returned sat
[2023-03-08 23:08:43] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 109 ms returned unsat
[2023-03-08 23:08:43] [INFO ] [Real]Absence check using 58 positive place invariants in 43 ms returned sat
[2023-03-08 23:08:43] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 75 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 20, -1, 1, 1] Max seen :[266, 266, 247, 20, 266, 1, 1]
FORMULA DatabaseWithMutex-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 800 out of 2440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2440/2440 places, 2400/2400 transitions.
Free-agglomeration rule applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2440 transition count 2000
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 800 place count 2040 transition count 2000
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 1200 place count 2040 transition count 1600
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 1600 place count 1640 transition count 1600
Applied a total of 1600 rules in 456 ms. Remains 1640 /2440 variables (removed 800) and now considering 1600/2400 (removed 800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 1640/2440 places, 1600/2400 transitions.
// Phase 1: matrix 1600 rows 1640 cols
[2023-03-08 23:08:46] [INFO ] Computed 440 place invariants in 34 ms
Finished random walk after 357355 steps, including 1 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=11 )
Finished Best-First random walk after 235110 steps, including 0 resets, run visited all 4 properties in 5003 ms. (steps per millisecond=46 )
Finished Best-First random walk after 236788 steps, including 0 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=47 )
Finished Best-First random walk after 258700 steps, including 0 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=51 )
Finished Best-First random walk after 235511 steps, including 0 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=47 )
[2023-03-08 23:09:36] [INFO ] Invariant cache hit.
[2023-03-08 23:09:36] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-08 23:09:36] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 288 ms returned unsat
[2023-03-08 23:09:36] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-08 23:09:37] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 281 ms returned unsat
[2023-03-08 23:09:37] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-08 23:09:37] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 232 ms returned unsat
[2023-03-08 23:09:37] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-08 23:09:37] [INFO ] [Real]Absence check using 58 positive and 382 generalized place invariants in 279 ms returned unsat
Current structural bounds on expressions (after SMT) : [380, 380, 380, 380] Max seen :[380, 380, 380, 380]
FORMULA DatabaseWithMutex-PT-20-UpperBounds-06 380 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-02 380 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-01 380 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-UpperBounds-00 380 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 208676 ms.
ITS solved all properties within timeout

BK_STOP 1678316978868

--------------------
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

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="DatabaseWithMutex-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DatabaseWithMutex-PT-20, 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 r103-tall-167814479101085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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