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.r231-tall-167856416500757.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 lolaxred
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 r231-tall-167856416500757
=====================================================================

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

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 12:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 12:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:06:16] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-22 12:06:16] [INFO ] Transformed 3606 places.
[2023-03-22 12:06:16] [INFO ] Transformed 5141 transitions.
[2023-03-22 12:06:16] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 299 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-22 12:06:16] [INFO ] Computed 459 place invariants in 239 ms
Incomplete random walk after 10000 steps, including 315 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 16) seen :7
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 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :6
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 :2
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 :7
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :6
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 :4
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :3
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 :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :2
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 :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 :2
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 :1
[2023-03-22 12:06:17] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2023-03-22 12:06:17] [INFO ] Computed 459 place invariants in 114 ms
[2023-03-22 12:06:18] [INFO ] [Real]Absence check using 44 positive place invariants in 55 ms returned sat
[2023-03-22 12:06:18] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 31 ms returned unsat
[2023-03-22 12:06:18] [INFO ] [Real]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-22 12:06:18] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 121 ms returned sat
[2023-03-22 12:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:21] [INFO ] [Real]Absence check using state equation in 2468 ms returned sat
[2023-03-22 12:06:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:06:21] [INFO ] [Nat]Absence check using 44 positive place invariants in 44 ms returned sat
[2023-03-22 12:06:21] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 131 ms returned sat
[2023-03-22 12:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:23] [INFO ] [Nat]Absence check using state equation in 1949 ms returned sat
[2023-03-22 12:06:23] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:06:24] [INFO ] [Nat]Added 1362 Read/Feed constraints in 277 ms returned unsat
[2023-03-22 12:06:24] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:06:24] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 76 ms returned unsat
[2023-03-22 12:06:25] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:06:25] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 28 ms returned unsat
[2023-03-22 12:06:25] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:06:25] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 68 ms returned unsat
[2023-03-22 12:06:25] [INFO ] [Real]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-22 12:06:25] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 28 ms returned unsat
[2023-03-22 12:06:26] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-22 12:06:26] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 127 ms returned sat
[2023-03-22 12:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:29] [INFO ] [Real]Absence check using state equation in 3563 ms returned sat
[2023-03-22 12:06:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:06:30] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-22 12:06:30] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 138 ms returned sat
[2023-03-22 12:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:32] [INFO ] [Nat]Absence check using state equation in 2111 ms returned sat
[2023-03-22 12:06:33] [INFO ] [Nat]Added 1362 Read/Feed constraints in 392 ms returned sat
[2023-03-22 12:06:36] [INFO ] Deduced a trap composed of 1256 places in 3032 ms of which 14 ms to minimize.
[2023-03-22 12:06:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-22 12:06:36] [INFO ] [Real]Absence check using 44 positive place invariants in 42 ms returned sat
[2023-03-22 12:06:36] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 153 ms returned sat
[2023-03-22 12:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:40] [INFO ] [Real]Absence check using state equation in 3822 ms returned sat
[2023-03-22 12:06:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:06:41] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2023-03-22 12:06:41] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 144 ms returned sat
[2023-03-22 12:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:43] [INFO ] [Nat]Absence check using state equation in 2025 ms returned sat
[2023-03-22 12:06:43] [INFO ] [Nat]Added 1362 Read/Feed constraints in 242 ms returned unsat
[2023-03-22 12:06:43] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:06:43] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 33 ms returned unsat
[2023-03-22 12:06:44] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-22 12:06:44] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 139 ms returned sat
[2023-03-22 12:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:47] [INFO ] [Real]Absence check using state equation in 2540 ms returned sat
[2023-03-22 12:06:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:06:47] [INFO ] [Nat]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:06:47] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 132 ms returned sat
[2023-03-22 12:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:49] [INFO ] [Nat]Absence check using state equation in 1868 ms returned sat
[2023-03-22 12:06:50] [INFO ] [Nat]Added 1362 Read/Feed constraints in 708 ms returned sat
[2023-03-22 12:06:53] [INFO ] Deduced a trap composed of 487 places in 2793 ms of which 5 ms to minimize.
[2023-03-22 12:06:53] [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-22 12:06:53] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:06:53] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 128 ms returned sat
[2023-03-22 12:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:06:57] [INFO ] [Real]Absence check using state equation in 3509 ms returned sat
[2023-03-22 12:06:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:06:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 41 ms returned sat
[2023-03-22 12:06:57] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 138 ms returned sat
[2023-03-22 12:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:00] [INFO ] [Nat]Absence check using state equation in 2311 ms returned sat
[2023-03-22 12:07:00] [INFO ] [Nat]Added 1362 Read/Feed constraints in 204 ms returned unsat
[2023-03-22 12:07:00] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-22 12:07:00] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 131 ms returned sat
[2023-03-22 12:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:04] [INFO ] [Real]Absence check using state equation in 3378 ms returned sat
[2023-03-22 12:07:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:07:04] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2023-03-22 12:07:04] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 130 ms returned sat
[2023-03-22 12:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:07] [INFO ] [Nat]Absence check using state equation in 2323 ms returned sat
[2023-03-22 12:07:07] [INFO ] [Nat]Added 1362 Read/Feed constraints in 92 ms returned unsat
[2023-03-22 12:07:07] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:07:07] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 42 ms returned unsat
[2023-03-22 12:07:07] [INFO ] [Real]Absence check using 44 positive place invariants in 36 ms returned sat
[2023-03-22 12:07:08] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 97 ms returned unsat
[2023-03-22 12:07:08] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:07:08] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 131 ms returned sat
[2023-03-22 12:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:10] [INFO ] [Real]Absence check using state equation in 2089 ms returned sat
[2023-03-22 12:07:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:07:11] [INFO ] [Nat]Absence check using 44 positive place invariants in 38 ms returned sat
[2023-03-22 12:07:11] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 132 ms returned sat
[2023-03-22 12:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:14] [INFO ] [Nat]Absence check using state equation in 2693 ms returned sat
[2023-03-22 12:07:14] [INFO ] [Nat]Added 1362 Read/Feed constraints in 898 ms returned sat
[2023-03-22 12:07:17] [INFO ] Deduced a trap composed of 301 places in 2824 ms of which 6 ms to minimize.
[2023-03-22 12:07:17] [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 14
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-22 12:07:18] [INFO ] [Real]Absence check using 44 positive place invariants in 36 ms returned sat
[2023-03-22 12:07:18] [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, 17, 1] Max seen :[1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-15 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 3 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.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 814 transitions
Trivial Post-agglo rules discarded 814 transitions
Performed 814 trivial Post agglomeration. Transition count delta: 814
Iterating post reduction 0 with 814 rules applied. Total rules applied 815 place count 3580 transition count 4327
Reduce places removed 814 places and 0 transitions.
Iterating post reduction 1 with 814 rules applied. Total rules applied 1629 place count 2766 transition count 4327
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 1629 place count 2766 transition count 4225
Deduced a syphon composed of 102 places in 3 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 1833 place count 2664 transition count 4225
Discarding 712 places :
Symmetric choice reduction at 2 with 712 rule applications. Total rules 2545 place count 1952 transition count 3513
Iterating global reduction 2 with 712 rules applied. Total rules applied 3257 place count 1952 transition count 3513
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3257 place count 1952 transition count 3509
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 3265 place count 1948 transition count 3509
Discarding 236 places :
Symmetric choice reduction at 2 with 236 rule applications. Total rules 3501 place count 1712 transition count 2801
Iterating global reduction 2 with 236 rules applied. Total rules applied 3737 place count 1712 transition count 2801
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 3771 place count 1695 transition count 2784
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 2 with 162 rules applied. Total rules applied 3933 place count 1695 transition count 3094
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 2 with 162 rules applied. Total rules applied 4095 place count 1533 transition count 3094
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 4129 place count 1533 transition count 3094
Applied a total of 4129 rules in 1125 ms. Remains 1533 /3606 variables (removed 2073) and now considering 3094/5141 (removed 2047) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1126 ms. Remains : 1533/3606 places, 3094/5141 transitions.
Normalized transition count is 2696 out of 3094 initially.
// Phase 1: matrix 2696 rows 1533 cols
[2023-03-22 12:07:19] [INFO ] Computed 433 place invariants in 40 ms
Incomplete random walk after 1000000 steps, including 52078 resets, run finished after 10236 ms. (steps per millisecond=97 ) properties (out of 3) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 8913 resets, run finished after 2382 ms. (steps per millisecond=419 ) properties (out of 1) seen :0
[2023-03-22 12:07:32] [INFO ] Flow matrix only has 2696 transitions (discarded 398 similar events)
// Phase 1: matrix 2696 rows 1533 cols
[2023-03-22 12:07:32] [INFO ] Computed 433 place invariants in 32 ms
[2023-03-22 12:07:32] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-22 12:07:32] [INFO ] [Real]Absence check using 33 positive and 400 generalized place invariants in 60 ms returned sat
[2023-03-22 12:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:33] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2023-03-22 12:07:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:07:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-22 12:07:33] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 67 ms returned sat
[2023-03-22 12:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:34] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-22 12:07:34] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:07:34] [INFO ] [Nat]Added 1362 Read/Feed constraints in 564 ms returned sat
[2023-03-22 12:07:35] [INFO ] Deduced a trap composed of 268 places in 842 ms of which 3 ms to minimize.
[2023-03-22 12:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1008 ms
[2023-03-22 12:07:35] [INFO ] Computed and/alt/rep : 1510/3074/1510 causal constraints (skipped 1169 transitions) in 246 ms.
[2023-03-22 12:07:36] [INFO ] Added : 10 causal constraints over 3 iterations in 827 ms. Result :sat
Minimization took 451 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1533/1533 places, 3094/3094 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1533 transition count 3092
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1531 transition count 3092
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1531 transition count 3090
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 1529 transition count 3090
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 1527 transition count 3088
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 1527 transition count 3088
Applied a total of 12 rules in 237 ms. Remains 1527 /1533 variables (removed 6) and now considering 3088/3094 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 1527/1533 places, 3088/3094 transitions.
Normalized transition count is 2690 out of 3088 initially.
// Phase 1: matrix 2690 rows 1527 cols
[2023-03-22 12:07:37] [INFO ] Computed 433 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 52083 resets, run finished after 10152 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8912 resets, run finished after 2393 ms. (steps per millisecond=417 ) properties (out of 1) seen :0
[2023-03-22 12:07:49] [INFO ] Flow matrix only has 2690 transitions (discarded 398 similar events)
// Phase 1: matrix 2690 rows 1527 cols
[2023-03-22 12:07:49] [INFO ] Computed 433 place invariants in 53 ms
[2023-03-22 12:07:50] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2023-03-22 12:07:50] [INFO ] [Real]Absence check using 33 positive and 400 generalized place invariants in 66 ms returned sat
[2023-03-22 12:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:50] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-22 12:07:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:07:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-22 12:07:51] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 65 ms returned sat
[2023-03-22 12:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:07:51] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2023-03-22 12:07:51] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:07:52] [INFO ] [Nat]Added 1362 Read/Feed constraints in 377 ms returned sat
[2023-03-22 12:07:53] [INFO ] Deduced a trap composed of 270 places in 849 ms of which 2 ms to minimize.
[2023-03-22 12:07:54] [INFO ] Deduced a trap composed of 130 places in 887 ms of which 2 ms to minimize.
[2023-03-22 12:07:55] [INFO ] Deduced a trap composed of 109 places in 881 ms of which 2 ms to minimize.
[2023-03-22 12:07:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2942 ms
[2023-03-22 12:07:55] [INFO ] Computed and/alt/rep : 1506/3068/1506 causal constraints (skipped 1167 transitions) in 297 ms.
[2023-03-22 12:07:56] [INFO ] Added : 14 causal constraints over 5 iterations in 1150 ms. Result :sat
Minimization took 365 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 77 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 78 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 93 ms. Remains 1527 /1527 variables (removed 0) and now considering 3088/3088 (removed 0) transitions.
[2023-03-22 12:07:57] [INFO ] Flow matrix only has 2690 transitions (discarded 398 similar events)
[2023-03-22 12:07:57] [INFO ] Invariant cache hit.
[2023-03-22 12:07:59] [INFO ] Implicit Places using invariants in 2456 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 2466 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 203 ms. Remains 938 /1133 variables (removed 195) and now considering 2893/3088 (removed 195) transitions.
[2023-03-22 12:07:59] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-22 12:07:59] [INFO ] Computed 39 place invariants in 27 ms
[2023-03-22 12:08:00] [INFO ] Implicit Places using invariants in 917 ms returned []
[2023-03-22 12:08:00] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:08:00] [INFO ] Invariant cache hit.
[2023-03-22 12:08:01] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:08:14] [INFO ] Implicit Places using invariants and state equation in 13427 ms returned []
Implicit Place search using SMT with State Equation took 14345 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 17108 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-22 12:08:14] [INFO ] Computed 39 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 56630 resets, run finished after 9913 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5685 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties (out of 1) seen :0
[2023-03-22 12:08:25] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-22 12:08:25] [INFO ] Computed 39 place invariants in 26 ms
[2023-03-22 12:08:25] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-22 12:08:25] [INFO ] [Real]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 12:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:08:26] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2023-03-22 12:08:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:08:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-22 12:08:26] [INFO ] [Nat]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 12:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:08:26] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2023-03-22 12:08:26] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:08:27] [INFO ] [Nat]Added 1362 Read/Feed constraints in 355 ms returned sat
[2023-03-22 12:08:27] [INFO ] Deduced a trap composed of 166 places in 353 ms of which 1 ms to minimize.
[2023-03-22 12:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-22 12:08:27] [INFO ] Computed and/alt/rep : 1328/1908/1328 causal constraints (skipped 1105 transitions) in 123 ms.
[2023-03-22 12:08:28] [INFO ] Added : 11 causal constraints over 3 iterations in 874 ms. Result :sat
Minimization took 411 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 64 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 64 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 60 ms. Remains 938 /938 variables (removed 0) and now considering 2893/2893 (removed 0) transitions.
[2023-03-22 12:08:29] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:08:29] [INFO ] Invariant cache hit.
[2023-03-22 12:08:30] [INFO ] Implicit Places using invariants in 869 ms returned []
[2023-03-22 12:08:30] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:08:30] [INFO ] Invariant cache hit.
[2023-03-22 12:08:30] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:08:42] [INFO ] Implicit Places using invariants and state equation in 12126 ms returned []
Implicit Place search using SMT with State Equation took 13007 ms to find 0 implicit places.
[2023-03-22 12:08:42] [INFO ] Redundant transitions in 181 ms returned []
[2023-03-22 12:08:42] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:08:42] [INFO ] Invariant cache hit.
[2023-03-22 12:08:43] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14259 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-22 12:08:43] [INFO ] Computed 39 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 566 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-22 12:08:43] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-22 12:08:43] [INFO ] Computed 39 place invariants in 25 ms
[2023-03-22 12:08:43] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-22 12:08:43] [INFO ] [Real]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 12:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:08:44] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2023-03-22 12:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:08:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-22 12:08:44] [INFO ] [Nat]Absence check using 31 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 12:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:08:44] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-22 12:08:44] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:08:45] [INFO ] [Nat]Added 1362 Read/Feed constraints in 344 ms returned sat
[2023-03-22 12:08:45] [INFO ] Deduced a trap composed of 166 places in 398 ms of which 1 ms to minimize.
[2023-03-22 12:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2023-03-22 12:08:45] [INFO ] Computed and/alt/rep : 1328/1908/1328 causal constraints (skipped 1105 transitions) in 156 ms.
[2023-03-22 12:08:46] [INFO ] Added : 11 causal constraints over 3 iterations in 917 ms. Result :sat
Minimization took 410 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 69 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 70 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-22 12:08:47] [INFO ] Computed 39 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 56633 resets, run finished after 9889 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5693 resets, run finished after 1584 ms. (steps per millisecond=631 ) properties (out of 1) seen :0
[2023-03-22 12:08:58] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
// Phase 1: matrix 2495 rows 938 cols
[2023-03-22 12:08:58] [INFO ] Computed 39 place invariants in 23 ms
[2023-03-22 12:08:58] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-22 12:08:58] [INFO ] [Real]Absence check using 31 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-22 12:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:08:59] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-22 12:08:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:08:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-22 12:08:59] [INFO ] [Nat]Absence check using 31 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-22 12:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:09:00] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-22 12:09:00] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:09:00] [INFO ] [Nat]Added 1362 Read/Feed constraints in 346 ms returned sat
[2023-03-22 12:09:00] [INFO ] Deduced a trap composed of 166 places in 390 ms of which 1 ms to minimize.
[2023-03-22 12:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2023-03-22 12:09:01] [INFO ] Computed and/alt/rep : 1328/1908/1328 causal constraints (skipped 1105 transitions) in 123 ms.
[2023-03-22 12:09:01] [INFO ] Added : 11 causal constraints over 3 iterations in 868 ms. Result :sat
Minimization took 402 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 61 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 61 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-22 12:09:02] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:09:02] [INFO ] Invariant cache hit.
[2023-03-22 12:09:03] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-22 12:09:03] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:09:03] [INFO ] Invariant cache hit.
[2023-03-22 12:09:03] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-22 12:09:15] [INFO ] Implicit Places using invariants and state equation in 12310 ms returned []
Implicit Place search using SMT with State Equation took 13171 ms to find 0 implicit places.
[2023-03-22 12:09:15] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 12:09:15] [INFO ] Flow matrix only has 2495 transitions (discarded 398 similar events)
[2023-03-22 12:09:15] [INFO ] Invariant cache hit.
[2023-03-22 12:09:16] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14355 ms. Remains : 938/938 places, 2893/2893 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 in 33270 ms.
[2023-03-22 12:09:17] [INFO ] Flatten gal took : 223 ms
[2023-03-22 12:09:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 12:09:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 938 places, 2893 transitions and 14416 arcs took 16 ms.
Total runtime 180911 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MultiCrashLeafsetExtension-PT-S16C03
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
Upper Bounds

FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679486965873

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/371/UpperBounds-4.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 BOUND FNDP 5/3600 0/5 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 79557 t fired, 4590 attempts, .
4 BOUND STEQ 5/3600 0/5 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 --
5 BOUND EXCL 5/3600 1/32 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 51406 m, 10281 m/sec, 73369 t fired, result in [0,1] .

Time elapsed: 5 secs. Pages in use: 1
# running tasks: 3 of 4 Visible: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
lola: markings : 82194
lola: fired transitions : 117732
lola: time used : 7.000000
lola: memory pages used : 2
lola: CANCELED task # 3 (type FNDP) for MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 (obsolete)
lola: CANCELED task # 4 (type EQUN) for MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06: BOUND 0 state space


Time elapsed: 7 secs. Pages in use: 2

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="lolaxred"
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 lolaxred"
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 r231-tall-167856416500757"
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 ;