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.r235-tall-167856422400893.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 smartxred
Input is MultiCrashLeafsetExtension-PT-S32C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422400893
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 16K Feb 26 03:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 03:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 03:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 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 16M 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-S32C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678721579961

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C02
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 15:33:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 15:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:33:02] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2023-03-13 15:33:02] [INFO ] Transformed 13544 places.
[2023-03-13 15:33:02] [INFO ] Transformed 21807 transitions.
[2023-03-13 15:33:02] [INFO ] Parsed PT model containing 13544 places and 21807 transitions and 93598 arcs in 673 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 20751 out of 21807 initially.
// Phase 1: matrix 20751 rows 13544 cols
[2023-03-13 15:33:04] [INFO ] Computed 1333 place invariants in 1634 ms
Incomplete random walk after 10000 steps, including 472 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :3
[2023-03-13 15:33:05] [INFO ] Flow matrix only has 20751 transitions (discarded 1056 similar events)
// Phase 1: matrix 20751 rows 13544 cols
[2023-03-13 15:33:06] [INFO ] Computed 1333 place invariants in 1480 ms
[2023-03-13 15:33:08] [INFO ] [Real]Absence check using 74 positive place invariants in 290 ms returned sat
[2023-03-13 15:33:08] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 390 ms returned unsat
[2023-03-13 15:33:10] [INFO ] [Real]Absence check using 74 positive place invariants in 285 ms returned sat
[2023-03-13 15:33:11] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 779 ms returned sat
[2023-03-13 15:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 15:33:15] [INFO ] [Real]Absence check using 74 positive place invariants in 281 ms returned sat
[2023-03-13 15:33:16] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 637 ms returned unsat
[2023-03-13 15:33:17] [INFO ] [Real]Absence check using 74 positive place invariants in 288 ms returned sat
[2023-03-13 15:33:18] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 761 ms returned sat
[2023-03-13 15:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:21] [INFO ] [Real]Absence check using state equation in 2723 ms returned unknown
[2023-03-13 15:33:22] [INFO ] [Real]Absence check using 74 positive place invariants in 283 ms returned sat
[2023-03-13 15:33:23] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 736 ms returned sat
[2023-03-13 15:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:26] [INFO ] [Real]Absence check using state equation in 2795 ms returned unknown
[2023-03-13 15:33:27] [INFO ] [Real]Absence check using 74 positive place invariants in 256 ms returned sat
[2023-03-13 15:33:28] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 786 ms returned sat
[2023-03-13 15:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:31] [INFO ] [Real]Absence check using state equation in 2770 ms returned unknown
[2023-03-13 15:33:32] [INFO ] [Real]Absence check using 74 positive place invariants in 261 ms returned sat
[2023-03-13 15:33:33] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 395 ms returned unsat
[2023-03-13 15:33:34] [INFO ] [Real]Absence check using 74 positive place invariants in 277 ms returned sat
[2023-03-13 15:33:35] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 817 ms returned sat
[2023-03-13 15:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:38] [INFO ] [Real]Absence check using state equation in 2576 ms returned unknown
[2023-03-13 15:33:39] [INFO ] [Real]Absence check using 74 positive place invariants in 265 ms returned sat
[2023-03-13 15:33:40] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 762 ms returned sat
[2023-03-13 15:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:43] [INFO ] [Real]Absence check using state equation in 2785 ms returned unknown
[2023-03-13 15:33:44] [INFO ] [Real]Absence check using 74 positive place invariants in 265 ms returned sat
[2023-03-13 15:33:45] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 374 ms returned unsat
[2023-03-13 15:33:46] [INFO ] [Real]Absence check using 74 positive place invariants in 261 ms returned sat
[2023-03-13 15:33:47] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 782 ms returned sat
[2023-03-13 15:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 15:33:51] [INFO ] [Real]Absence check using 74 positive place invariants in 281 ms returned sat
[2023-03-13 15:33:52] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 395 ms returned unsat
[2023-03-13 15:33:53] [INFO ] [Real]Absence check using 74 positive place invariants in 266 ms returned sat
[2023-03-13 15:33:54] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 770 ms returned sat
[2023-03-13 15:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:57] [INFO ] [Real]Absence check using state equation in 2629 ms returned unknown
[2023-03-13 15:33:58] [INFO ] [Real]Absence check using 74 positive place invariants in 269 ms returned sat
[2023-03-13 15:33:59] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 384 ms returned unsat
[2023-03-13 15:34:00] [INFO ] [Real]Absence check using 74 positive place invariants in 280 ms returned sat
[2023-03-13 15:34:01] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 363 ms returned unsat
[2023-03-13 15:34:02] [INFO ] [Real]Absence check using 74 positive place invariants in 267 ms returned sat
[2023-03-13 15:34:03] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 363 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 13544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Graph (complete) has 52829 edges and 13544 vertex of which 13504 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.45 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 2112 transitions
Trivial Post-agglo rules discarded 2112 transitions
Performed 2112 trivial Post agglomeration. Transition count delta: 2112
Iterating post reduction 0 with 2112 rules applied. Total rules applied 2113 place count 13504 transition count 19695
Reduce places removed 2112 places and 0 transitions.
Iterating post reduction 1 with 2112 rules applied. Total rules applied 4225 place count 11392 transition count 19695
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 4225 place count 11392 transition count 19563
Deduced a syphon composed of 132 places in 19 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 4489 place count 11260 transition count 19563
Discarding 1980 places :
Symmetric choice reduction at 2 with 1980 rule applications. Total rules 6469 place count 9280 transition count 17583
Iterating global reduction 2 with 1980 rules applied. Total rules applied 8449 place count 9280 transition count 17583
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8449 place count 9280 transition count 17579
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 8457 place count 9276 transition count 17579
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 9447 place count 8286 transition count 15599
Iterating global reduction 2 with 990 rules applied. Total rules applied 10437 place count 8286 transition count 15599
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 16 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 10503 place count 8253 transition count 15566
Free-agglomeration rule (complex) applied 575 times.
Iterating global reduction 2 with 575 rules applied. Total rules applied 11078 place count 8253 transition count 15981
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 2 with 575 rules applied. Total rules applied 11653 place count 7678 transition count 15981
Applied a total of 11653 rules in 14705 ms. Remains 7678 /13544 variables (removed 5866) and now considering 15981/21807 (removed 5826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14709 ms. Remains : 7678/13544 places, 15981/21807 transitions.
Normalized transition count is 14416 out of 15981 initially.
// Phase 1: matrix 14416 rows 7678 cols
[2023-03-13 15:34:18] [INFO ] Computed 1293 place invariants in 804 ms
Interrupted random walk after 990316 steps, including 75808 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3718 ms. (steps per millisecond=268 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3911 ms. (steps per millisecond=255 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 4174 ms. (steps per millisecond=239 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3798 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3803 ms. (steps per millisecond=262 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3725 ms. (steps per millisecond=268 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 7) seen :0
[2023-03-13 15:35:15] [INFO ] Flow matrix only has 14416 transitions (discarded 1565 similar events)
// Phase 1: matrix 14416 rows 7678 cols
[2023-03-13 15:35:16] [INFO ] Computed 1293 place invariants in 686 ms
[2023-03-13 15:35:17] [INFO ] [Real]Absence check using 65 positive place invariants in 180 ms returned sat
[2023-03-13 15:35:17] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 420 ms returned sat
[2023-03-13 15:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:25] [INFO ] [Real]Absence check using state equation in 8336 ms returned sat
[2023-03-13 15:35:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:35:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 166 ms returned sat
[2023-03-13 15:35:27] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 363 ms returned sat
[2023-03-13 15:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:39] [INFO ] [Nat]Absence check using state equation in 11699 ms returned sat
[2023-03-13 15:35:39] [INFO ] State equation strengthened by 7042 read => feed constraints.
[2023-03-13 15:35:40] [INFO ] [Nat]Added 7042 Read/Feed constraints in 887 ms returned unsat
[2023-03-13 15:35:41] [INFO ] [Real]Absence check using 65 positive place invariants in 179 ms returned sat
[2023-03-13 15:35:41] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 447 ms returned sat
[2023-03-13 15:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:51] [INFO ] [Real]Absence check using state equation in 9473 ms returned sat
[2023-03-13 15:35:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:35:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 172 ms returned sat
[2023-03-13 15:35:52] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 391 ms returned sat
[2023-03-13 15:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:36:01] [INFO ] [Nat]Absence check using state equation in 8646 ms returned sat
[2023-03-13 15:36:02] [INFO ] [Nat]Added 7042 Read/Feed constraints in 1101 ms returned unsat
[2023-03-13 15:36:03] [INFO ] [Real]Absence check using 65 positive place invariants in 182 ms returned sat
[2023-03-13 15:36:03] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 436 ms returned sat
[2023-03-13 15:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:36:12] [INFO ] [Real]Absence check using state equation in 8782 ms returned sat
[2023-03-13 15:36:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:36:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 199 ms returned sat
[2023-03-13 15:36:14] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 452 ms returned sat
[2023-03-13 15:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:36:25] [INFO ] [Nat]Absence check using state equation in 10654 ms returned sat
[2023-03-13 15:36:25] [INFO ] [Nat]Added 7042 Read/Feed constraints in 744 ms returned unsat
[2023-03-13 15:36:26] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2023-03-13 15:36:27] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 451 ms returned sat
[2023-03-13 15:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:36:35] [INFO ] [Real]Absence check using state equation in 8601 ms returned sat
[2023-03-13 15:36:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:36:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 181 ms returned sat
[2023-03-13 15:36:37] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 426 ms returned sat
[2023-03-13 15:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:36:46] [INFO ] [Nat]Absence check using state equation in 8529 ms returned sat
[2023-03-13 15:36:46] [INFO ] [Nat]Added 7042 Read/Feed constraints in 720 ms returned unsat
[2023-03-13 15:36:47] [INFO ] [Real]Absence check using 65 positive place invariants in 172 ms returned sat
[2023-03-13 15:36:48] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 430 ms returned sat
[2023-03-13 15:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:36:56] [INFO ] [Real]Absence check using state equation in 8512 ms returned sat
[2023-03-13 15:36:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:36:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 178 ms returned sat
[2023-03-13 15:36:58] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 437 ms returned sat
[2023-03-13 15:36:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:37:07] [INFO ] [Nat]Absence check using state equation in 8983 ms returned sat
[2023-03-13 15:37:08] [INFO ] [Nat]Added 7042 Read/Feed constraints in 728 ms returned unsat
[2023-03-13 15:37:08] [INFO ] [Real]Absence check using 65 positive place invariants in 169 ms returned sat
[2023-03-13 15:37:09] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 449 ms returned sat
[2023-03-13 15:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:37:17] [INFO ] [Real]Absence check using state equation in 8353 ms returned sat
[2023-03-13 15:37:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:37:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 167 ms returned sat
[2023-03-13 15:37:19] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 405 ms returned sat
[2023-03-13 15:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:37:27] [INFO ] [Nat]Absence check using state equation in 8450 ms returned sat
[2023-03-13 15:37:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 15:37:31] [INFO ] [Nat]Added 7042 Read/Feed constraints in 3505 ms returned unsat
[2023-03-13 15:37:32] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2023-03-13 15:37:32] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 414 ms returned sat
[2023-03-13 15:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:37:40] [INFO ] [Real]Absence check using state equation in 7775 ms returned sat
[2023-03-13 15:37:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:37:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 172 ms returned sat
[2023-03-13 15:37:41] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 403 ms returned sat
[2023-03-13 15:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:37:51] [INFO ] [Nat]Absence check using state equation in 9639 ms returned sat
[2023-03-13 15:37:52] [INFO ] [Nat]Added 7042 Read/Feed constraints in 896 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 0, 0] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 290939 ms.
ITS solved all properties within timeout

BK_STOP 1678721873412

--------------------
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-S32C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C02, 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 r235-tall-167856422400893"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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