fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420800757
Last Updated
May 14, 2023

About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5726.092 3600000.00 3670744.00 8211.20 1 0 1 1 1 1 ? 0 1 1 0 0 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420800757.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is MultiCrashLeafsetExtension-PT-S16C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 12K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.5M 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-S16C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679585290618

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 15:28:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 15:28:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 15:28:12] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2023-03-23 15:28:12] [INFO ] Transformed 3606 places.
[2023-03-23 15:28:12] [INFO ] Transformed 5141 transitions.
[2023-03-23 15:28:12] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 4869 out of 5141 initially.
// Phase 1: matrix 4869 rows 3606 cols
[2023-03-23 15:28:12] [INFO ] Computed 459 place invariants in 260 ms
Incomplete random walk after 10000 steps, including 317 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :5
[2023-03-23 15:28:13] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2023-03-23 15:28:13] [INFO ] Computed 459 place invariants in 115 ms
[2023-03-23 15:28:14] [INFO ] [Real]Absence check using 44 positive place invariants in 54 ms returned sat
[2023-03-23 15:28:14] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 40 ms returned unsat
[2023-03-23 15:28:14] [INFO ] [Real]Absence check using 44 positive place invariants in 47 ms returned sat
[2023-03-23 15:28:14] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 133 ms returned sat
[2023-03-23 15:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:17] [INFO ] [Real]Absence check using state equation in 2467 ms returned sat
[2023-03-23 15:28:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:28:17] [INFO ] [Nat]Absence check using 44 positive place invariants in 48 ms returned sat
[2023-03-23 15:28:18] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 130 ms returned sat
[2023-03-23 15:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:19] [INFO ] [Nat]Absence check using state equation in 1909 ms returned sat
[2023-03-23 15:28:20] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:28:20] [INFO ] [Nat]Added 1362 Read/Feed constraints in 276 ms returned unsat
[2023-03-23 15:28:20] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-23 15:28:20] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 75 ms returned unsat
[2023-03-23 15:28:21] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-23 15:28:21] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 30 ms returned unsat
[2023-03-23 15:28:21] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2023-03-23 15:28:21] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 65 ms returned unsat
[2023-03-23 15:28:21] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-23 15:28:21] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 35 ms returned unsat
[2023-03-23 15:28:22] [INFO ] [Real]Absence check using 44 positive place invariants in 36 ms returned sat
[2023-03-23 15:28:22] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 128 ms returned sat
[2023-03-23 15:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:26] [INFO ] [Real]Absence check using state equation in 3593 ms returned sat
[2023-03-23 15:28:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:28:26] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-23 15:28:26] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 132 ms returned sat
[2023-03-23 15:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:28] [INFO ] [Nat]Absence check using state equation in 2099 ms returned sat
[2023-03-23 15:28:29] [INFO ] [Nat]Added 1362 Read/Feed constraints in 427 ms returned sat
[2023-03-23 15:28:32] [INFO ] Deduced a trap composed of 1256 places in 3032 ms of which 14 ms to minimize.
[2023-03-23 15:28:32] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 15:28:32] [INFO ] [Real]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-23 15:28:32] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 130 ms returned sat
[2023-03-23 15:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:36] [INFO ] [Real]Absence check using state equation in 3877 ms returned sat
[2023-03-23 15:28:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:28:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-23 15:28:37] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 131 ms returned sat
[2023-03-23 15:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:39] [INFO ] [Nat]Absence check using state equation in 1874 ms returned sat
[2023-03-23 15:28:39] [INFO ] [Nat]Added 1362 Read/Feed constraints in 218 ms returned unsat
[2023-03-23 15:28:39] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-23 15:28:40] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 33 ms returned unsat
[2023-03-23 15:28:40] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-23 15:28:40] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 127 ms returned sat
[2023-03-23 15:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:42] [INFO ] [Real]Absence check using state equation in 2502 ms returned sat
[2023-03-23 15:28:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:28:43] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-23 15:28:43] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 147 ms returned sat
[2023-03-23 15:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:45] [INFO ] [Nat]Absence check using state equation in 1905 ms returned sat
[2023-03-23 15:28:46] [INFO ] [Nat]Added 1362 Read/Feed constraints in 739 ms returned sat
[2023-03-23 15:28:49] [INFO ] Deduced a trap composed of 487 places in 2841 ms of which 4 ms to minimize.
[2023-03-23 15:28:49] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 15:28:49] [INFO ] [Real]Absence check using 44 positive place invariants in 46 ms returned sat
[2023-03-23 15:28:49] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 143 ms returned sat
[2023-03-23 15:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:53] [INFO ] [Real]Absence check using state equation in 3553 ms returned sat
[2023-03-23 15:28:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:28:53] [INFO ] [Nat]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-23 15:28:53] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 135 ms returned sat
[2023-03-23 15:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:28:56] [INFO ] [Nat]Absence check using state equation in 2319 ms returned sat
[2023-03-23 15:28:56] [INFO ] [Nat]Added 1362 Read/Feed constraints in 213 ms returned unsat
[2023-03-23 15:28:56] [INFO ] [Real]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-23 15:28:56] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 126 ms returned sat
[2023-03-23 15:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:29:00] [INFO ] [Real]Absence check using state equation in 3397 ms returned sat
[2023-03-23 15:29:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:29:00] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-23 15:29:00] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 136 ms returned sat
[2023-03-23 15:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:29:03] [INFO ] [Nat]Absence check using state equation in 2393 ms returned sat
[2023-03-23 15:29:03] [INFO ] [Nat]Added 1362 Read/Feed constraints in 97 ms returned unsat
[2023-03-23 15:29:03] [INFO ] [Real]Absence check using 44 positive place invariants in 44 ms returned sat
[2023-03-23 15:29:03] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 44 ms returned unsat
[2023-03-23 15:29:04] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-23 15:29:04] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 103 ms returned unsat
[2023-03-23 15:29:04] [INFO ] [Real]Absence check using 44 positive place invariants in 36 ms returned sat
[2023-03-23 15:29:04] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 29 ms returned unsat
[2023-03-23 15:29:05] [INFO ] [Real]Absence check using 44 positive place invariants in 35 ms returned sat
[2023-03-23 15:29:05] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 29 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 1, 1, 1, 1, 0, 1, 17, 0, 0, 1, 1, 1, 1] Max seen :[1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.16 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 815 transitions
Trivial Post-agglo rules discarded 815 transitions
Performed 815 trivial Post agglomeration. Transition count delta: 815
Iterating post reduction 0 with 815 rules applied. Total rules applied 816 place count 3580 transition count 4326
Reduce places removed 815 places and 0 transitions.
Iterating post reduction 1 with 815 rules applied. Total rules applied 1631 place count 2765 transition count 4326
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 1631 place count 2765 transition count 4224
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 1835 place count 2663 transition count 4224
Discarding 713 places :
Symmetric choice reduction at 2 with 713 rule applications. Total rules 2548 place count 1950 transition count 3511
Iterating global reduction 2 with 713 rules applied. Total rules applied 3261 place count 1950 transition count 3511
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3261 place count 1950 transition count 3506
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 3271 place count 1945 transition count 3506
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 3508 place count 1708 transition count 2795
Iterating global reduction 2 with 237 rules applied. Total rules applied 3745 place count 1708 transition count 2795
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 3779 place count 1691 transition count 2778
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 2 with 161 rules applied. Total rules applied 3940 place count 1691 transition count 3091
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 2 with 161 rules applied. Total rules applied 4101 place count 1530 transition count 3091
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 4118 place count 1530 transition count 3091
Applied a total of 4118 rules in 1132 ms. Remains 1530 /3606 variables (removed 2076) and now considering 3091/5141 (removed 2050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 1530/3606 places, 3091/5141 transitions.
Normalized transition count is 2693 out of 3091 initially.
// Phase 1: matrix 2693 rows 1530 cols
[2023-03-23 15:29:06] [INFO ] Computed 433 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 52097 resets, run finished after 9706 ms. (steps per millisecond=103 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8911 resets, run finished after 2347 ms. (steps per millisecond=426 ) properties (out of 1) seen :0
[2023-03-23 15:29:18] [INFO ] Flow matrix only has 2693 transitions (discarded 398 similar events)
// Phase 1: matrix 2693 rows 1530 cols
[2023-03-23 15:29:18] [INFO ] Computed 433 place invariants in 56 ms
[2023-03-23 15:29:18] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2023-03-23 15:29:18] [INFO ] [Real]Absence check using 33 positive and 400 generalized place invariants in 68 ms returned sat
[2023-03-23 15:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:29:19] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2023-03-23 15:29:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:29:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 15:29:19] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 67 ms returned sat
[2023-03-23 15:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:29:20] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2023-03-23 15:29:20] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:29:20] [INFO ] [Nat]Added 1362 Read/Feed constraints in 368 ms returned sat
[2023-03-23 15:29:21] [INFO ] Deduced a trap composed of 265 places in 896 ms of which 7 ms to minimize.
[2023-03-23 15:29:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1076 ms
[2023-03-23 15:29:22] [INFO ] Computed and/alt/rep : 1508/3071/1508 causal constraints (skipped 1168 transitions) in 217 ms.
[2023-03-23 15:29:23] [INFO ] Added : 27 causal constraints over 8 iterations in 1695 ms. Result :sat
Minimization took 598 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1530/1530 places, 3091/3091 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1530 transition count 3090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1529 transition count 3090
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1529 transition count 3089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1528 transition count 3089
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 1527 transition count 3088
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 1527 transition count 3088
Applied a total of 6 rules in 213 ms. Remains 1527 /1530 variables (removed 3) and now considering 3088/3091 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 1527/1530 places, 3088/3091 transitions.
Normalized transition count is 2690 out of 3088 initially.
// Phase 1: matrix 2690 rows 1527 cols
[2023-03-23 15:29:24] [INFO ] Computed 433 place invariants in 37 ms
Incomplete random walk after 1000000 steps, including 52081 resets, run finished after 9677 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8912 resets, run finished after 2361 ms. (steps per millisecond=423 ) properties (out of 1) seen :0
[2023-03-23 15:29:36] [INFO ] Flow matrix only has 2690 transitions (discarded 398 similar events)
// Phase 1: matrix 2690 rows 1527 cols
[2023-03-23 15:29:36] [INFO ] Computed 433 place invariants in 37 ms
[2023-03-23 15:29:36] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 15:29:36] [INFO ] [Real]Absence check using 33 positive and 400 generalized place invariants in 69 ms returned sat
[2023-03-23 15:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:29:37] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2023-03-23 15:29:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:29:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-23 15:29:37] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 68 ms returned sat
[2023-03-23 15:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:29:38] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2023-03-23 15:29:38] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:29:39] [INFO ] [Nat]Added 1362 Read/Feed constraints in 621 ms returned sat
[2023-03-23 15:29:40] [INFO ] Deduced a trap composed of 270 places in 833 ms of which 3 ms to minimize.
[2023-03-23 15:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1020 ms
[2023-03-23 15:29:40] [INFO ] Computed and/alt/rep : 1506/3068/1506 causal constraints (skipped 1167 transitions) in 307 ms.
[2023-03-23 15:29:41] [INFO ] Added : 8 causal constraints over 2 iterations in 719 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1527/1527 places, 3088/3088 transitions.
Applied a total of 0 rules in 78 ms. Remains 1527 /1527 variables (removed 0) and now considering 3088/3088 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1527/1527 places, 3088/3088 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1527/1527 places, 3088/3088 transitions.
Applied a total of 0 rules in 75 ms. Remains 1527 /1527 variables (removed 0) and now considering 3088/3088 (removed 0) transitions.
[2023-03-23 15:29:41] [INFO ] Flow matrix only has 2690 transitions (discarded 398 similar events)
[2023-03-23 15:29:41] [INFO ] Invariant cache hit.
[2023-03-23 15:29:43] [INFO ] Implicit Places using invariants in 2379 ms returned [4, 7, 9, 10, 11, 12, 16, 22, 30, 40, 52, 66, 81, 95, 96, 97, 98, 110, 120, 128, 134, 138, 140, 149, 155, 157, 158, 159, 160, 162, 166, 172, 180, 190, 202, 215, 227, 228, 229, 230, 240, 248, 254, 258, 260, 262, 271, 277, 279, 280, 281, 282, 284, 286, 290, 296, 304, 314, 325, 335, 336, 337, 338, 346, 352, 356, 358, 360, 362, 371, 377, 379, 380, 381, 382, 384, 386, 388, 392, 398, 406, 415, 423, 424, 425, 426, 432, 436, 438, 440, 442, 444, 453, 459, 461, 462, 463, 464, 466, 468, 470, 472, 476, 482, 489, 495, 496, 497, 498, 502, 504, 506, 508, 510, 512, 521, 527, 529, 530, 531, 532, 534, 536, 538, 540, 542, 546, 551, 555, 556, 557, 558, 560, 562, 564, 566, 568, 570, 579, 585, 587, 588, 589, 590, 592, 594, 596, 598, 600, 602, 605, 607, 608, 609, 610, 612, 614, 616, 618, 620, 622, 631, 637, 639, 640, 641, 642, 644, 646, 648, 650, 652, 654, 656, 658, 659, 660, 661, 663, 665, 667, 669, 671, 673, 682, 684, 687, 689, 690, 691, 692, 694, 696, 698, 700, 702, 704, 706, 708, 709, 710, 711, 713, 715, 717, 719, 721, 723, 732, 738, 740, 741, 742, 743, 745, 747, 749, 751, 753, 755, 757, 759, 760, 761, 762, 764, 766, 768, 770, 772, 774, 783, 789, 791, 792, 793, 794, 796, 798, 800, 802, 804, 806, 808, 811, 812, 813, 814, 816, 818, 820, 822, 824, 826, 835, 841, 843, 844, 845, 846, 848, 850, 852, 854, 856, 858, 862, 867, 868, 869, 870, 874, 876, 878, 880, 882, 884, 893, 899, 901, 902, 903, 904, 906, 908, 910, 912, 914, 918, 924, 931, 932, 933, 934, 940, 944, 946, 948, 950, 952, 961, 967, 969, 970, 971, 972, 974, 976, 978, 980, 984, 990, 998, 1007, 1008, 1009, 1010, 1018, 1024, 1028, 1030, 1032, 1034, 1043, 1049, 1051, 1052, 1053, 1054, 1056, 1058, 1060, 1064, 1070, 1078, 1088, 1099, 1100, 1101, 1102, 1112, 1120, 1126, 1130, 1132, 1134, 1143, 1149, 1151, 1152, 1153, 1154, 1156, 1158, 1162, 1168, 1176, 1186, 1198, 1211, 1212, 1213, 1214, 1226, 1236, 1244, 1250, 1254, 1256, 1265, 1267, 1270, 1272, 1273, 1274, 1275, 1277, 1281, 1287, 1295, 1305, 1317, 1331, 1346, 1347, 1348, 1349, 1363, 1375, 1385, 1393, 1399, 1403, 1412]
Discarding 394 places :
Implicit Place search using SMT only with invariants took 2390 ms to find 394 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1133/1527 places, 3088/3088 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 1037 transition count 2992
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 1037 transition count 2992
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 288 place count 941 transition count 2896
Iterating global reduction 0 with 96 rules applied. Total rules applied 384 place count 941 transition count 2896
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 387 place count 941 transition count 2893
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 390 place count 938 transition count 2893
Applied a total of 390 rules in 189 ms. Remains 938 /1133 variables (removed 195) and now considering 2893/3088 (removed 195) transitions.
[2023-03-23 15:29:44] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:29:44] [INFO ] Computed 39 place invariants in 44 ms
[2023-03-23 15:29:45] [INFO ] Implicit Places using invariants in 946 ms returned []
[2023-03-23 15:29:45] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:29:45] [INFO ] Invariant cache hit.
[2023-03-23 15:29:45] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:29:58] [INFO ] Implicit Places using invariants and state equation in 13559 ms returned []
Implicit Place search using SMT with State Equation took 14509 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 938/1527 places, 2893/3088 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17164 ms. Remains : 938/1527 places, 2893/3088 transitions.
Normalized transition count is 2495 out of 2893 initially.
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:29:58] [INFO ] Computed 39 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 56643 resets, run finished after 9160 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5715 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 1) seen :0
[2023-03-23 15:30:09] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:30:09] [INFO ] Computed 39 place invariants in 26 ms
[2023-03-23 15:30:09] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 15:30:09] [INFO ] [Real]Absence check using 31 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-23 15:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:30:10] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-23 15:30:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:30:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 15:30:10] [INFO ] [Nat]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 15:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:30:10] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2023-03-23 15:30:10] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:30:11] [INFO ] [Nat]Added 1362 Read/Feed constraints in 293 ms returned sat
[2023-03-23 15:30:11] [INFO ] Deduced a trap composed of 166 places in 361 ms of which 0 ms to minimize.
[2023-03-23 15:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2023-03-23 15:30:11] [INFO ] Computed and/alt/rep : 1328/1908/1328 causal constraints (skipped 1105 transitions) in 153 ms.
[2023-03-23 15:30:12] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 1 ms to minimize.
[2023-03-23 15:30:13] [INFO ] Deduced a trap composed of 66 places in 400 ms of which 1 ms to minimize.
[2023-03-23 15:30:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1039 ms
[2023-03-23 15:30:13] [INFO ] Added : 12 causal constraints over 4 iterations in 2154 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 2893/2893 transitions.
Applied a total of 0 rules in 59 ms. Remains 938 /938 variables (removed 0) and now considering 2893/2893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 938/938 places, 2893/2893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 2893/2893 transitions.
Applied a total of 0 rules in 86 ms. Remains 938 /938 variables (removed 0) and now considering 2893/2893 (removed 0) transitions.
[2023-03-23 15:30:14] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:30:14] [INFO ] Invariant cache hit.
[2023-03-23 15:30:15] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-23 15:30:15] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:30:15] [INFO ] Invariant cache hit.
[2023-03-23 15:30:15] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:30:29] [INFO ] Implicit Places using invariants and state equation in 13731 ms returned []
Implicit Place search using SMT with State Equation took 14635 ms to find 0 implicit places.
[2023-03-23 15:30:29] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-23 15:30:29] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:30:29] [INFO ] Invariant cache hit.
[2023-03-23 15:30:30] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15897 ms. Remains : 938/938 places, 2893/2893 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
Normalized transition count is 2495 out of 2893 initially.
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:30:30] [INFO ] Computed 39 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 567 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-23 15:30:30] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:30:30] [INFO ] Computed 39 place invariants in 31 ms
[2023-03-23 15:30:30] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 15:30:30] [INFO ] [Real]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 15:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:30:31] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-23 15:30:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:30:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 15:30:31] [INFO ] [Nat]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 15:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:30:31] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2023-03-23 15:30:31] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:30:31] [INFO ] [Nat]Added 1362 Read/Feed constraints in 280 ms returned sat
[2023-03-23 15:30:32] [INFO ] Deduced a trap composed of 166 places in 389 ms of which 1 ms to minimize.
[2023-03-23 15:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-23 15:30:32] [INFO ] Computed and/alt/rep : 1328/1908/1328 causal constraints (skipped 1105 transitions) in 130 ms.
[2023-03-23 15:30:33] [INFO ] Deduced a trap composed of 59 places in 421 ms of which 1 ms to minimize.
[2023-03-23 15:30:34] [INFO ] Deduced a trap composed of 66 places in 401 ms of which 1 ms to minimize.
[2023-03-23 15:30:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1054 ms
[2023-03-23 15:30:34] [INFO ] Added : 12 causal constraints over 4 iterations in 2133 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 2893/2893 transitions.
Applied a total of 0 rules in 59 ms. Remains 938 /938 variables (removed 0) and now considering 2893/2893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 938/938 places, 2893/2893 transitions.
Normalized transition count is 2495 out of 2893 initially.
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:30:35] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 56642 resets, run finished after 9039 ms. (steps per millisecond=110 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5699 resets, run finished after 1527 ms. (steps per millisecond=654 ) properties (out of 1) seen :0
[2023-03-23 15:30:45] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-23 15:30:45] [INFO ] Computed 39 place invariants in 26 ms
[2023-03-23 15:30:45] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 15:30:45] [INFO ] [Real]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 15:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:30:46] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-23 15:30:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:30:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 15:30:46] [INFO ] [Nat]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 15:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:30:47] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-23 15:30:47] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:30:47] [INFO ] [Nat]Added 1362 Read/Feed constraints in 288 ms returned sat
[2023-03-23 15:30:47] [INFO ] Deduced a trap composed of 166 places in 384 ms of which 1 ms to minimize.
[2023-03-23 15:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2023-03-23 15:30:48] [INFO ] Computed and/alt/rep : 1328/1908/1328 causal constraints (skipped 1105 transitions) in 130 ms.
[2023-03-23 15:30:49] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 1 ms to minimize.
[2023-03-23 15:30:49] [INFO ] Deduced a trap composed of 66 places in 419 ms of which 1 ms to minimize.
[2023-03-23 15:30:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1066 ms
[2023-03-23 15:30:50] [INFO ] Added : 12 causal constraints over 4 iterations in 2134 ms. Result :sat
Minimization took 500 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 2893/2893 transitions.
Applied a total of 0 rules in 76 ms. Remains 938 /938 variables (removed 0) and now considering 2893/2893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 938/938 places, 2893/2893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 2893/2893 transitions.
Applied a total of 0 rules in 63 ms. Remains 938 /938 variables (removed 0) and now considering 2893/2893 (removed 0) transitions.
[2023-03-23 15:30:50] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:30:50] [INFO ] Invariant cache hit.
[2023-03-23 15:30:51] [INFO ] Implicit Places using invariants in 925 ms returned []
[2023-03-23 15:30:51] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:30:51] [INFO ] Invariant cache hit.
[2023-03-23 15:30:52] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-23 15:31:04] [INFO ] Implicit Places using invariants and state equation in 12775 ms returned []
Implicit Place search using SMT with State Equation took 13703 ms to find 0 implicit places.
[2023-03-23 15:31:04] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-23 15:31:04] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-23 15:31:04] [INFO ] Invariant cache hit.
[2023-03-23 15:31:05] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14941 ms. Remains : 938/938 places, 2893/2893 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 in 35451 ms.
[2023-03-23 15:31:06] [INFO ] Flatten gal took : 243 ms
[2023-03-23 15:31:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 15:31:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 938 places, 2893 transitions and 14416 arcs took 17 ms.
Total runtime 173932 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 938 NrTr: 2893 NrArc: 14416)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.333sec

net check time: 0m 0.002sec

init dd package: 0m 2.852sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10416008 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093496 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.027sec

21436 37364 58977 112794 153921 200406 336187 565505 751457

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-S16C03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420800757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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