fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420400509
Last Updated
May 14, 2023

About the Execution of Marcie+red for LeafsetExtension-PT-S32C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
480.695 16534.00 25287.00 252.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r234-tall-167856420400509.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 marciexred
Input is LeafsetExtension-PT-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.1K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 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 3.4M 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 LeafsetExtension-PT-S32C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679520012048

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 21:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:20:13] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2023-03-22 21:20:13] [INFO ] Transformed 5622 places.
[2023-03-22 21:20:13] [INFO ] Transformed 5449 transitions.
[2023-03-22 21:20:13] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-22 21:20:14] [INFO ] Computed 173 place invariants in 368 ms
Incomplete random walk after 10000 steps, including 386 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 16) seen :12
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 21:20:14] [INFO ] Invariant cache hit.
[2023-03-22 21:20:15] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2023-03-22 21:20:15] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 133 ms returned sat
[2023-03-22 21:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:20:18] [INFO ] [Real]Absence check using state equation in 3270 ms returned sat
[2023-03-22 21:20:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:20:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 64 ms returned sat
[2023-03-22 21:20:19] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 143 ms returned sat
[2023-03-22 21:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:20:23] [INFO ] [Nat]Absence check using state equation in 3483 ms returned sat
[2023-03-22 21:20:23] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 324 ms.
[2023-03-22 21:20:24] [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.refineWithCausalOrder(DeadlockTester.java:1186)
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-22 21:20:24] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2023-03-22 21:20:24] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 174 ms returned unsat
[2023-03-22 21:20:25] [INFO ] [Real]Absence check using 35 positive place invariants in 112 ms returned sat
[2023-03-22 21:20:25] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 99 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 1, 1]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 89 are kept as prefixes of interest. Removing 5533 places using SCC suffix rule.14 ms
Discarding 5533 places :
Also discarding 4036 output transitions
Drop transitions removed 4036 transitions
Drop transitions removed 1105 transitions
Reduce isomorphic transitions removed 1105 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 1137 rules applied. Total rules applied 1138 place count 73 transition count 292
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 35 rules applied. Total rules applied 1173 place count 55 transition count 275
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1190 place count 38 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1190 place count 38 transition count 274
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1192 place count 37 transition count 274
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1208 place count 37 transition count 258
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1224 place count 21 transition count 258
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 1239 place count 21 transition count 258
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1240 place count 20 transition count 258
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1241 place count 20 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1242 place count 19 transition count 257
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 1257 place count 19 transition count 242
Applied a total of 1257 rules in 98 ms. Remains 19 /5622 variables (removed 5603) and now considering 242/5449 (removed 5207) transitions.
[2023-03-22 21:20:25] [INFO ] Flow matrix only has 32 transitions (discarded 210 similar events)
// Phase 1: matrix 32 rows 19 cols
[2023-03-22 21:20:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 21:20:25] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 19/5622 places, 242/5449 transitions.
Successfully produced net in file /tmp/petri1000_12381228842289753775.dot
Successfully produced net in file /tmp/petri1001_15513296422826343843.dot
Successfully produced net in file /tmp/petri1002_8545905569163387108.dot
Successfully produced net in file /tmp/petri1003_3295710037387510976.dot
Successfully produced net in file /tmp/petri1004_220930035898376665.dot
Successfully produced net in file /tmp/petri1005_5369088217193720482.dot
Successfully produced net in file /tmp/petri1006_11857560713872554891.dot
Successfully produced net in file /tmp/petri1007_2097253742567384222.dot
Successfully produced net in file /tmp/petri1008_15227810559693137962.dot
Successfully produced net in file /tmp/petri1009_2010302381474204765.dot
Successfully produced net in file /tmp/petri1010_16612643032391359491.dot
Successfully produced net in file /tmp/petri1011_5679433571252636183.dot
Successfully produced net in file /tmp/petri1012_3323347444023888059.dot
Successfully produced net in file /tmp/petri1013_5307417798215424552.dot
Successfully produced net in file /tmp/petri1014_6424724509450255161.dot
Successfully produced net in file /tmp/petri1015_12972267645609100061.dot
Successfully produced net in file /tmp/petri1016_14653879359423273084.dot
Successfully produced net in file /tmp/petri1017_6878746113788611837.dot
Successfully produced net in file /tmp/petri1018_14167426111573951647.dot
Successfully produced net in file /tmp/petri1019_2102052022868975569.dot
Successfully produced net in file /tmp/petri1020_10545426035085272509.dot
Successfully produced net in file /tmp/petri1021_9212244717577115442.dot
Successfully produced net in file /tmp/petri1022_2984087083983636257.dot
Successfully produced net in file /tmp/petri1023_18337025267638151423.dot
Successfully produced net in file /tmp/petri1024_4941313195104973058.dot
Successfully produced net in file /tmp/petri1025_4499876694932142005.dot
Successfully produced net in file /tmp/petri1026_13935749991299649862.dot
Successfully produced net in file /tmp/petri1027_10003131307814630731.dot
Successfully produced net in file /tmp/petri1028_17229205648399195758.dot
Successfully produced net in file /tmp/petri1029_6843182140576891509.dot
Successfully produced net in file /tmp/petri1030_8410692329247013678.dot
Successfully produced net in file /tmp/petri1031_1114563345202065898.dot
Successfully produced net in file /tmp/petri1032_16724724589152473980.dot
Successfully produced net in file /tmp/petri1033_13578695105110475648.dot
Successfully produced net in file /tmp/petri1034_13674338240789608770.dot
Successfully produced net in file /tmp/petri1035_13213318345694493936.dot
Successfully produced net in file /tmp/petri1036_12768760460408749742.dot
Successfully produced net in file /tmp/petri1037_3071454662383250873.dot
Successfully produced net in file /tmp/petri1038_16823092830607297687.dot
Successfully produced net in file /tmp/petri1039_8113645434604829757.dot
Successfully produced net in file /tmp/petri1040_327553927527431299.dot
Successfully produced net in file /tmp/petri1041_14659604302081891622.dot
Successfully produced net in file /tmp/petri1042_14038897235648027902.dot
Successfully produced net in file /tmp/petri1043_15592026195889196089.dot
Successfully produced net in file /tmp/petri1044_15332194143652758683.dot
Successfully produced net in file /tmp/petri1045_16995550410469485848.dot
Successfully produced net in file /tmp/petri1046_2492043276315723650.dot
Successfully produced net in file /tmp/petri1047_14666338523392701396.dot
Successfully produced net in file /tmp/petri1048_14509898976938077447.dot
Successfully produced net in file /tmp/petri1049_3683858660632531161.dot
Successfully produced net in file /tmp/petri1050_12694872724488048938.dot
Successfully produced net in file /tmp/petri1051_2784354433046727338.dot
Successfully produced net in file /tmp/petri1052_4427619189822031210.dot
Successfully produced net in file /tmp/petri1053_3347740257151455593.dot
Successfully produced net in file /tmp/petri1054_6651719985710402313.dot
Successfully produced net in file /tmp/petri1055_10578122504967219012.dot
Successfully produced net in file /tmp/petri1056_13224216141792171365.dot
Successfully produced net in file /tmp/petri1057_2275477977810861553.dot
Successfully produced net in file /tmp/petri1058_5028136381459103042.dot
Successfully produced net in file /tmp/petri1059_17526643668623278848.dot
Successfully produced net in file /tmp/petri1060_9943921869719926489.dot
Successfully produced net in file /tmp/petri1061_8499042801130340129.dot
Successfully produced net in file /tmp/petri1062_2910699925909564956.dot
Successfully produced net in file /tmp/petri1063_3073220183250734842.dot
Successfully produced net in file /tmp/petri1064_291733795408288446.dot
Successfully produced net in file /tmp/petri1065_112239287679154628.dot
Successfully produced net in file /tmp/petri1066_9579448015956994936.dot
Successfully produced net in file /tmp/petri1067_5838392614361729267.dot
Successfully produced net in file /tmp/petri1068_16349921811009930393.dot
Successfully produced net in file /tmp/petri1069_17810936986383540395.dot
Successfully produced net in file /tmp/petri1070_13994264865937211763.dot
Successfully produced net in file /tmp/petri1071_3215993785791816243.dot
Successfully produced net in file /tmp/petri1072_11522172299025120488.dot
Successfully produced net in file /tmp/petri1073_4577388076535787058.dot
Successfully produced net in file /tmp/petri1074_10546450312528360448.dot
Successfully produced net in file /tmp/petri1075_14293865925339993744.dot
Successfully produced net in file /tmp/petri1076_16851526097788092032.dot
Successfully produced net in file /tmp/petri1077_3131130276972879659.dot
Successfully produced net in file /tmp/petri1078_6111190566109244614.dot
Successfully produced net in file /tmp/petri1079_6468475742690444773.dot
Successfully produced net in file /tmp/petri1080_4447697804541917679.dot
Successfully produced net in file /tmp/petri1081_4520046181012938881.dot
Successfully produced net in file /tmp/petri1082_6972649381585481224.dot
Successfully produced net in file /tmp/petri1083_18383667306781905815.dot
Successfully produced net in file /tmp/petri1084_5182644083608384245.dot
Successfully produced net in file /tmp/petri1085_6672525722510276809.dot
Successfully produced net in file /tmp/petri1086_12858879831844844263.dot
Successfully produced net in file /tmp/petri1087_10035511291245261061.dot
Successfully produced net in file /tmp/petri1088_14787650213280377356.dot
Successfully produced net in file /tmp/petri1089_16606512870253913719.dot
Successfully produced net in file /tmp/petri1090_14344509648321604315.dot
Successfully produced net in file /tmp/petri1091_16300235613553713152.dot
Successfully produced net in file /tmp/petri1092_8156601200829091212.dot
Successfully produced net in file /tmp/petri1093_3018141331068774683.dot
Successfully produced net in file /tmp/petri1094_17604967486031069238.dot
Successfully produced net in file /tmp/petri1095_15158317307062844938.dot
Successfully produced net in file /tmp/petri1096_1350450549838696964.dot
Successfully produced net in file /tmp/petri1097_7364136589168700383.dot
Successfully produced net in file /tmp/petri1098_8254823539125957554.dot
Successfully produced net in file /tmp/petri1099_5380354754893340807.dot
Successfully produced net in file /tmp/petri1100_3927408101771256565.dot
Successfully produced net in file /tmp/petri1101_11811493853814728857.dot
Successfully produced net in file /tmp/petri1102_7485015614293069138.dot
Successfully produced net in file /tmp/petri1103_18419747619902239598.dot
Successfully produced net in file /tmp/petri1104_8950733324619506758.dot
Successfully produced net in file /tmp/petri1105_80197656059804262.dot
Successfully produced net in file /tmp/petri1106_13668089226865101523.dot
Successfully produced net in file /tmp/petri1107_2078174672176938249.dot
Successfully produced net in file /tmp/petri1108_5739473553508868302.dot
Successfully produced net in file /tmp/petri1109_6746770579414807035.dot
Successfully produced net in file /tmp/petri1110_9778558026367584613.dot
Successfully produced net in file /tmp/petri1111_9970422127125109202.dot
Successfully produced net in file /tmp/petri1112_1373528332582852345.dot
Successfully produced net in file /tmp/petri1113_1644239568081115171.dot
Successfully produced net in file /tmp/petri1114_10781865296724461581.dot
Successfully produced net in file /tmp/petri1115_11982185774239571632.dot
Successfully produced net in file /tmp/petri1116_3630335756624846992.dot
Successfully produced net in file /tmp/petri1117_11155905613727147142.dot
Successfully produced net in file /tmp/petri1118_724142604627035413.dot
Successfully produced net in file /tmp/petri1119_8381032006281369576.dot
Drop transitions removed 120 transitions
Dominated transitions for bounds rules discarded 120 transitions
Normalized transition count is 17 out of 122 initially.
// Phase 1: matrix 17 rows 19 cols
[2023-03-22 21:20:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 238813 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 1) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14082 ms.
ITS solved all properties within timeout

BK_STOP 1679520028582

--------------------
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="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is LeafsetExtension-PT-S32C3, 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 r234-tall-167856420400509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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