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.r233-tall-167856419400805.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 ltsminxred
Input is MultiCrashLeafsetExtension-PT-S24C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400805
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 15K Feb 26 02:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 02:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 03:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 03:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 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 7.6M 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-S24C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679620153048

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 01:09:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 01:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 01:09:14] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2023-03-24 01:09:14] [INFO ] Transformed 7032 places.
[2023-03-24 01:09:15] [INFO ] Transformed 10855 transitions.
[2023-03-24 01:09:15] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 10255 out of 10855 initially.
// Phase 1: matrix 10255 rows 7032 cols
[2023-03-24 01:09:15] [INFO ] Computed 813 place invariants in 665 ms
Incomplete random walk after 10000 steps, including 471 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 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 85 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :2
[2023-03-24 01:09:16] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2023-03-24 01:09:17] [INFO ] Computed 813 place invariants in 375 ms
[2023-03-24 01:09:18] [INFO ] [Real]Absence check using 58 positive place invariants in 99 ms returned sat
[2023-03-24 01:09:18] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 169 ms returned unsat
[2023-03-24 01:09:19] [INFO ] [Real]Absence check using 58 positive place invariants in 114 ms returned sat
[2023-03-24 01:09:19] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 334 ms returned sat
[2023-03-24 01:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:23] [INFO ] [Real]Absence check using state equation in 3795 ms returned unknown
[2023-03-24 01:09:23] [INFO ] [Real]Absence check using 58 positive place invariants in 94 ms returned sat
[2023-03-24 01:09:24] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 190 ms returned unsat
[2023-03-24 01:09:24] [INFO ] [Real]Absence check using 58 positive place invariants in 96 ms returned sat
[2023-03-24 01:09:25] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 186 ms returned unsat
[2023-03-24 01:09:25] [INFO ] [Real]Absence check using 58 positive place invariants in 91 ms returned sat
[2023-03-24 01:09:26] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 314 ms returned sat
[2023-03-24 01:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:30] [INFO ] [Real]Absence check using state equation in 3995 ms returned unknown
[2023-03-24 01:09:30] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2023-03-24 01:09:30] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 182 ms returned unsat
[2023-03-24 01:09:31] [INFO ] [Real]Absence check using 58 positive place invariants in 96 ms returned sat
[2023-03-24 01:09:31] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 185 ms returned unsat
[2023-03-24 01:09:32] [INFO ] [Real]Absence check using 58 positive place invariants in 96 ms returned sat
[2023-03-24 01:09:32] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 301 ms returned sat
[2023-03-24 01:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:36] [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 7
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-24 01:09:37] [INFO ] [Real]Absence check using 58 positive place invariants in 89 ms returned sat
[2023-03-24 01:09:37] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 184 ms returned unsat
[2023-03-24 01:09:38] [INFO ] [Real]Absence check using 58 positive place invariants in 89 ms returned sat
[2023-03-24 01:09:38] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 182 ms returned unsat
[2023-03-24 01:09:39] [INFO ] [Real]Absence check using 58 positive place invariants in 95 ms returned sat
[2023-03-24 01:09:39] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 326 ms returned sat
[2023-03-24 01:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:43] [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 10
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-24 01:09:44] [INFO ] [Real]Absence check using 58 positive place invariants in 89 ms returned sat
[2023-03-24 01:09:44] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 331 ms returned sat
[2023-03-24 01:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:48] [INFO ] [Real]Absence check using state equation in 3976 ms returned unknown
[2023-03-24 01:09:49] [INFO ] [Real]Absence check using 58 positive place invariants in 95 ms returned sat
[2023-03-24 01:09:49] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 317 ms returned sat
[2023-03-24 01:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:53] [INFO ] [Real]Absence check using state equation in 3993 ms returned unknown
[2023-03-24 01:09:54] [INFO ] [Real]Absence check using 58 positive place invariants in 88 ms returned sat
[2023-03-24 01:09:54] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 319 ms returned sat
[2023-03-24 01:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:09:58] [INFO ] [Real]Absence check using state equation in 3996 ms returned unknown
[2023-03-24 01:09:59] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2023-03-24 01:09:59] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 206 ms returned unsat
[2023-03-24 01:10:00] [INFO ] [Real]Absence check using 58 positive place invariants in 99 ms returned sat
[2023-03-24 01:10:00] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 303 ms returned sat
[2023-03-24 01:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:10:04] [INFO ] [Real]Absence check using state equation in 4012 ms returned unknown
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, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 7032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.33 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1201 place count 7000 transition count 9655
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2401 place count 5800 transition count 9655
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 2401 place count 5800 transition count 9555
Deduced a syphon composed of 100 places in 12 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 2601 place count 5700 transition count 9555
Discarding 1100 places :
Symmetric choice reduction at 2 with 1100 rule applications. Total rules 3701 place count 4600 transition count 8455
Iterating global reduction 2 with 1100 rules applied. Total rules applied 4801 place count 4600 transition count 8455
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4801 place count 4600 transition count 8451
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4809 place count 4596 transition count 8451
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 5359 place count 4046 transition count 7351
Iterating global reduction 2 with 550 rules applied. Total rules applied 5909 place count 4046 transition count 7351
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 5957 place count 4022 transition count 7327
Free-agglomeration rule (complex) applied 315 times.
Iterating global reduction 2 with 315 rules applied. Total rules applied 6272 place count 4022 transition count 7562
Reduce places removed 315 places and 0 transitions.
Iterating post reduction 2 with 315 rules applied. Total rules applied 6587 place count 3707 transition count 7562
Applied a total of 6587 rules in 3826 ms. Remains 3707 /7032 variables (removed 3325) and now considering 7562/10855 (removed 3293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3828 ms. Remains : 3707/7032 places, 7562/10855 transitions.
Normalized transition count is 6697 out of 7562 initially.
// Phase 1: matrix 6697 rows 3707 cols
[2023-03-24 01:10:08] [INFO ] Computed 781 place invariants in 186 ms
Incomplete random walk after 1000000 steps, including 76419 resets, run finished after 15822 ms. (steps per millisecond=63 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2806 ms. (steps per millisecond=356 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2805 ms. (steps per millisecond=356 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2792 ms. (steps per millisecond=358 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2769 ms. (steps per millisecond=361 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2767 ms. (steps per millisecond=361 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2782 ms. (steps per millisecond=359 ) properties (out of 7) seen :0
[2023-03-24 01:10:44] [INFO ] Flow matrix only has 6697 transitions (discarded 865 similar events)
// Phase 1: matrix 6697 rows 3707 cols
[2023-03-24 01:10:44] [INFO ] Computed 781 place invariants in 159 ms
[2023-03-24 01:10:44] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-24 01:10:44] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 179 ms returned sat
[2023-03-24 01:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:10:47] [INFO ] [Real]Absence check using state equation in 2462 ms returned sat
[2023-03-24 01:10:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:10:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-24 01:10:48] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 181 ms returned sat
[2023-03-24 01:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:10:50] [INFO ] [Nat]Absence check using state equation in 2450 ms returned sat
[2023-03-24 01:10:50] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:10:50] [INFO ] [Nat]Added 3202 Read/Feed constraints in 302 ms returned unsat
[2023-03-24 01:10:51] [INFO ] [Real]Absence check using 49 positive place invariants in 60 ms returned sat
[2023-03-24 01:10:51] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 183 ms returned sat
[2023-03-24 01:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:10:53] [INFO ] [Real]Absence check using state equation in 2458 ms returned sat
[2023-03-24 01:10:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:10:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2023-03-24 01:10:54] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 187 ms returned sat
[2023-03-24 01:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:10:57] [INFO ] [Nat]Absence check using state equation in 2414 ms returned sat
[2023-03-24 01:10:57] [INFO ] [Nat]Added 3202 Read/Feed constraints in 286 ms returned unsat
[2023-03-24 01:10:57] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2023-03-24 01:10:57] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 170 ms returned sat
[2023-03-24 01:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:00] [INFO ] [Real]Absence check using state equation in 2371 ms returned sat
[2023-03-24 01:11:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:11:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2023-03-24 01:11:01] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 173 ms returned sat
[2023-03-24 01:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:03] [INFO ] [Nat]Absence check using state equation in 2486 ms returned sat
[2023-03-24 01:11:03] [INFO ] [Nat]Added 3202 Read/Feed constraints in 264 ms returned unsat
[2023-03-24 01:11:04] [INFO ] [Real]Absence check using 49 positive place invariants in 60 ms returned sat
[2023-03-24 01:11:04] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 194 ms returned sat
[2023-03-24 01:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:06] [INFO ] [Real]Absence check using state equation in 2349 ms returned sat
[2023-03-24 01:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:11:07] [INFO ] [Nat]Absence check using 49 positive place invariants in 59 ms returned sat
[2023-03-24 01:11:07] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 184 ms returned sat
[2023-03-24 01:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:09] [INFO ] [Nat]Absence check using state equation in 2419 ms returned sat
[2023-03-24 01:11:10] [INFO ] [Nat]Added 3202 Read/Feed constraints in 332 ms returned unsat
[2023-03-24 01:11:10] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2023-03-24 01:11:10] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 179 ms returned sat
[2023-03-24 01:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:13] [INFO ] [Real]Absence check using state equation in 2414 ms returned sat
[2023-03-24 01:11:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:11:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 63 ms returned sat
[2023-03-24 01:11:13] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 178 ms returned sat
[2023-03-24 01:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:16] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2023-03-24 01:11:16] [INFO ] [Nat]Added 3202 Read/Feed constraints in 268 ms returned unsat
[2023-03-24 01:11:17] [INFO ] [Real]Absence check using 49 positive place invariants in 61 ms returned sat
[2023-03-24 01:11:17] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 179 ms returned sat
[2023-03-24 01:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:19] [INFO ] [Real]Absence check using state equation in 2454 ms returned sat
[2023-03-24 01:11:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:11:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2023-03-24 01:11:20] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 181 ms returned sat
[2023-03-24 01:11:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:22] [INFO ] [Nat]Absence check using state equation in 2536 ms returned sat
[2023-03-24 01:11:23] [INFO ] [Nat]Added 3202 Read/Feed constraints in 305 ms returned unsat
[2023-03-24 01:11:23] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2023-03-24 01:11:23] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 184 ms returned sat
[2023-03-24 01:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:26] [INFO ] [Real]Absence check using state equation in 2639 ms returned sat
[2023-03-24 01:11:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:11:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2023-03-24 01:11:27] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 181 ms returned sat
[2023-03-24 01:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:29] [INFO ] [Nat]Absence check using state equation in 2427 ms returned sat
[2023-03-24 01:11:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 01:11:33] [INFO ] [Nat]Added 3202 Read/Feed constraints in 3336 ms returned sat
[2023-03-24 01:11:33] [INFO ] Computed and/alt/rep : 4662/6749/4662 causal constraints (skipped 2010 transitions) in 508 ms.
[2023-03-24 01:11:34] [INFO ] Added : 2 causal constraints over 1 iterations in 1272 ms. Result :sat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 0, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 3707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3707/3707 places, 7562/7562 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3707 transition count 7561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3706 transition count 7561
Applied a total of 2 rules in 1087 ms. Remains 3706 /3707 variables (removed 1) and now considering 7561/7562 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1088 ms. Remains : 3706/3707 places, 7561/7562 transitions.
Normalized transition count is 6695 out of 7561 initially.
// Phase 1: matrix 6695 rows 3706 cols
[2023-03-24 01:11:36] [INFO ] Computed 781 place invariants in 202 ms
Incomplete random walk after 1000000 steps, including 76432 resets, run finished after 15253 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9167 resets, run finished after 2731 ms. (steps per millisecond=366 ) properties (out of 1) seen :0
[2023-03-24 01:11:54] [INFO ] Flow matrix only has 6695 transitions (discarded 866 similar events)
// Phase 1: matrix 6695 rows 3706 cols
[2023-03-24 01:11:54] [INFO ] Computed 781 place invariants in 158 ms
[2023-03-24 01:11:54] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-24 01:11:54] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 181 ms returned sat
[2023-03-24 01:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:11:57] [INFO ] [Real]Absence check using state equation in 2409 ms returned sat
[2023-03-24 01:11:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:11:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 61 ms returned sat
[2023-03-24 01:11:57] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 176 ms returned sat
[2023-03-24 01:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:12:00] [INFO ] [Nat]Absence check using state equation in 2411 ms returned sat
[2023-03-24 01:12:00] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:12:01] [INFO ] [Nat]Added 3202 Read/Feed constraints in 813 ms returned sat
[2023-03-24 01:12:01] [INFO ] Computed and/alt/rep : 4660/6746/4660 causal constraints (skipped 2010 transitions) in 374 ms.
[2023-03-24 01:12:02] [INFO ] Added : 2 causal constraints over 1 iterations in 1076 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 3706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3706/3706 places, 7561/7561 transitions.
Applied a total of 0 rules in 524 ms. Remains 3706 /3706 variables (removed 0) and now considering 7561/7561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 3706/3706 places, 7561/7561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3706/3706 places, 7561/7561 transitions.
Applied a total of 0 rules in 519 ms. Remains 3706 /3706 variables (removed 0) and now considering 7561/7561 (removed 0) transitions.
[2023-03-24 01:12:03] [INFO ] Flow matrix only has 6695 transitions (discarded 866 similar events)
[2023-03-24 01:12:03] [INFO ] Invariant cache hit.
[2023-03-24 01:12:07] [INFO ] Implicit Places using invariants in 3290 ms returned []
[2023-03-24 01:12:07] [INFO ] Flow matrix only has 6695 transitions (discarded 866 similar events)
[2023-03-24 01:12:07] [INFO ] Invariant cache hit.
[2023-03-24 01:12:08] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:12:38] [INFO ] Performed 3351/3706 implicitness test of which 707 returned IMPLICIT in 30 seconds.
[2023-03-24 01:12:41] [INFO ] Implicit Places using invariants and state equation in 34835 ms returned [4, 7, 9, 10, 11, 15, 21, 29, 39, 51, 65, 81, 99, 120, 142, 165, 187, 188, 189, 209, 227, 243, 257, 269, 279, 287, 293, 297, 299, 306, 312, 314, 315, 316, 318, 322, 328, 336, 346, 358, 372, 388, 407, 427, 448, 468, 469, 470, 488, 504, 518, 530, 540, 548, 554, 558, 560, 562, 569, 575, 577, 578, 579, 581, 583, 587, 593, 601, 611, 623, 637, 654, 672, 691, 709, 710, 711, 727, 741, 753, 763, 771, 777, 781, 783, 785, 787, 794, 800, 802, 803, 804, 806, 808, 810, 814, 820, 828, 838, 850, 865, 881, 898, 914, 915, 916, 930, 942, 952, 960, 966, 970, 972, 974, 976, 978, 985, 991, 993, 994, 995, 997, 999, 1001, 1003, 1007, 1013, 1021, 1031, 1044, 1058, 1073, 1087, 1088, 1089, 1101, 1111, 1119, 1125, 1129, 1131, 1133, 1135, 1137, 1139, 1146, 1152, 1154, 1155, 1156, 1158, 1160, 1162, 1164, 1166, 1170, 1176, 1184, 1195, 1207, 1220, 1232, 1233, 1234, 1244, 1252, 1258, 1262, 1264, 1266, 1268, 1270, 1272, 1274, 1281, 1287, 1289, 1290, 1291, 1293, 1295, 1297, 1299, 1301, 1303, 1307, 1313, 1322, 1332, 1343, 1353, 1354, 1355, 1363, 1369, 1373, 1375, 1377, 1379, 1381, 1383, 1385, 1387, 1394, 1400, 1402, 1403, 1404, 1406, 1408, 1410, 1412, 1414, 1416, 1418, 1422, 1429, 1437, 1446, 1454, 1455, 1456, 1462, 1466, 1468, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1489, 1495, 1497, 1498, 1499, 1501, 1503, 1505, 1507, 1509, 1511, 1513, 1515, 1520, 1526, 1533, 1539, 1540, 1541, 1545, 1547, 1549, 1551, 1553, 1555, 1557, 1559, 1561, 1563, 1570, 1576, 1578, 1579, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1599, 1603, 1608, 1612, 1613, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1641, 1648, 1650, 1651, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1675, 1677, 1678, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1706, 1712, 1714, 1715, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1740, 1741, 1742, 1744, 1746, 1748, 1750, 1752, 1754, 1756, 1758, 1760, 1762, 1771, 1774, 1776, 1777, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1794, 1796, 1798, 1800, 1802, 1803, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1831, 1837, 1839, 1840, 1841, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1859, 1861, 1863, 1865, 1866, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1894, 1900, 1902, 1903, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1918, 1920, 1922, 1924, 1926, 1929, 1930, 1931, 1933, 1935, 1937, 1939, 1941, 1943, 1945, 1947, 1949, 1951, 1958, 1964, 1966, 1967, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1989, 1993, 1998, 1999, 2000, 2004, 2006, 2008, 2010, 2012, 2014, 2016, 2018, 2020, 2022, 2029, 2035, 2037, 2038, 2039, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2062, 2068, 2075, 2076, 2077, 2083, 2087, 2089, 2091, 2093, 2095, 2097, 2099, 2101, 2103, 2110, 2116, 2118, 2119, 2120, 2122, 2124, 2126, 2128, 2130, 2132, 2134, 2136, 2140, 2147, 2155, 2164, 2165, 2166, 2174, 2180, 2184, 2186, 2188, 2190, 2192, 2194, 2196, 2198, 2205, 2211, 2213, 2214, 2215, 2217, 2219, 2221, 2223, 2225, 2227, 2229, 2233, 2239, 2248, 2258, 2269, 2270, 2271, 2281, 2289, 2295, 2299, 2301, 2303, 2305, 2307, 2309, 2311, 2318, 2324, 2326, 2327, 2328, 2330, 2332, 2334, 2336, 2338, 2340, 2344, 2350, 2358, 2369, 2381, 2394, 2395, 2396, 2408, 2418, 2426, 2432, 2436, 2438, 2440, 2442, 2444, 2446, 2453, 2459, 2461, 2462, 2463, 2465, 2467, 2469, 2471, 2473, 2477, 2483, 2491, 2501, 2514, 2528, 2543, 2544, 2545, 2559, 2571, 2581, 2589, 2595, 2599, 2601, 2603, 2605, 2607, 2614, 2620, 2622, 2623, 2624, 2626, 2628, 2630, 2632, 2636, 2642, 2650, 2660, 2672, 2687, 2703, 2720, 2721, 2722, 2738, 2752, 2764, 2774, 2782, 2788, 2792, 2794, 2796, 2798, 2805, 2811, 2813, 2814, 2815, 2817, 2819, 2821, 2825, 2831, 2839, 2849, 2861, 2875, 2910, 2929, 2930, 2931, 2949, 2965, 2979, 2991, 3001, 3009, 3015, 3019, 3021, 3023, 3030, 3036, 3038, 3039, 3040, 3042, 3044, 3048, 3054, 3062, 3072, 3084, 3098, 3114, 3133, 3153, 3174, 3175, 3176, 3196, 3214, 3230, 3244, 3256, 3266, 3274, 3280, 3284, 3286, 3293, 3295, 3298, 3300, 3301, 3302, 3304, 3308, 3314, 3322, 3332, 3344, 3358, 3374, 3392, 3413, 3435, 3458, 3459, 3460, 3482, 3502, 3520, 3536, 3550, 3562, 3572, 3580, 3586, 3590, 3597]
Discarding 726 places :
Implicit Place search using SMT with State Equation took 38146 ms to find 726 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2980/3706 places, 7561/7561 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 2884 transition count 7465
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 2884 transition count 7465
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 288 place count 2788 transition count 7369
Iterating global reduction 0 with 96 rules applied. Total rules applied 384 place count 2788 transition count 7369
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 387 place count 2788 transition count 7366
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 390 place count 2785 transition count 7366
Applied a total of 390 rules in 1256 ms. Remains 2785 /2980 variables (removed 195) and now considering 7366/7561 (removed 195) transitions.
[2023-03-24 01:12:43] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
// Phase 1: matrix 6500 rows 2785 cols
[2023-03-24 01:12:43] [INFO ] Computed 55 place invariants in 226 ms
[2023-03-24 01:12:47] [INFO ] Implicit Places using invariants in 4158 ms returned [1376, 2154]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2783/3706 places, 7366/7561 transitions.
Applied a total of 0 rules in 374 ms. Remains 2783 /2783 variables (removed 0) and now considering 7366/7366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 44466 ms. Remains : 2783/3706 places, 7366/7561 transitions.
Normalized transition count is 6500 out of 7366 initially.
// Phase 1: matrix 6500 rows 2783 cols
[2023-03-24 01:12:47] [INFO ] Computed 53 place invariants in 123 ms
Incomplete random walk after 1000000 steps, including 83120 resets, run finished after 15236 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5211 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties (out of 1) seen :0
[2023-03-24 01:13:04] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
// Phase 1: matrix 6500 rows 2783 cols
[2023-03-24 01:13:05] [INFO ] Computed 53 place invariants in 119 ms
[2023-03-24 01:13:05] [INFO ] [Real]Absence check using 47 positive place invariants in 45 ms returned sat
[2023-03-24 01:13:05] [INFO ] [Real]Absence check using 47 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-24 01:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:13:07] [INFO ] [Real]Absence check using state equation in 1803 ms returned sat
[2023-03-24 01:13:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:13:07] [INFO ] [Nat]Absence check using 47 positive place invariants in 43 ms returned sat
[2023-03-24 01:13:07] [INFO ] [Nat]Absence check using 47 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-24 01:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:13:09] [INFO ] [Nat]Absence check using state equation in 1887 ms returned sat
[2023-03-24 01:13:09] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:13:10] [INFO ] [Nat]Added 3202 Read/Feed constraints in 1232 ms returned sat
[2023-03-24 01:13:11] [INFO ] Computed and/alt/rep : 4592/6680/4592 causal constraints (skipped 1814 transitions) in 347 ms.
[2023-03-24 01:13:11] [INFO ] Added : 2 causal constraints over 1 iterations in 949 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2783/2783 places, 7366/7366 transitions.
Applied a total of 0 rules in 378 ms. Remains 2783 /2783 variables (removed 0) and now considering 7366/7366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 2783/2783 places, 7366/7366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2783/2783 places, 7366/7366 transitions.
Applied a total of 0 rules in 378 ms. Remains 2783 /2783 variables (removed 0) and now considering 7366/7366 (removed 0) transitions.
[2023-03-24 01:13:12] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
[2023-03-24 01:13:12] [INFO ] Invariant cache hit.
[2023-03-24 01:13:16] [INFO ] Implicit Places using invariants in 3695 ms returned []
[2023-03-24 01:13:16] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
[2023-03-24 01:13:16] [INFO ] Invariant cache hit.
[2023-03-24 01:13:17] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:13:36] [INFO ] Implicit Places using invariants and state equation in 20311 ms returned []
Implicit Place search using SMT with State Equation took 24009 ms to find 0 implicit places.
[2023-03-24 01:13:37] [INFO ] Redundant transitions in 824 ms returned []
[2023-03-24 01:13:37] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
[2023-03-24 01:13:37] [INFO ] Invariant cache hit.
[2023-03-24 01:13:41] [INFO ] Dead Transitions using invariants and state equation in 4120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29338 ms. Remains : 2783/2783 places, 7366/7366 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13
Normalized transition count is 6500 out of 7366 initially.
// Phase 1: matrix 6500 rows 2783 cols
[2023-03-24 01:13:41] [INFO ] Computed 53 place invariants in 123 ms
Incomplete random walk after 10000 steps, including 835 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-24 01:13:42] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
// Phase 1: matrix 6500 rows 2783 cols
[2023-03-24 01:13:42] [INFO ] Computed 53 place invariants in 117 ms
[2023-03-24 01:13:42] [INFO ] [Real]Absence check using 47 positive place invariants in 43 ms returned sat
[2023-03-24 01:13:42] [INFO ] [Real]Absence check using 47 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-24 01:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:13:44] [INFO ] [Real]Absence check using state equation in 1805 ms returned sat
[2023-03-24 01:13:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:13:44] [INFO ] [Nat]Absence check using 47 positive place invariants in 45 ms returned sat
[2023-03-24 01:13:44] [INFO ] [Nat]Absence check using 47 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-24 01:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:13:46] [INFO ] [Nat]Absence check using state equation in 1914 ms returned sat
[2023-03-24 01:13:46] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:13:47] [INFO ] [Nat]Added 3202 Read/Feed constraints in 1252 ms returned sat
[2023-03-24 01:13:48] [INFO ] Computed and/alt/rep : 4592/6680/4592 causal constraints (skipped 1814 transitions) in 349 ms.
[2023-03-24 01:13:49] [INFO ] Added : 2 causal constraints over 1 iterations in 948 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2783/2783 places, 7366/7366 transitions.
Applied a total of 0 rules in 375 ms. Remains 2783 /2783 variables (removed 0) and now considering 7366/7366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 2783/2783 places, 7366/7366 transitions.
Normalized transition count is 6500 out of 7366 initially.
// Phase 1: matrix 6500 rows 2783 cols
[2023-03-24 01:13:49] [INFO ] Computed 53 place invariants in 120 ms
Incomplete random walk after 1000000 steps, including 83108 resets, run finished after 15279 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5206 resets, run finished after 1794 ms. (steps per millisecond=557 ) properties (out of 1) seen :0
[2023-03-24 01:14:06] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
// Phase 1: matrix 6500 rows 2783 cols
[2023-03-24 01:14:06] [INFO ] Computed 53 place invariants in 120 ms
[2023-03-24 01:14:07] [INFO ] [Real]Absence check using 47 positive place invariants in 44 ms returned sat
[2023-03-24 01:14:07] [INFO ] [Real]Absence check using 47 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-24 01:14:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:14:09] [INFO ] [Real]Absence check using state equation in 1784 ms returned sat
[2023-03-24 01:14:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:14:09] [INFO ] [Nat]Absence check using 47 positive place invariants in 46 ms returned sat
[2023-03-24 01:14:09] [INFO ] [Nat]Absence check using 47 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-24 01:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:14:11] [INFO ] [Nat]Absence check using state equation in 1880 ms returned sat
[2023-03-24 01:14:11] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:14:12] [INFO ] [Nat]Added 3202 Read/Feed constraints in 1243 ms returned sat
[2023-03-24 01:14:13] [INFO ] Computed and/alt/rep : 4592/6680/4592 causal constraints (skipped 1814 transitions) in 362 ms.
[2023-03-24 01:14:13] [INFO ] Added : 2 causal constraints over 1 iterations in 958 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2783/2783 places, 7366/7366 transitions.
Applied a total of 0 rules in 370 ms. Remains 2783 /2783 variables (removed 0) and now considering 7366/7366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 2783/2783 places, 7366/7366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2783/2783 places, 7366/7366 transitions.
Applied a total of 0 rules in 378 ms. Remains 2783 /2783 variables (removed 0) and now considering 7366/7366 (removed 0) transitions.
[2023-03-24 01:14:14] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
[2023-03-24 01:14:14] [INFO ] Invariant cache hit.
[2023-03-24 01:14:18] [INFO ] Implicit Places using invariants in 3748 ms returned []
[2023-03-24 01:14:18] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
[2023-03-24 01:14:18] [INFO ] Invariant cache hit.
[2023-03-24 01:14:19] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2023-03-24 01:14:36] [INFO ] Implicit Places using invariants and state equation in 17668 ms returned []
Implicit Place search using SMT with State Equation took 21418 ms to find 0 implicit places.
[2023-03-24 01:14:36] [INFO ] Redundant transitions in 765 ms returned []
[2023-03-24 01:14:36] [INFO ] Flow matrix only has 6500 transitions (discarded 866 similar events)
[2023-03-24 01:14:36] [INFO ] Invariant cache hit.
[2023-03-24 01:14:40] [INFO ] Dead Transitions using invariants and state equation in 4028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26600 ms. Remains : 2783/2783 places, 7366/7366 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13 in 59221 ms.
[2023-03-24 01:14:41] [INFO ] Flatten gal took : 476 ms
[2023-03-24 01:14:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 01:14:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2783 places, 7366 transitions and 35788 arcs took 38 ms.
Total runtime 327210 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/638/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13954612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16083728 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2023

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-S24C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, 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 r233-tall-167856419400805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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