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.r229-tall-167856413400517.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 itstools
Input is LeafsetExtension-PT-S32C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413400517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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-S32C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679498031648

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C4
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 15:13:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 15:13:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:13:53] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-22 15:13:53] [INFO ] Transformed 5622 places.
[2023-03-22 15:13:53] [INFO ] Transformed 5449 transitions.
[2023-03-22 15:13:53] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-22 15:13:54] [INFO ] Computed 173 place invariants in 396 ms
Incomplete random walk after 10000 steps, including 299 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :12
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :1
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
[2023-03-22 15:13:54] [INFO ] Invariant cache hit.
[2023-03-22 15:13:55] [INFO ] [Real]Absence check using 35 positive place invariants in 211 ms returned sat
[2023-03-22 15:13:55] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 146 ms returned sat
[2023-03-22 15:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:13:58] [INFO ] [Real]Absence check using state equation in 3296 ms returned sat
[2023-03-22 15:13:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:13:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 64 ms returned sat
[2023-03-22 15:13:59] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 146 ms returned sat
[2023-03-22 15:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:14:03] [INFO ] [Nat]Absence check using state equation in 3301 ms returned sat
[2023-03-22 15:14:03] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 265 ms.
[2023-03-22 15:14:04] [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 15:14:04] [INFO ] [Real]Absence check using 35 positive place invariants in 76 ms returned sat
[2023-03-22 15:14:04] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 152 ms returned unsat
[2023-03-22 15:14:05] [INFO ] [Real]Absence check using 35 positive place invariants in 66 ms returned sat
[2023-03-22 15:14:05] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 145 ms returned sat
[2023-03-22 15:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:14:08] [INFO ] [Real]Absence check using state equation in 3329 ms returned sat
[2023-03-22 15:14:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:14:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 67 ms returned sat
[2023-03-22 15:14:09] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 141 ms returned sat
[2023-03-22 15:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:14:13] [INFO ] [Nat]Absence check using state equation in 3279 ms returned sat
[2023-03-22 15:14:13] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 264 ms.
[2023-03-22 15:14:21] [INFO ] Deduced a trap composed of 2 places in 7083 ms of which 23 ms to minimize.
[2023-03-22 15:14: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 2
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-22 15:14:21] [INFO ] [Real]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-22 15:14:21] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 150 ms returned sat
[2023-03-22 15:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:14:25] [INFO ] [Real]Absence check using state equation in 3237 ms returned sat
[2023-03-22 15:14:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:14:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 56 ms returned sat
[2023-03-22 15:14:26] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2023-03-22 15:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:14:29] [INFO ] [Nat]Absence check using state equation in 3449 ms returned sat
[2023-03-22 15:14:29] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 244 ms.
[2023-03-22 15:14:30] [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 3
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)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1] Max seen :[2, 1, 0, 0]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 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 224 are kept as prefixes of interest. Removing 5398 places using SCC suffix rule.12 ms
Discarding 5398 places :
Also discarding 3168 output transitions
Drop transitions removed 3168 transitions
Drop transitions removed 1136 transitions
Reduce isomorphic transitions removed 1136 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 208 transition count 1098
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 1251 place count 159 transition count 1096
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1253 place count 157 transition count 1096
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1253 place count 157 transition count 1092
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1261 place count 153 transition count 1092
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1276 place count 138 transition count 1077
Iterating global reduction 3 with 15 rules applied. Total rules applied 1291 place count 138 transition count 1077
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1306 place count 123 transition count 1062
Iterating global reduction 3 with 15 rules applied. Total rules applied 1321 place count 123 transition count 1062
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1322 place count 122 transition count 1062
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1322 place count 122 transition count 1061
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1324 place count 121 transition count 1061
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 1341 place count 121 transition count 1044
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1358 place count 104 transition count 1044
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 1388 place count 104 transition count 1044
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 1390 place count 102 transition count 1044
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1391 place count 102 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1392 place count 101 transition count 1043
Applied a total of 1392 rules in 198 ms. Remains 101 /5622 variables (removed 5521) and now considering 1043/5449 (removed 4406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 101/5622 places, 1043/5449 transitions.
Successfully produced net in file /tmp/petri1000_5769829150246688299.dot
Successfully produced net in file /tmp/petri1001_16057550879944869839.dot
Successfully produced net in file /tmp/petri1002_15833925168498871081.dot
Successfully produced net in file /tmp/petri1003_11620095260872635640.dot
Successfully produced net in file /tmp/petri1004_4785026464789537384.dot
Successfully produced net in file /tmp/petri1005_6975643417720588948.dot
Successfully produced net in file /tmp/petri1006_2408033084692219360.dot
Successfully produced net in file /tmp/petri1007_18044350504315308677.dot
Successfully produced net in file /tmp/petri1008_5072080529444154465.dot
Successfully produced net in file /tmp/petri1009_13781297843507926926.dot
Successfully produced net in file /tmp/petri1010_1853252598527423612.dot
Successfully produced net in file /tmp/petri1011_1047296272675964402.dot
Successfully produced net in file /tmp/petri1012_16481063895534912959.dot
Successfully produced net in file /tmp/petri1013_17528465252624499168.dot
Successfully produced net in file /tmp/petri1014_3197984209936312520.dot
Successfully produced net in file /tmp/petri1015_9298763367841491409.dot
Successfully produced net in file /tmp/petri1016_13116501948056292260.dot
Successfully produced net in file /tmp/petri1017_16740557935721422820.dot
Successfully produced net in file /tmp/petri1018_3204978969160536929.dot
Successfully produced net in file /tmp/petri1019_14062059679747033231.dot
Successfully produced net in file /tmp/petri1020_17202476423535963175.dot
Successfully produced net in file /tmp/petri1021_6120983388633325458.dot
Successfully produced net in file /tmp/petri1022_14672005434417186581.dot
Successfully produced net in file /tmp/petri1023_5314876757617982580.dot
Successfully produced net in file /tmp/petri1024_13018912837318597085.dot
Successfully produced net in file /tmp/petri1025_16834041769837153420.dot
Successfully produced net in file /tmp/petri1026_18141762347376026546.dot
Successfully produced net in file /tmp/petri1027_2022135798919492292.dot
Successfully produced net in file /tmp/petri1028_6353876428699847306.dot
Successfully produced net in file /tmp/petri1029_7059216240523225732.dot
Successfully produced net in file /tmp/petri1030_5449395568924243943.dot
Successfully produced net in file /tmp/petri1031_1207327727774203601.dot
Successfully produced net in file /tmp/petri1032_12482122322622317959.dot
Successfully produced net in file /tmp/petri1033_9914273085113735528.dot
Successfully produced net in file /tmp/petri1034_8914466231412349482.dot
Successfully produced net in file /tmp/petri1035_10849718980686723894.dot
Successfully produced net in file /tmp/petri1036_1436749351547491540.dot
Successfully produced net in file /tmp/petri1037_11234365658790360907.dot
Successfully produced net in file /tmp/petri1038_17329735830796665473.dot
Successfully produced net in file /tmp/petri1039_2414320848661114709.dot
Successfully produced net in file /tmp/petri1040_9919475074852894759.dot
Successfully produced net in file /tmp/petri1041_4782633710731346616.dot
Successfully produced net in file /tmp/petri1042_75248787586181779.dot
Successfully produced net in file /tmp/petri1043_16144984285069849772.dot
Successfully produced net in file /tmp/petri1044_1385694724674820887.dot
Successfully produced net in file /tmp/petri1045_8179091142775278527.dot
Successfully produced net in file /tmp/petri1046_4884114836425247314.dot
Successfully produced net in file /tmp/petri1047_8614493534556237592.dot
Successfully produced net in file /tmp/petri1048_613611441865166702.dot
Successfully produced net in file /tmp/petri1049_12568276473758082488.dot
Successfully produced net in file /tmp/petri1050_16182574567195175301.dot
Successfully produced net in file /tmp/petri1051_4374994880786206263.dot
Successfully produced net in file /tmp/petri1052_9244489475986013744.dot
Successfully produced net in file /tmp/petri1053_17301411572973531155.dot
Successfully produced net in file /tmp/petri1054_14468849022853264757.dot
Successfully produced net in file /tmp/petri1055_18098344908619193987.dot
Successfully produced net in file /tmp/petri1056_10825814032932151694.dot
Successfully produced net in file /tmp/petri1057_1160696952044151015.dot
Successfully produced net in file /tmp/petri1058_5991651216548100404.dot
Successfully produced net in file /tmp/petri1059_8409431312801060401.dot
Successfully produced net in file /tmp/petri1060_1694286931385519116.dot
Successfully produced net in file /tmp/petri1061_6103079059105717048.dot
Successfully produced net in file /tmp/petri1062_7231206739409644835.dot
Successfully produced net in file /tmp/petri1063_12420937879260972775.dot
Successfully produced net in file /tmp/petri1064_12757575696206206023.dot
Successfully produced net in file /tmp/petri1065_8053288296486244218.dot
Successfully produced net in file /tmp/petri1066_16150388428422443234.dot
Successfully produced net in file /tmp/petri1067_9065199786584928425.dot
Successfully produced net in file /tmp/petri1068_12445363782862698692.dot
Successfully produced net in file /tmp/petri1069_6132828399940111656.dot
Successfully produced net in file /tmp/petri1070_9573760782291796870.dot
Successfully produced net in file /tmp/petri1071_14717081293128248753.dot
Successfully produced net in file /tmp/petri1072_682906221734920881.dot
Successfully produced net in file /tmp/petri1073_5706285765858759014.dot
Successfully produced net in file /tmp/petri1074_9626795863672049034.dot
Successfully produced net in file /tmp/petri1075_16849893107085933920.dot
Successfully produced net in file /tmp/petri1076_3622795591339797379.dot
Successfully produced net in file /tmp/petri1077_9729162594806647531.dot
Successfully produced net in file /tmp/petri1078_18218585406473111257.dot
Successfully produced net in file /tmp/petri1079_7467192521416989831.dot
Successfully produced net in file /tmp/petri1080_6887938984271747207.dot
Successfully produced net in file /tmp/petri1081_4099158716300912865.dot
Successfully produced net in file /tmp/petri1082_5408395654125609536.dot
Successfully produced net in file /tmp/petri1083_15022211132506520488.dot
Successfully produced net in file /tmp/petri1084_8418549768255821133.dot
Successfully produced net in file /tmp/petri1085_4441659376125602021.dot
Successfully produced net in file /tmp/petri1086_74555707425955029.dot
Successfully produced net in file /tmp/petri1087_154930772793185797.dot
Successfully produced net in file /tmp/petri1088_17875811880966292937.dot
Successfully produced net in file /tmp/petri1089_7409437091760337160.dot
Successfully produced net in file /tmp/petri1090_9093180474053292667.dot
Successfully produced net in file /tmp/petri1091_17793065041353984628.dot
Successfully produced net in file /tmp/petri1092_4662235053903721705.dot
Successfully produced net in file /tmp/petri1093_18084323769721390016.dot
Successfully produced net in file /tmp/petri1094_14444031708787422511.dot
Successfully produced net in file /tmp/petri1095_12247530795312360727.dot
Successfully produced net in file /tmp/petri1096_13779282048489245184.dot
Successfully produced net in file /tmp/petri1097_1992633649647274089.dot
Successfully produced net in file /tmp/petri1098_4872498634436391531.dot
Successfully produced net in file /tmp/petri1099_9589881863257364271.dot
Successfully produced net in file /tmp/petri1100_15387978351972754240.dot
Successfully produced net in file /tmp/petri1101_8391174350441650499.dot
Successfully produced net in file /tmp/petri1102_8840612025170047187.dot
Successfully produced net in file /tmp/petri1103_7396992990185527253.dot
Successfully produced net in file /tmp/petri1104_3525371818074680554.dot
Successfully produced net in file /tmp/petri1105_14742255886314382503.dot
Successfully produced net in file /tmp/petri1106_8612970476860732501.dot
Successfully produced net in file /tmp/petri1107_3663447844466537186.dot
Successfully produced net in file /tmp/petri1108_9051313363303929045.dot
Successfully produced net in file /tmp/petri1109_11796339913118385035.dot
Successfully produced net in file /tmp/petri1110_7669678324805628972.dot
Successfully produced net in file /tmp/petri1111_12268618344719836814.dot
Successfully produced net in file /tmp/petri1112_10375327264560649433.dot
Successfully produced net in file /tmp/petri1113_6410974991128718375.dot
Successfully produced net in file /tmp/petri1114_6441177854470816145.dot
Successfully produced net in file /tmp/petri1115_10513122720469576022.dot
Successfully produced net in file /tmp/petri1116_544917922289651479.dot
Successfully produced net in file /tmp/petri1117_14413735285622006214.dot
Successfully produced net in file /tmp/petri1118_17654143452653717995.dot
Successfully produced net in file /tmp/petri1119_10884444571625631874.dot
Successfully produced net in file /tmp/petri1120_7244000742007732528.dot
Successfully produced net in file /tmp/petri1121_3338923677213708782.dot
Successfully produced net in file /tmp/petri1122_10572677039676629696.dot
Successfully produced net in file /tmp/petri1123_8118008041244400581.dot
Successfully produced net in file /tmp/petri1124_6929157806037086839.dot
Successfully produced net in file /tmp/petri1125_2262893916664198468.dot
Successfully produced net in file /tmp/petri1126_17660838628540824343.dot
Successfully produced net in file /tmp/petri1127_61289880270321259.dot
Successfully produced net in file /tmp/petri1128_13856582670841982223.dot
Successfully produced net in file /tmp/petri1129_7265047768787832896.dot
Successfully produced net in file /tmp/petri1130_1737421920822138858.dot
Successfully produced net in file /tmp/petri1131_5567362909858418487.dot
Successfully produced net in file /tmp/petri1132_11663258160270799170.dot
Successfully produced net in file /tmp/petri1133_14328395873989390242.dot
Successfully produced net in file /tmp/petri1134_11738117967877838240.dot
Successfully produced net in file /tmp/petri1135_10401553225239823900.dot
Successfully produced net in file /tmp/petri1136_9999131705719933220.dot
Successfully produced net in file /tmp/petri1137_10384405672179061105.dot
Successfully produced net in file /tmp/petri1138_6853869353814049251.dot
Successfully produced net in file /tmp/petri1139_7628707301332106804.dot
Successfully produced net in file /tmp/petri1140_13858830555820614689.dot
Successfully produced net in file /tmp/petri1141_12961380140630944491.dot
Successfully produced net in file /tmp/petri1142_17692127635841424314.dot
Successfully produced net in file /tmp/petri1143_8024316460514824281.dot
Successfully produced net in file /tmp/petri1144_6669848939934567048.dot
Successfully produced net in file /tmp/petri1145_9645747544712589346.dot
Successfully produced net in file /tmp/petri1146_11543929997092035752.dot
Successfully produced net in file /tmp/petri1147_4103298163829233530.dot
Successfully produced net in file /tmp/petri1148_5972431882924206632.dot
Successfully produced net in file /tmp/petri1149_9012881344962757308.dot
Drop transitions removed 150 transitions
Dominated transitions for bounds rules discarded 150 transitions
Normalized transition count is 101 out of 893 initially.
// Phase 1: matrix 101 rows 101 cols
[2023-03-22 15:14:30] [INFO ] Computed 16 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 102374 resets, run finished after 3382 ms. (steps per millisecond=295 ) properties (out of 3) seen :6
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3938 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties (out of 1) seen :4
[2023-03-22 15:14:35] [INFO ] Flow matrix only has 101 transitions (discarded 792 similar events)
// Phase 1: matrix 101 rows 101 cols
[2023-03-22 15:14:35] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-22 15:14:35] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 15:14:35] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 15:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:14:35] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 41780 ms.

BK_STOP 1679498076314

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S32C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LeafsetExtension-PT-S32C4, 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 r229-tall-167856413400517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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