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-167856413300509.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-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413300509
=====================================================================

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

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-S32C3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 14:56:57] [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 14:56:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:56:57] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-22 14:56:57] [INFO ] Transformed 5622 places.
[2023-03-22 14:56:57] [INFO ] Transformed 5449 transitions.
[2023-03-22 14:56:57] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-22 14:56:57] [INFO ] Computed 173 place invariants in 329 ms
Incomplete random walk after 10000 steps, including 382 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :9
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-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :2
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 14:56:58] [INFO ] Invariant cache hit.
[2023-03-22 14:56:59] [INFO ] [Real]Absence check using 35 positive place invariants in 68 ms returned sat
[2023-03-22 14:56:59] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 174 ms returned sat
[2023-03-22 14:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:02] [INFO ] [Real]Absence check using state equation in 3284 ms returned sat
[2023-03-22 14:57:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:57:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 65 ms returned sat
[2023-03-22 14:57:03] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2023-03-22 14:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:07] [INFO ] [Nat]Absence check using state equation in 3291 ms returned sat
[2023-03-22 14:57:07] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 328 ms.
[2023-03-22 14:57:14] [INFO ] Deduced a trap composed of 2 places in 6597 ms of which 11 ms to minimize.
[2023-03-22 14:57:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 14:57:15] [INFO ] [Real]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-22 14:57:15] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 147 ms returned sat
[2023-03-22 14:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:18] [INFO ] [Real]Absence check using state equation in 3257 ms returned sat
[2023-03-22 14:57:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:57:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 56 ms returned sat
[2023-03-22 14:57:19] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2023-03-22 14:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:22] [INFO ] [Nat]Absence check using state equation in 3254 ms returned sat
[2023-03-22 14:57:23] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 272 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-22 14:57:30] [INFO ] Deduced a trap composed of 2 places in 6654 ms of which 7 ms to minimize.
[2023-03-22 14:57: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 1
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 14:57:31] [INFO ] [Real]Absence check using 35 positive place invariants in 77 ms returned sat
[2023-03-22 14:57:31] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 159 ms returned unsat
[2023-03-22 14:57:31] [INFO ] [Real]Absence check using 35 positive place invariants in 51 ms returned sat
[2023-03-22 14:57:31] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 81 ms returned unsat
[2023-03-22 14:57:32] [INFO ] [Real]Absence check using 35 positive place invariants in 54 ms returned sat
[2023-03-22 14:57:32] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 148 ms returned sat
[2023-03-22 14:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:35] [INFO ] [Real]Absence check using state equation in 3362 ms returned sat
[2023-03-22 14:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:57:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 56 ms returned sat
[2023-03-22 14:57:36] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2023-03-22 14:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:40] [INFO ] [Nat]Absence check using state equation in 3301 ms returned sat
[2023-03-22 14:57:40] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 308 ms.
[2023-03-22 14:57:47] [INFO ] Deduced a trap composed of 2 places in 6727 ms of which 8 ms to minimize.
[2023-03-22 14:57:47] [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 4
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 14:57:48] [INFO ] [Real]Absence check using 35 positive place invariants in 52 ms returned sat
[2023-03-22 14:57:48] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2023-03-22 14:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:51] [INFO ] [Real]Absence check using state equation in 3292 ms returned sat
[2023-03-22 14:57:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:57:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 54 ms returned sat
[2023-03-22 14:57:52] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 128 ms returned sat
[2023-03-22 14:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:57:55] [INFO ] [Nat]Absence check using state equation in 3151 ms returned sat
[2023-03-22 14:57:56] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 223 ms.
[2023-03-22 14:57:57] [INFO ] Added : 9 causal constraints over 2 iterations in 981 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 1, 1, 0, 0]
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 4 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 168 are kept as prefixes of interest. Removing 5454 places using SCC suffix rule.10 ms
Discarding 5454 places :
Also discarding 3875 output transitions
Drop transitions removed 3875 transitions
Drop transitions removed 1125 transitions
Reduce isomorphic transitions removed 1125 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 1173 rules applied. Total rules applied 1174 place count 167 transition count 402
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 56 rules applied. Total rules applied 1230 place count 116 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1233 place count 113 transition count 397
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1233 place count 113 transition count 394
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1239 place count 110 transition count 394
Free-agglomeration rule applied 49 times.
Iterating global reduction 3 with 49 rules applied. Total rules applied 1288 place count 110 transition count 345
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 1337 place count 61 transition count 345
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 1353 place count 61 transition count 329
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1355 place count 61 transition count 327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1357 place count 59 transition count 327
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 5 with 45 rules applied. Total rules applied 1402 place count 59 transition count 327
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 1405 place count 56 transition count 327
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1407 place count 56 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1409 place count 54 transition count 325
Applied a total of 1409 rules in 101 ms. Remains 54 /5622 variables (removed 5568) and now considering 325/5449 (removed 5124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 54/5622 places, 325/5449 transitions.
Successfully produced net in file /tmp/petri1000_14266996103587709679.dot
Successfully produced net in file /tmp/petri1001_9654372679451308187.dot
Successfully produced net in file /tmp/petri1002_15762796140831754524.dot
Successfully produced net in file /tmp/petri1003_15766023250014051435.dot
Successfully produced net in file /tmp/petri1004_1568470491164800999.dot
Successfully produced net in file /tmp/petri1005_6913651229655388365.dot
Successfully produced net in file /tmp/petri1006_16170233716756207798.dot
Successfully produced net in file /tmp/petri1007_8831407674350402984.dot
Successfully produced net in file /tmp/petri1008_11353808136015166400.dot
Successfully produced net in file /tmp/petri1009_4296609375528322538.dot
Successfully produced net in file /tmp/petri1010_684521044626078324.dot
Successfully produced net in file /tmp/petri1011_10520729678056010420.dot
Successfully produced net in file /tmp/petri1012_5412601817989795127.dot
Successfully produced net in file /tmp/petri1013_7808495042739500047.dot
Successfully produced net in file /tmp/petri1014_11438547987351828199.dot
Successfully produced net in file /tmp/petri1015_17183534823626436206.dot
Successfully produced net in file /tmp/petri1016_17137925269139917176.dot
Successfully produced net in file /tmp/petri1017_10781760925638575102.dot
Successfully produced net in file /tmp/petri1018_183279233189498716.dot
Successfully produced net in file /tmp/petri1019_11361041342673951125.dot
Successfully produced net in file /tmp/petri1020_10828171363257343680.dot
Successfully produced net in file /tmp/petri1021_3024593772381582936.dot
Successfully produced net in file /tmp/petri1022_8126138326966982722.dot
Successfully produced net in file /tmp/petri1023_3005798140981993625.dot
Successfully produced net in file /tmp/petri1024_17743614244795139331.dot
Successfully produced net in file /tmp/petri1025_1010731621431061721.dot
Successfully produced net in file /tmp/petri1026_4374019213496245652.dot
Successfully produced net in file /tmp/petri1027_4790000585332758504.dot
Successfully produced net in file /tmp/petri1028_5398286820663588769.dot
Successfully produced net in file /tmp/petri1029_722251045488380339.dot
Successfully produced net in file /tmp/petri1030_5221052198360237012.dot
Successfully produced net in file /tmp/petri1031_12605373893826757047.dot
Successfully produced net in file /tmp/petri1032_11542202218685533037.dot
Successfully produced net in file /tmp/petri1033_3336457718646256625.dot
Successfully produced net in file /tmp/petri1034_12204363513293360031.dot
Successfully produced net in file /tmp/petri1035_2863537662288214708.dot
Successfully produced net in file /tmp/petri1036_2497233184637856179.dot
Successfully produced net in file /tmp/petri1037_14107070597161948392.dot
Successfully produced net in file /tmp/petri1038_6084199490365440235.dot
Successfully produced net in file /tmp/petri1039_7778511561702736785.dot
Successfully produced net in file /tmp/petri1040_17592420124580925223.dot
Successfully produced net in file /tmp/petri1041_9790015168980785030.dot
Successfully produced net in file /tmp/petri1042_6385040889999391933.dot
Successfully produced net in file /tmp/petri1043_6533523985786224132.dot
Successfully produced net in file /tmp/petri1044_1837226509098131176.dot
Drop transitions removed 45 transitions
Dominated transitions for bounds rules discarded 45 transitions
Normalized transition count is 40 out of 280 initially.
// Phase 1: matrix 40 rows 54 cols
[2023-03-22 14:57:57] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 137624 resets, run finished after 1503 ms. (steps per millisecond=665 ) properties (out of 4) seen :4
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 61772 ms.

BK_STOP 1679497086673

--------------------
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-S32C3"
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-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 r229-tall-167856413300509"
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 ;