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-167856420800749.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 MultiCrashLeafsetExtension-PT-S16C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 12K Feb 26 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679583244632

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=MultiCrashLeafsetExtension-PT-S16C02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 14:54:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 14:54:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 14:54:06] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-23 14:54:06] [INFO ] Transformed 2952 places.
[2023-03-23 14:54:06] [INFO ] Transformed 4255 transitions.
[2023-03-23 14:54:06] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 3983 out of 4255 initially.
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-23 14:54:06] [INFO ] Computed 421 place invariants in 235 ms
Incomplete random walk after 10000 steps, including 469 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :8
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :7
[2023-03-23 14:54:07] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-23 14:54:07] [INFO ] Computed 421 place invariants in 75 ms
[2023-03-23 14:54:07] [INFO ] [Real]Absence check using 42 positive place invariants in 45 ms returned sat
[2023-03-23 14:54:08] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 56 ms returned unsat
[2023-03-23 14:54:08] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-23 14:54:08] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 97 ms returned unsat
[2023-03-23 14:54:08] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-23 14:54:08] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 107 ms returned unsat
[2023-03-23 14:54:09] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-23 14:54:09] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 118 ms returned unsat
[2023-03-23 14:54:09] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-23 14:54:09] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2023-03-23 14:54:09] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-23 14:54:10] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned unsat
[2023-03-23 14:54:10] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-23 14:54:10] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned sat
[2023-03-23 14:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:11] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2023-03-23 14:54:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 14:54:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2023-03-23 14:54:12] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 105 ms returned sat
[2023-03-23 14:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:13] [INFO ] [Nat]Absence check using state equation in 1561 ms returned sat
[2023-03-23 14:54:14] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2023-03-23 14:54:14] [INFO ] [Nat]Added 1090 Read/Feed constraints in 61 ms returned unsat
[2023-03-23 14:54:14] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-23 14:54:14] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned unsat
[2023-03-23 14:54:14] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-23 14:54:14] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 127 ms returned unsat
[2023-03-23 14:54:15] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-23 14:54:15] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 113 ms returned unsat
[2023-03-23 14:54:15] [INFO ] [Real]Absence check using 42 positive place invariants in 29 ms returned sat
[2023-03-23 14:54:15] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 124 ms returned unsat
[2023-03-23 14:54:16] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-23 14:54:16] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned sat
[2023-03-23 14:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:17] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2023-03-23 14:54:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 14:54:18] [INFO ] [Nat]Absence check using 42 positive place invariants in 32 ms returned sat
[2023-03-23 14:54:18] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 104 ms returned sat
[2023-03-23 14:54:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:19] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2023-03-23 14:54:19] [INFO ] [Nat]Added 1090 Read/Feed constraints in 91 ms returned unsat
[2023-03-23 14:54:20] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-23 14:54:20] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 105 ms returned unsat
[2023-03-23 14:54:20] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-23 14:54:20] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 115 ms returned sat
[2023-03-23 14:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:22] [INFO ] [Real]Absence check using state equation in 1447 ms returned sat
[2023-03-23 14:54:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 14:54:22] [INFO ] [Nat]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-23 14:54:22] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 104 ms returned sat
[2023-03-23 14:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:23] [INFO ] [Nat]Absence check using state equation in 1425 ms returned sat
[2023-03-23 14:54:24] [INFO ] [Nat]Added 1090 Read/Feed constraints in 103 ms returned sat
[2023-03-23 14:54:26] [INFO ] Deduced a trap composed of 589 places in 1845 ms of which 10 ms to minimize.
[2023-03-23 14:54:28] [INFO ] Deduced a trap composed of 644 places in 1854 ms of which 3 ms to minimize.
[2023-03-23 14:54:28] [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 13
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.verifyPossible(DeadlockTester.java:916)
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-23 14:54:28] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-23 14:54:28] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned sat
[2023-03-23 14:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:29] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2023-03-23 14:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 14:54:30] [INFO ] [Nat]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-23 14:54:30] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 104 ms returned sat
[2023-03-23 14:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 14:54:32] [INFO ] [Nat]Absence check using state equation in 1710 ms returned sat
[2023-03-23 14:54:32] [INFO ] [Nat]Added 1090 Read/Feed constraints in 163 ms returned sat
[2023-03-23 14:54:34] [INFO ] Deduced a trap composed of 179 places in 1990 ms of which 4 ms to minimize.
[2023-03-23 14:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2574 ms
[2023-03-23 14:54:35] [INFO ] Computed and/alt/rep : 3608/6090/3608 causal constraints (skipped 358 transitions) in 202 ms.
[2023-03-23 14:54:35] [INFO ] Added : 0 causal constraints over 0 iterations in 203 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 17, 1] Max seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.10 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 544 place count 2928 transition count 3712
Reduce places removed 543 places and 0 transitions.
Iterating post reduction 1 with 543 rules applied. Total rules applied 1087 place count 2385 transition count 3712
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 1087 place count 2385 transition count 3644
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 1223 place count 2317 transition count 3644
Discarding 475 places :
Symmetric choice reduction at 2 with 475 rule applications. Total rules 1698 place count 1842 transition count 3169
Iterating global reduction 2 with 475 rules applied. Total rules applied 2173 place count 1842 transition count 3169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2173 place count 1842 transition count 3166
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2179 place count 1839 transition count 3166
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 2416 place count 1602 transition count 2692
Iterating global reduction 2 with 237 rules applied. Total rules applied 2653 place count 1602 transition count 2692
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 2687 place count 1585 transition count 2675
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2847 place count 1585 transition count 2752
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 3007 place count 1425 transition count 2752
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 3024 place count 1425 transition count 2752
Applied a total of 3024 rules in 1150 ms. Remains 1425 /2952 variables (removed 1527) and now considering 2752/4255 (removed 1503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1150 ms. Remains : 1425/2952 places, 2752/4255 transitions.
Normalized transition count is 2355 out of 2752 initially.
// Phase 1: matrix 2355 rows 1425 cols
[2023-03-23 14:54:36] [INFO ] Computed 397 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 76173 resets, run finished after 7414 ms. (steps per millisecond=134 ) properties (out of 2) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 37485 ms.
ITS solved all properties within timeout

BK_STOP 1679583284659

--------------------
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="MultiCrashLeafsetExtension-PT-S16C02"
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 MultiCrashLeafsetExtension-PT-S16C02, 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-167856420800749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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